Minimum principle sufficiency
- 1 May 1992
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 57 (1), 1-14
- https://doi.org/10.1007/bf01581071
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Finite termination of the proximal point algorithmMathematical Programming, 1991
- Error bounds for nondegenerate monotone linear complementarity problemsMathematical Programming, 1990
- A simple characterization of solution sets of convex programsOperations Research Letters, 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
- A stable theorem of the alternative: an extension of the gordan theoremLinear Algebra and its Applications, 1981
- Optimal simplex tableau characterization of unique and bounded solutions of linear programsJournal of Optimization Theory and Applications, 1981
- Locally unique solutions of quadratic programs, linear and nonlinear complementarity problemsMathematical Programming, 1980
- Nonlinear Perturbation of Linear ProgramsSIAM Journal on Control and Optimization, 1979
- Necessary and sufficient conditions for a penalty method to be exactMathematical Programming, 1975