A sequential equality constrained quadratic programming algorithm for inequality constrained optimization

In this paper, the feasible type SQP method is improved. A new SQP algorithm is presented to solve the nonlinear inequality constrained optimization. As compared with the existing SQP methods, per single iteration, in order to obtain the search direction, it is only necessary to solve equality constrained quadratic programming subproblems and systems of linear equations. Under some suitable conditions, the global and superlinear convergence can be induced.

[1]  D. Mayne,et al.  A surperlinearly convergent algorithm for constrained optimization problems , 1982 .

[2]  P. Boggs,et al.  A strategy for global convergence in a sequential quadratic programming algorithm , 1989 .

[3]  Shih-Ping Han,et al.  Superlinearly convergent variable metric algorithms for general nonlinear programming problems , 1976, Math. Program..

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

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

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

[7]  J. Douglas Faires,et al.  Numerical Analysis , 1981 .

[8]  Zhibin Zhu,et al.  A globally and superlinearly convergent feasible QP-free method for nonlinear programming , 2005, Appl. Math. Comput..

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

[10]  Paul T. Boggs,et al.  Sequential Quadratic Programming , 1995, Acta Numerica.

[11]  Masao Fukushima,et al.  A successive quadratic programming algorithm with global and superlinear convergence properties , 1986, Math. Program..

[12]  Peter Spellucci,et al.  An SQP method for general nonlinear programs using only equality constrained subproblems , 1998, Math. Program..

[13]  E. Panier,et al.  A QP-Free, globally convergent, locally superlinearly convergent algorithm for inequality constrained optimization , 1988 .

[14]  S. Sallam,et al.  Stable quartic spline integration method for solving stiff ordinary differential equations , 2000, Appl. Math. Comput..

[15]  Craig T. Lawrence,et al.  A Computationally Efficient Feasible Sequential Quadratic Programming Algorithm , 2000, SIAM J. Optim..

[16]  E. Panier,et al.  A superlinearly convergent feasible method for the solution of inequality constrained optimization problems , 1987 .

[17]  André L. Tits,et al.  On combining feasibility, descent and superlinear convergence in inequality constrained optimization , 1993, Math. Program..

[18]  M. J. D. Powell,et al.  A fast algorithm for nonlinearly constrained optimization calculations , 1978 .

[19]  J. F. Bonnans,et al.  Avoiding the Maratos effect by means of a nonmonotone line search II. Inequality constrained problems—feasible iterates , 1992 .

[20]  Michael M. Kostreva,et al.  A superlinearly convergent method of feasible directions , 2000, Appl. Math. Comput..