A primal-dual trust-region algorithm for non-convex nonlinear programming

Abstract.A new primal-dual algorithm is proposed for the minimization of non-convex objective functions subject to general inequality and linear equality constraints. The method uses a primal-dual trust-region model to ensure descent on a suitable merit function. Convergence is proved to second-order critical points from arbitrary starting points. Numerical results are presented for general quadratic programs.

[1]  Robert Mifflin.  Convergence bounds for nonlinear programming algorithms , 1975, Math. Program..

[2]  T. M. Williams,et al.  Practical Methods of Optimization. Vol. 1: Unconstrained Optimization , 1980 .

[3]  Philip E. Gill,et al.  Practical optimization , 1981 .

[4]  Nicholas I. M. Gould,et al.  On practical conditions for the existence and uniqueness of solutions to the general equality quadratic programming problem , 1985, Math. Program..

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

[6]  N. Gould.  On the convegence of a sequential penalty function method for constrained minimization , 1989 .

[7]  N. Gould.  An Algorithm for Large-Scale Quadratic Programming , 1991 .

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

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

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

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

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

[13]  F. Giannessi,et al.  Nonlinear Optimization and Applications , 1996, Springer US.

[14]  P. Toint,et al.  A note on the second-order convergence of optimization algorithms using barrier functions , 1997 .

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

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

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

[18]  Nicholas I. M. Gould,et al.  A note on the convergence of barrier algorithms to second-order necessary points , 1999, Math. Program..

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

[20]  Nicholas I. M. Gould,et al.  Solving the Trust-Region Subproblem using the Lanczos Method , 1999, SIAM J. Optim..

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

[22]  Nicholas I. M. Gould,et al.  On the Solution of Equality Constrained Quadratic Programming Problems Arising in Optimization , 2001, SIAM J. Sci. Comput..