Generalized monotone line search SQP algorithm for constrained minimax problems

In this article, non-linear minimax problems with general constraints are discussed. By means of solving one quadratic programming an improved direction is yielded and a second-order correction direction can also be at hand via one system of linear equations. So a new algorithm for solving the discussed problems is presented. In connection with a special merit function, the generalized monotone line search is used to yield the step size at each iteration. Under mild conditions, we can ensure global and superlinear convergence. Finally, some numerical experiments are operated to test our algorithm, and the results demonstrate that it is promising.

[1]  Chun-Ming Tang,et al.  A feasible descent SQP algorithm for general constrained optimization without strict complementarity , 2005 .

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

[3]  Berç Rustem,et al.  An Algorithm for the Inequality-Constrained Discrete Min-Max Problem , 1998, SIAM J. Optim..

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

[5]  Fang Wu,et al.  Sequential systems of linear equations algorithm for nonlinear optimization problems--general constrained problems , 2004, Appl. Math. Comput..

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

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

[8]  G. He,et al.  Sequential Systems of Linear Equations Algorithm for Nonlinear Optimization Problems with General Constraints , 1997 .

[9]  Napsu Karmitsa,et al.  Test problems for large-scale nonsmooth minimization , 2007 .

[10]  Anders Forsgren,et al.  Interior Methods for Nonlinear Optimization , 2002, SIAM Rev..

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

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

[13]  A. Tits,et al.  Nonmonotone line search for minimax problems , 1993 .

[14]  Ya-Xiang Yuan,et al.  A Robust Algorithm for Optimization with General Equality and Inequality Constraints , 2000, SIAM J. Sci. Comput..

[15]  N. Maratos,et al.  Exact penalty function algorithms for finite dimensional and control optimization problems , 1978 .

[16]  M. J. D. Powell,et al.  THE CONVERGENCE OF VARIABLE METRIC METHODS FOR NONLINEARLY CONSTRAINED OPTIMIZATION CALCULATIONS , 1978 .

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

[18]  Y. H. Yu,et al.  Nonmonotone Line Search Algorithm for Constrained Minimax Problems , 2002 .

[19]  Chun-Ming Tang,et al.  A new norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization , 2005, Appl. Math. Comput..