On the Accurate Identification of Active Constraints

We consider nonlinear programs with inequality constraints, and we focus on the problem of identifying those constraints which will be active at an isolated local solution. The correct identification of active constraints is important from both a theoretical and a practical point of view. Such an identification removes the combinatorial aspect of the problem and locally reduces the inequality constrained minimization problem to an equality constrained problem which can be more easily dealt with. We present a new technique which identifies active constraints in a neighborhood of a solution and which requires neither complementary slackness nor uniqueness of the multipliers. We also present extensions to variational inequalities and numerical examples illustrating the identification technique.

[1]  Richard Bellman,et al.  Introduction to Matrix Analysis , 1972 .

[2]  R. Mifflin.  Semismooth and Semiconvex Functions in Constrained Optimization , 1977 .

[3]  Jacques Gauvin,et al.  A necessary and sufficient regularity condition to have bounded multipliers in nonconvex programming , 1977, Math. Program..

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

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

[6]  M. Kojima.  Strongly Stable Stationary Solutions in Nonlinear Programs. , 1980 .

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

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

[9]  S. M. Robinson.  Generalized equations and their solutions, part II: Applications to nonlinear programming , 1982 .

[10]  Dimitri P. Bertsekas,et al.  Constrained Optimization and Lagrange Multiplier Methods , 1982 .

[11]  F. Clarke.  Optimization And Nonsmooth Analysis , 1983 .

[12]  Jerzy Kyparisis,et al.  On uniqueness of Kuhn-Tucker multipliers in nonlinear programming , 1985, Math. Program..

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

[14]  P. Toint,et al.  Global convergence of a class of trust region algorithms for optimization with simple bounds , 1988 .

[15]  J. J. Moré,et al.  On the identification of active constraints , 1988 .

[16]  Stephen J. Wright.  Convergence of SQP-like methods for constrained optimization , 1989 .

[17]  J. Burke.  On identification of active constraints II: the nonconvex case , 1990 .

[18]  Gerardo Toraldo,et al.  Convergence properties of trust region methods for linear and convex constraints , 1990, Math. Program..

[19]  Patrick T. Harker,et al.  Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications , 1990, Math. Program..

[20]  M. Lescrenier.  Convergence of trust region algorithms for optimization with bounds when strict complementarity does not hold , 1991 .

[21]  H. Kleinmichel,et al.  On a class of hybrid methods for smooth constrained optimization , 1992 .

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

[23]  D. Klatte.  Nonlinear Optimization Problems under Data Perturbations , 1992 .

[24]  Jong-Shi Pang,et al.  Nonsmooth Equations: Motivation and Algorithms , 1993, SIAM J. Optim..

[25]  Liqun Qi,et al.  A nonsmooth version of Newton's method , 1993, Math. Program..

[26]  Stephen J. Wright.  Identifiable Surfaces in Constrained Optimization , 1993 .

[27]  Liqun Qi,et al.  Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations , 1993, Math. Oper. Res..

[28]  Zhi-Quan Luo,et al.  Error bounds for analytic systems and their applications , 1994, Math. Program..

[29]  J. Pang,et al.  Stability analysis of variational inequalities and nonlinear complementarity problems, via the mixed linear complementarity problem and degree theory , 1994 .

[30]  J. F. Bonnans,et al.  Local analysis of Newton-type methods for variational inequalities and nonlinear programming , 1994 .

[31]  Yin Zhang,et al.  A Study of Indicators for Identifying Zero Variables in Interior-Point Methods , 1994, SIAM Rev..

[32]  D. Klatte.  On Quantitative Stability for C1,1 Programs , 1995 .

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

[34]  Jiming Liu.  Strong Stability in Variational Inequalities , 1995 .

[35]  Yin Zhang,et al.  On the convergence rate of Newton interior-point methods in the absence of strict complementarity , 1996, Comput. Optim. Appl..

[36]  Stephen J. Wright.  Superlinear Convergence of a Stabilized SQP Method to a Degenerate Solution , 1998, Comput. Optim. Appl..

[37]  Francisco Facchinei,et al.  Convergence to Second Order Stationary Points in Inequality Constrained Optimization , 1998, Math. Oper. Res..

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