A Truncated Newton Method for the Solution of Large-Scale Inequality Constrained Minimization Problems

A new active set Newton-type algorithm for the solution of inequality constrained minimization problems is proposed. The algorithm possesses the following favorable characteristics: (i) global convergence under mild assumptions; (ii) superlinear convergence of primal variables without strict complementarity; (iii) a Newton-type direction computed by means of a truncated conjugate gradient method. Preliminary computational results are reported to show viability of the approach in large scale problems having only a limited number of constraints.

[1]  Nicholas I. M. Gould,et al.  Lancelot: A FORTRAN Package for Large-Scale Nonlinear Optimization (Release A) , 1992 .

[2]  Lorenz T. Biegler,et al.  Global and Local Convergence of Line Search Filter Methods for Nonlinear Programming , 2002 .

[3]  Jorge Nocedal,et al.  Assessing the Potential of Interior Methods for Nonlinear Optimization , 2003 .

[4]  L. Grippo,et al.  A new augmented Lagrangian function for inequality constraints in nonlinear programming problems , 1982 .

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

[6]  G. Contaldi,et al.  A continuously differentiable exact penalty function for nonlinear programming problems with unbounded feasible set , 1993, Oper. Res. Lett..

[7]  Stefano Lucidi,et al.  New Results on a Continuously Differentiable Exact Penalty Function , 1992, SIAM J. Optim..

[8]  S. Lucidi.  New results on a class of exact augmented Lagrangians , 1988 .

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

[10]  Francisco Facchinei,et al.  Minimization of SC1 functions and the Maratos effect , 1995, Oper. Res. Lett..

[11]  L. Grippo,et al.  A truncated Newton method with nonmonotone line search for unconstrained optimization , 1989 .

[12]  S. Lucidi,et al.  Quadratically and superlinearly convergent algorithms for the solution of inequality constrained minimization problems , 1995 .

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

[14]  R. D. Murphy,et al.  Iterative solution of nonlinear equations , 1994 .

[15]  Liqun Qi,et al.  Globally and Superlinearly Convergent QP-Free Algorithm for Nonlinear Constrained Optimization , 2002 .

[16]  Dimitri P. Bertsekas,et al.  Constrained Optimization and Lagrange Multiplier Methods , 1982 .

[17]  O. Mangasarian,et al.  The Fritz John Necessary Optimality Conditions in the Presence of Equality and Inequality Constraints , 1967 .

[18]  James M. Ortega,et al.  Iterative solution of nonlinear equations in several variables , 2014, Computer science and applied mathematics.

[19]  L. Grippo,et al.  Exact penalty functions in constrained optimization , 1989 .

[20]  Jorge Nocedal,et al.  Feasible Interior Methods Using Slacks for Nonlinear Optimization , 2003, Comput. Optim. Appl..

[21]  Francisco Facchinei,et al.  An RQP algorithm using a differentiable exact penalty function for inequality constrained problems , 1992, Math. Program..

[22]  Liqun Qi,et al.  A Globally and Superlinearly Convergent SQP Algorithm for Nonlinear Constrained Optimization , 2001, J. Glob. Optim..

[23]  L. Grippo,et al.  A class of nonmonotone stabilization methods in unconstrained optimization , 1991 .

[24]  Torkel Glad,et al.  A multiplier method with automatic limitation of penalty growth , 1979, Math. Program..

[25]  Hande Y. Benson,et al.  INTERIOR-POINT METHODS FOR NONCONVEX NONLINEAR PROGRAMMING: JAMMING AND COMPARATIVE NUMERICAL TESTING , 2000 .

[26]  Francisco Facchinei,et al.  Robust Recursive Quadratic Programming Algorithm Model with Global and Superlinear Convergence Properties , 1997 .

[27]  Josef Stoer,et al.  Numerische Mathematik 1 , 1989 .

[28]  Michael A. Saunders,et al.  SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization , 2002, SIAM J. Optim..

[29]  L. Grippo,et al.  A Continuously Differentiable Exact Penalty Function for Nonlinear Programming Problems with Inequality Constraints , 1985 .

[30]  Peter Spellucci,et al.  A new technique for inconsistent QP problems in the SQP method , 1998, Math. Methods Oper. Res..

[31]  Nicholas I. M. Gould,et al.  A numerical comparison between the Lancelot and Minos packages for large-scale nonlinear optimization: the complete results , 1997 .

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

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

[34]  Nicholas I. M. Gould,et al.  Global Convergence of a Trust-Region SQP-Filter Algorithm for General Nonlinear Programming , 2002, SIAM J. Optim..

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

[36]  Richard Bellman,et al.  Introduction to Matrix Analysis , 1972 .

[37]  Trond Steihaug,et al.  Truncated-newtono algorithms for large-scale unconstrained optimization , 1983, Math. Program..

[38]  Richard Bellman,et al.  Introduction to matrix analysis (2nd ed.) , 1997 .