A Feasible Sequential Linear Equation Method for Inequality Constrained Optimization

In this paper, by means of the concept of the working set, which is an estimate of the active set, we propose a feasible sequential linear equation algorithm for solving inequality constrained optimization problems. At each iteration of the proposed algorithm, we first solve one system of linear equations with a coefficient matrix of size m × m (where m is the number of constraints) to compute the working set; we then solve a subproblem which consists of four reduced systems of linear equations with a common coefficient matrix. Unlike existing QP-free algorithms, the subproblem is concerned with only the constraints corresponding to the working set. The constraints not in the working set are neglected. Consequently, the dimension of each subproblem is not of full dimension. Without assuming the isolatedness of the stationary points, we prove that every accumulation point of the sequence generated by the proposed algorithm is a KKT point of the problem. Moreover, after finitely many iterations, the working set becomes independent of the iterates and is essentially the same as the active set of the KKT point. In other words, after finitely many steps, only those constraints which are active at the solution will be involved in the subproblem. Under some additional conditions, we show that the convergence rate is two-step superlinear or even Q-superlinear. We also report some preliminary numerical experiments to show that the proposed algorithm is practicable and effective for the test problems.

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

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

[3]  Francisco Facchinei,et al.  A Truncated Newton Algorithm for Large Scale Box Constrained Optimization , 2002, SIAM J. Optim..

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

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

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

[7]  Stephen M. Robinson,et al.  Strongly Regular Generalized Equations , 1980, Math. Oper. Res..

[8]  Francisco Facchinei,et al.  An Active Set Newton Algorithm for Large-Scale Nonlinear Programs with Box Constraints , 1998, SIAM J. Optim..

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

[10]  P. Boggs,et al.  On the Local Convergence of Quasi-Newton Methods for Constrained Optimization , 1982 .

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

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

[13]  Sasan Bakhtiari,et al.  A Simple Primal-Dual Feasible Interior-Point Method for Nonlinear Programming with Monotone Descent , 2003, Comput. Optim. Appl..

[14]  Liqun Qi,et al.  Corrigendum: On the Constant Positive Linear Dependence Condition and Its Application to SQP Methods , 2000, SIAM J. Optim..

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

[16]  Christian Kanzow,et al.  A QP-free constrained Newton-type method for variational inequality problems , 1999, Math. Program..

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

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

[19]  J. J. Moré,et al.  A Characterization of Superlinear Convergence and its Application to Quasi-Newton Methods , 1973 .

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

[21]  Zengxin Wei,et al.  On the Constant Positive Linear Dependence Condition and Its Application to SQP Methods , 1999, SIAM J. Optim..

[22]  F. Facchinei,et al.  Local Feasible QP-Free Algorithms for the Constrained Minimization of SC1 Functions , 2003 .

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

[24]  Liqun Qi,et al.  A New QP-Free, Globally Convergent, Locally Superlinearly Convergent Algorithm For Inequality Constrained Optimization , 2000, SIAM J. Optim..

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

[26]  Francisco Facchinei,et al.  On the Accurate Identification of Active Constraints , 1998, SIAM J. Optim..

[27]  Richard A. Tapia,et al.  On the Characterization of Q-superlinear Convergence of Quasi-Newton Methods for Constrained Optimization , 1987 .

[28]  Jorge J. Moré,et al.  Computing a Trust Region Step , 1983 .

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

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

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

[32]  A. Tits,et al.  A Primal-Dual Interior-Point Method for Nonconvex Optimization with Multiple Logarithmic Barrier Parameters and with Strong Convergence Properties , 1998 .

[33]  James V. Burke,et al.  A robust sequential quadratic programming method , 1989, Math. Program..

[34]  Thomas F. Coleman,et al.  Computing a Trust Region Step for a Penalty Function , 1990, SIAM J. Sci. Comput..

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