An interior algorithm for nonlinear optimization that combines line search and trust region steps

Abstract.An interior-point method for nonlinear programming is presented. It enjoys the flexibility of switching between a line search method that computes steps by factoring the primal-dual equations and a trust region method that uses a conjugate gradient iteration. Steps computed by direct factorization are always tried first, but if they are deemed ineffective, a trust region iteration that guarantees progress toward stationarity is invoked. To demonstrate its effectiveness, the algorithm is implemented in the Knitro [6,28] software package and is extensively tested on a wide selection of test problems.

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

[2]  T. Steihaug.  The Conjugate Gradient Method and Trust Regions in Large Scale Optimization , 1983 .

[3]  Lamberto Cesari,et al.  Optimization-Theory And Applications , 1983 .

[4]  R. Fletcher.  Practical Methods of Optimization , 1988 .

[5]  Jorge Nocedal,et al.  An analysis of reduced Hessian methods for constrained optimization , 1991, Math. Program..

[6]  Jorge Nocedal,et al.  Representations of quasi-Newton matrices and their use in limited memory methods , 1994, Math. Program..

[7]  J. Dussault.  Numerical stability and efficiency of penalty algorithms , 1995 .

[8]  Nicholas I. M. Gould,et al.  CUTE: constrained and unconstrained testing environment , 1995, TOMS.

[9]  Jacek Gondzio,et al.  Implementation of Interior Point Methods for Large Scale Linear Programming , 1996 .

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

[11]  Hiroshi Yamashita,et al.  Q-SUPERLINEAR CONVERGENCE OF PRIMAL-DUAL INTERIOR POINT QUASI-NEWTON METHODS FOR CONSTRAINED OPTIMIZATION , 1997 .

[12]  Hiroshi Yamashita.  A globally convergent primal-dual interior point method for constrained optimization , 1998 .

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

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

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

[16]  Jorge Nocedal,et al.  A trust region method based on interior point techniques for nonlinear programming , 2000, Math. Program..

[17]  Lorenz T. Biegler,et al.  Failure of global convergence for a class of interior point methods for nonlinear programming , 2000, Math. Program..

[18]  Florian A. Potra,et al.  Q-superlinear convergence of the iterates in primal-dual interior-point methods , 2001, Math. Program..

[19]  Nicholas I. M. Gould,et al.  Superlinear Convergence of Primal-Dual Interior Point Algorithms for Nonlinear Programming , 2000, SIAM J. Optim..

[20]  D K Smith,et al.  Numerical Optimization , 2001, J. Oper. Res. Soc..

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

[22]  Jorge J. Moré,et al.  Benchmarking optimization software with performance profiles , 2001, Math. Program..

[23]  Andreas Wächter,et al.  A Primal-Dual Interior-Point Method for Nonlinear Programming with Strong Global and Local Convergence Properties , 2003, SIAM J. Optim..

[24]  Nicholas I. M. Gould,et al.  GALAHAD, a library of thread-safe Fortran 90 packages for large-scale nonlinear optimization , 2003, TOMS.

[25]  Nicholas I. M. Gould,et al.  CUTEr and SifDec: A constrained and unconstrained testing environment, revisited , 2003, TOMS.

[26]  Jorge Nocedal,et al.  On the convergence of Newton iterations to non-stationary points , 2004, Math. Program..

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