An Interior-Point Algorithm for Nonconvex Nonlinear Programming

The paper describes an interior-point algorithm for nonconvex nonlinear programming which is a direct extension of interior-point methods for linear and quadratic programming. Major modifications include a merit function and an altered search direction to ensure that a descent direction for the merit function is obtained. Preliminary numerical testing indicates that the method is robust. Further, numerical comparisons with MINOS and LANCELOT show that the method is efficient, and has the promise of greatly reducing solution times on at least some classes of models.

[1]  M. J. D. Powell,et al.  Nonlinear Programming—Sequential Unconstrained Minimization Techniques , 1969 .

[2]  Ronald L. Graham,et al.  The Largest Small Hexagon , 1975, J. Comb. Theory, Ser. A.

[3]  Klaus Schittkowski,et al.  Test examples for nonlinear programming codes , 1980 .

[4]  Klaus Schittkowski,et al.  More test examples for nonlinear programming codes , 1981 .

[5]  David Kendrick,et al.  GAMS, a user's guide , 1988, SGNM.

[6]  P. Gill,et al.  Solving Reduced KKT Systems in Barrier Methods for Linear and Quadratic Programming , 1991 .

[7]  P. Toint,et al.  Lancelot: A FORTRAN Package for Large-Scale Nonlinear Optimization (Release A) , 1992 .

[8]  Brian W. Kernighan,et al.  AMPL: A Modeling Language for Mathematical Programming , 1993 .

[9]  Roy E. Marsten,et al.  Feature Article - Interior Point Methods for Linear Programming: Computational State of the Art , 1994, INFORMS J. Comput..

[10]  M. Bendsøe,et al.  Optimization methods for truss geometry and topology design , 1994 .

[11]  Tao Wang,et al.  An interior point potential reduction method for constrained equations , 1996, Math. Program..

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

[13]  Nicholas I. M. Gould,et al.  A globally convergent Lagrangian barrier algorithm for optimization with general inequality constraints and simple bounds , 1997, Math. Comput..

[14]  Stephen P. Boyd,et al.  Antenna array pattern synthesis via convex optimization , 1997, IEEE Trans. Signal Process..

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

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

[17]  Anders Forsgren,et al.  Primal-Dual Interior Methods for Nonconvex Nonlinear Programming , 1998, SIAM J. Optim..

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

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

[20]  P. Toint,et al.  A primal-dual algorithm for minimizing a non-convex function subject to bound and linear equality constraints , 2000 .

[21]  Leon S. Lasdon,et al.  Computational Experience with a Safeguarded Barrier Algorithm for Sparse Nonlinear Programming , 2001, Comput. Optim. Appl..