Interior Point Methods

One of the most powerful methods for solving nonlinear optimization problems known as interior point methods is to be presented in this chapter. They are related to barrier functions. The terms “interior point methods” and “barrier methods” have the same significance and may be used interchangeably. The idea is to keep the current points in the interior of the feasible region. A method for remaining in the interior of the feasible region is to add a component to the objective function, which penalizes close approaches to the boundary. This method was first suggested by Frisch 1955 and developed both in theoretical and computational details by Fiacco and McCormick (1964, 1966, 1968).

[1]  John E. Dennis,et al.  Numerical methods for unconstrained optimization and nonlinear equations , 1983, Prentice Hall series in computational mathematics.

[2]  Sven Leyffer,et al.  Nonlinear programming without a penalty function , 2002, Math. Program..

[3]  Yinyu Ye,et al.  Interior point algorithms: theory and analysis , 1997 .

[4]  Lorenz T. Biegler,et al.  Line Search Filter Methods for Nonlinear Programming: Motivation and Global Convergence , 2005, SIAM J. Optim..

[5]  J. Bunch,et al.  Direct Methods for Solving Symmetric Indefinite Systems of Linear Equations , 1971 .

[6]  Lorenz T. Biegler,et al.  Line Search Filter Methods for Nonlinear Programming: Local Convergence , 2005, SIAM J. Optim..

[7]  R. Vanderbei.  LOQO:an interior point code for quadratic programming , 1999 .

[8]  S. H. Cheng,et al.  A Modified Cholesky Algorithm Based on a Symmetric Indefinite Factorization , 1998, SIAM J. Matrix Anal. Appl..

[9]  Robert J. Vanderbei,et al.  Linear Programming: Foundations and Extensions , 1998, Kluwer international series in operations research and management service.

[10]  A. I. Perov,et al.  On the convergence of an iterative process , 1977 .

[11]  Jorge Nocedal,et al.  An Interior Point Algorithm for Large-Scale Nonlinear Programming , 1999, SIAM J. Optim..

[12]  Nicholas I. M. Gould,et al.  Trust Region Methods , 2000, MOS-SIAM Series on Optimization.

[13]  Stefan Ulbrich,et al.  A globally convergent primal-dual interior-point filter method for nonlinear programming , 2004, Math. Program..

[14]  Margaret H. Wright,et al.  Interior methods for constrained optimization , 1992, Acta Numerica.

[15]  Ya-Xiang Yuan,et al.  Optimization Theory and Methods: Nonlinear Programming , 2010 .

[16]  Anthony V. Fiacco,et al.  Nonlinear programming;: Sequential unconstrained minimization techniques , 1968 .

[17]  Anthony V. Fiacco,et al.  The Sequential Unconstrained Minimization Technique for Nonlinear Programing, a Primal-Dual Method , 1964 .

[18]  Michael L. Overton,et al.  A Primal-dual Interior Method for Nonconvex Nonlinear Programming , 1998 .

[19]  Anders Forsgren,et al.  Interior Methods for Nonlinear Optimization , 2002, SIAM Rev..

[20]  Stephen G. Nash,et al.  SUMT (Revisited) , 1998, Oper. Res..

[21]  Donald Goldfarb,et al.  A Logarithmic Barrier Function Algorithm for Quadratically Constrained Convex Quadratic Programming , 1991, SIAM J. Optim..

[22]  G. McCormick,et al.  Extensions of SUMT for Nonlinear Programming: Equality Constraints and Extrapolation , 1966 .

[23]  Roy E. Marsten,et al.  Computational experience with a globally convergent primal—dual predictor—corrector algorithm for linear programming , 1994, Math. Program..

[24]  Nicholas I. M. Gould,et al.  Numerical methods for large-scale nonlinear optimization , 2005, Acta Numerica.

[25]  Roy E. Marsten,et al.  On Implementing Mehrotra's Predictor-Corrector Interior-Point Method for Linear Programming , 1992, SIAM J. Optim..

[26]  Robert J. Vanderbei,et al.  ALPO: Another Linear Program Optimizer , 1993, INFORMS J. Comput..

[27]  Narendra Karmarkar,et al.  A new polynomial-time algorithm for linear programming , 1984, Comb..

[28]  Lorenz T. Biegler,et al.  On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming , 2006, Math. Program..

[29]  David F. Shanno,et al.  Implementing Barrier Methods for Nonlinear Programming , 1996 .

[30]  Y. Ye,et al.  On some efficient interior point methods for nonlinear convex programming , 1991 .

[31]  I. Lustig,et al.  Computational experience with a primal-dual interior point method for linear programming , 1991 .

[32]  Jorge Nocedal,et al.  On the limited memory BFGS method for large scale optimization , 1989, Math. Program..

[33]  J. Nocedal.  Updating Quasi-Newton Matrices With Limited Storage , 1980 .

[34]  T. Tsuchiya,et al.  On the formulation and theory of the Newton interior-point method for nonlinear programming , 1996 .

[35]  Stephen J. Wright.  Primal-Dual Interior-Point Methods , 1997, Other Titles in Applied Mathematics.

[36]  Robert J. Vanderbei,et al.  An Interior-Point Algorithm for Nonconvex Nonlinear Programming , 1999, Comput. Optim. Appl..