Skip to main content
Log in

A Proof of the Necessity of Linear Independence Condition and Strong Second-Order Sufficient Optimality Condition for Lipschitzian Stability in Nonlinear Programming

  • Published:
Journal of Optimization Theory and Applications Aims and scope Submit manuscript

Abstract

For a nonlinear programming problem with a canonical perturbations, we give an elementary proof of the following result: If the Karush–Kuhn–Tucker map is locally single-valued and Lipschitz continuous, then the linear independence condition for the gradients of the active constraints and the strong second-order sufficient optimality condition hold.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Robinson, S. M., Strongly Regular Generalized Equations, Mathematics of Operations Research, Vol. 5, pp. 43-62, 1980.

    Google Scholar 

  2. Cornet, B., and Laroque, G., Lipschitz Properties of Solutions in Mathematical Programming, Journal of Optimization Theory and Applications, Vol. 53, pp. 407-427, 1987.

    Google Scholar 

  3. Klatte, E., and Tammer, K., Strong Stability of Stationary Solutions and Karush-Kuhn-Tucker Points in Nonlinear Optimization, Annals of Operations Research, Vol. 27, pp. 285-308, 1990.

    Google Scholar 

  4. Dontchev, A. L., and Zolezzi, T., Well-Posed Optimization Problems, Lecture Notes in Mathematics, Springer Verlag, Berlin, Germany, Vol. 1543, 1993.

    Google Scholar 

  5. Dontchev, A. L., and Rockafellar, R. T., Characterizations of Strong Regularity for Variational Inequalities over Polyhedral Convex Sets, SIAM Journal on Optimization, Vol. 6, pp. 1087-1105, 1996.

    Google Scholar 

  6. Bonnans, J. F., and Sulem, A., Pseudopower Expansion of Solutions of Generalized Equations and Constrained Optimization Problems, Mathematical Programming, Vol. 70, pp. 123-148, 1995.

    Google Scholar 

  7. Pang, J. S., Necessary and Sufficient Conditions for Solution Stability of Parametric Nonsmooth Equations, Recent Advances in Nonsmooth Optimization, Edited by D. Z. Du, L. Qi, and R. S. Womersley, World Scientific Press, Singapore, Republic of Singapore, pp. 261-288, 1995.

    Google Scholar 

  8. Kojima, M., Strongly Stable Stationary Solutions in Nonlinear Programs, Analysis and Computation of Fixed Points, Edited by S. M. Robinson, Academic Press, New York, New York, pp. 93-138, 1980.

    Google Scholar 

  9. Jongen, H. T., MÖbert, T., RÜckmann, J., and Tammer, K., Implicit Functions and Sensitivity of Stationary Points, Linear Algebra and Applications, Vol. 95, pp. 97-109, 1987.

    Google Scholar 

  10. Klatte, D., and Kummer, B., Strong Stability in Nonlinear Programming Revisited, Journal of the Australian Mathematical Society (to appear).

  11. Dontchev, A. L., and Rockafellar, R. T., Characterizations of Lipschitzian Stability in Nonlinear Programming, Mathematical Programming with Data Perturbations, Edited by A. V. Fiacco, Marcel Dekker, New York, New York, pp. 65-82, 1997.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Dontchev, A.L. A Proof of the Necessity of Linear Independence Condition and Strong Second-Order Sufficient Optimality Condition for Lipschitzian Stability in Nonlinear Programming. Journal of Optimization Theory and Applications 98, 467–473 (1998). https://doi.org/10.1023/A:1022649803808

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1022649803808

Navigation