Lipschitzian Solutions of Perturbed Nonlinear Programming Problems
Authors:
- B. CornetBCB. Cornet
- J.-Ph. VialJVJ.-Ph. Vial
- 1 November 1986
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Control and Optimization
- Vol. 24 (6) , 1123-1137
Abstract
We prove that if a second order sufficient condition and a constraint regularity assumption hold, then for sufficiently small perturbations of the constraints and the objective function, the set of local minimizers reduces to a singleton. Moreover, the minimizes and the associated multipliers are Lipschitzian functions of the parameter.Keywords
This publication has 14 references indexed in Scilit:
- Lipschitz properties of solutions in mathematical programmingJournal of Optimization Theory and Applications, 1987
- Solution point differentiability without strict complementarity in nonlinear programming1984
- Basic results in the development of sensitivity and stability analysis in nonlinear programmingComputers & Operations Research, 1982
- Strongly Stable Stationary Solutions in Nonlinear Programs1980
- Tangent Cones, Generalized Gradients and Mathematical Programming in Banach SpacesMathematics of Operations Research, 1979
- Sensitivity analysis for nonlinear programming using penalty methodsMathematical Programming, 1976
- On the inverse function theoremPacific Journal of Mathematics, 1976
- Generalized gradients and applicationsTransactions of the American Mathematical Society, 1975
- Perturbed Kuhn-Tucker points and rates of convergence for a class of nonlinear-programming algorithmsMathematical Programming, 1974
- Definite and Semidefinite Quadratic FormsEconometrica, 1952