On Warm Starts for Interior Methods
An appealing feature of interior methods for linear programming is that the number of iterations required to solve a problem tends to be relatively insensitive to the choice of initial point. This feature has the drawback that it is difficult to design interior methods that efficiently utilize information from an optimal solution to a “nearby” problem. We discuss this feature in the context of general nonlinear programming and specialize to linear programming. We demonstrate that warm start for a particular nonlinear programming problem, given a near-optimal solution for a “nearby” problem, is closely related to an SQP method applied to an equality-constrained problem. These results are further refined for the case of linear programming.
keywordsnonlinear programming linear programming interior method warm start
- A. Forsgren, P. E. Gill, and J. D. Griffin. Iterative solution of augmented systems arising in interior methods. Report TRITA-MAT-2005-OS3, Department of Mathematics, Royal Institute of Technology, Stockholm, Sweden, 2005.Google Scholar
- A. Forsgren and G. Sporre. Relations between divergence of multipliers and convergence to infeasible points in primal-dual interior methods for nonconvex nonlinear programming. Report TRITA-MAT-2002-OS7, Department of Mathematics, Royal Institute of Technology, Stockholm, Sweden, 2002.Google Scholar
- M. Gonzalez-Lima, H. Wei, and H. Wolkowicz. A stable iterative method for linear programming. Report CORR 2004-26, Department of Combinatorics and Optimization, University of Waterloo, 2004.Google Scholar
- J. Nocedal and S. J. Wright. Numerical Optimization. Springer, New York, 1999. ISBN 0-387-98793-2.Google Scholar
- S. J. Wright. Primal-Dual Interior-Point Methods. SIAM, Society for Industrial and Applied Mathematics, Philadelphia, 1997. ISBN 0-89871-382-X.Google Scholar