On the Accurate Identification of Active Constraints
- 1 January 1998
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Optimization
- Vol. 9 (1) , 14-32
- https://doi.org/10.1137/s1052623496305882
Abstract
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.This publication has 29 references indexed in Scilit:
- Practical Optimization MethodsPublished by Springer Nature ,2000
- Convergence to Second Order Stationary Points in Inequality Constrained OptimizationMathematics of Operations Research, 1998
- On the convergence rate of Newton interior-point methods in the absence of strict complementarityComputational Optimization and Applications, 1996
- Quadratically and superlinearly convergent algorithms for the solution of inequality constrained minimization problemsJournal of Optimization Theory and Applications, 1995
- Exposing ConstraintsSIAM Journal on Optimization, 1994
- A Study of Indicators for Identifying Zero Variables in Interior-Point MethodsSIAM Review, 1994
- On the Identification of Active Constraints II: The Nonconvex CaseSIAM Journal on Numerical Analysis, 1990
- On the Identification of Active ConstraintsSIAM Journal on Numerical Analysis, 1988
- Global Convergence of a Class of Trust Region Algorithms for Optimization with Simple BoundsSIAM Journal on Numerical Analysis, 1988
- A necessary and sufficient regularity condition to have bounded multipliers in nonconvex programmingMathematical Programming, 1977