On the Identification of Active Constraints
Authors:
- James V. BurkeJBJames V. Burke
- Jorge J. MoréJMJorge J. Moré
- 1 October 1988
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Numerical Analysis
- Vol. 25 (5) , 1197-1211
Abstract
Nondegeneracy conditions that guarantee that the optimal active constraints are identified in a finite number of iterations are studied. Results of this type have only been established for a few algorithms, and then under restrictive hypothesis. The main result is a characterization of those algorithms that identify the optimal constraints in a finite number of iterations. This result is obtained with a nondegeneracy assumption which is equivalent, in the standard nonlinear programming problem, to the assumption that there is a set of strictly complementary Lagrange multipliers. As an important consequence of the authors’ results the way that this characterization applies to gradient projection and sequential quadratic programming algorithms is shown.Keywords
This publication has 16 references indexed in Scilit:
- A robust sequential quadratic programming methodMathematical Programming, 1989
- Variable metric gradient projection processes in convex feasible sets defined by nonlinear inequalitiesApplied Mathematics & Optimization, 1988
- On the convergence of projected gradient processes to singular critical pointsJournal of Optimization Theory and Applications, 1987
- Projected gradient methods for linearly constrained problemsMathematical Programming, 1987
- Global and Asymptotic Convergence Rate Estimates for a Class of Projected Gradient ProcessesSIAM Journal on Control and Optimization, 1981
- Newton’s Method and the Goldstein Step-Length Rule for Constrained Minimization ProblemsSIAM Journal on Control and Optimization, 1980
- On the Goldstein-Levitin-Polyak gradient projection methodIEEE Transactions on Automatic Control, 1976
- SUPERLINEARLY CONVERGENT ALGORITHMS FOR LINEARLY CONSTRAINED OPTIMIZATION PROBLEMS11Supported by NSF Grant GJ352921975
- A Necessary and Sufficient Qualification for Constrained OptimizationSIAM Journal on Applied Mathematics, 1971
- Generalized Kuhn–Tucker Conditions for Mathematical Programming Problems in a Banach SpaceSIAM Journal on Control, 1969