An SQP feasible descent algorithm for nonlinear inequality constrained optimization without strict complementarity

In this paper, a kind of nonlinear optimization problems with nonlinear inequality constraints are discussed, and a new SQP feasible descent algorithm for solving the problems is presented. At each iteration of the new algorithm, a convex quadratic program (QP) which always has feasible solution is solved and a master direction is obtained, then, an improved (feasible descent) direction is yielded by updating the master direction with an explicit formula, and in order to avoid the Maratos effect, a height-order correction direction is computed by another explicit formula of the master direction and the improved direction. The new algorithm is proved to be globally convergent and superlinearly convergent under mild conditions without the strict complementarity. Furthermore, the quadratic convergence rate of the algorithm is obtained when the twice derivatives of the objective function and constrained functions are adopted. Finally, some numerical tests are reported.

[1]  D. Mayne,et al.  Exact penalty function algorithm with simple updating of the penalty parameter , 1991 .

[2]  J. Jinbao.  A generalized projection-successive linear equations algorithm for nonlinearly equality and inequality constrained optimization and its rate of convergence , 1997 .

[3]  L. F. Escudero.  Book reviewMore test examples for nonlinear programming codes: Klaus SCHITTKOWSKI Volume 282 in: Lecture Notes in Economics and Mathematical Systems, Springer, Berlin, 1987, iv + 261 pages, DM49.00 , 1988 .

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

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

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

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

[8]  Shih-Ping Han.  A globally convergent method for nonlinear programming , 1975 .

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

[10]  On Well-posedness and Global Attractors for the Burgers-Ginzburg-Landau Equations , 2002 .

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

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

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

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

[15]  J. Frédéric Bonnans,et al.  Sequential Quadratic Programming with Penalization of the Displacement , 1995, SIAM J. Optim..

[16]  K. Schittkowski.  The nonlinear programming method of Wilson, Han, and Powell with an augmented Lagrangian type line search function , 1982 .

[17]  J. Jinbao,et al.  A superlinearly and quadratically convergent SQP type feasible method for constrained optimization , 2000 .

[18]  A. Tits,et al.  Avoiding the Maratos effect by means of a nonmonotone line search I. general constrained problems , 1991 .

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

[20]  Ya-Xiang Yuan,et al.  A recursive quadratic programming algorithm that uses differentiable exact penalty functions , 1986, Math. Program..

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

[22]  Jianjinbao,et al.  A SUPERLINEARLY AND QUADRATICALLY CONVERGENT SQP TYPE FEASIBLE METHOD FOR CONSTRAINED OPTIMIZATION , 2000 .

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