Skip to main content

Expansion of exact and approximate solutions in nonlinear programming

  • Conference paper
Advances in Optimization

Abstract

The perturbation theory for the standard nonlinear programming problem (finite dimensional setting, finite number of constraints, smooth data) has made decisive progress in the very recent years. Gauvin and Janin (1988, 1989) gave a formula for the derivative of the solutions under the hypotheses of standard second order sufficient condition and a (weak) directional qualification hypothesis due to Gollan (1981). Shapiro (1988) made the second-order analysis of the cost and obtained the first term in the expansion of the solutions, under a strengthened second-order condition and the Mangasarian-Fromovitz (MF) hypothesis. Auslender and Cominetti (1990) extended his results replacing (MF) by the directional qualification hypothesis.

The second author was suported in part by the Fund of Promotion of Science at the Technion under the Grant 100-820.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. W. Alt — Lipschitzian perturbations of infinite optimization problems, in “Mathematical programming with data perturbations”, A.V. Fiacco ed., New York, 1983, 7–21.

    Google Scholar 

  2. A. Auslender, R. Cominetti — First and second order sensitivity analysis of nonlinear programs under directional constraint qualification condition. Optimization 21(1990), p. 351–363.

    Google Scholar 

  3. J.F. Bonnans — A review of some recent results in the perturbation theory of nonlinear programs. Proc. Conf. Mat. Api., Oviedo/Gijón, September, 23–27, 1991, to appear.

    Google Scholar 

  4. J.F. Bonnans — Directional derivatives of optimal solutions in smooth nonlinear programming, J. Optim. Theory Appl. 73(1992), to appear.

    Google Scholar 

  5. J.F. Bonnans, A. Shapiro — Sensitivity analysis of parametrized programs under cone constraints, SIAM J. Control Optimiz., to appear.

    Google Scholar 

  6. J.F. Bonnans, A.D. Ioffe, A. Shapiro — Développement de solutions exactes et approchées en programmation non linéaire. Comptes Rendus Acad. Sei. Paris, to appear.

    Google Scholar 

  7. J. Gauvin — A necessary and sufficient regularity condition to have bounded multipliers nonconvex programming. Math. Programming 12(1977), 136–138.

    Article  Google Scholar 

  8. J. Gauvin, R. Janin — Directional behaviour of optimal solutions in nonlinear mathematical programming, Math. Oper. Res. 13(1988), 629–649.

    Article  Google Scholar 

  9. J. Gauvin, R. Janin — Directional lipschitzian optimal solutions and directional derivatives for the optimal value function in nonlinear mathematical programming, in “Analyse non linéaire”, H. Attouch et al. ed., C.R.M. et Gauthier-Villars, Paris, 1989, p. 305–324.

    Google Scholar 

  10. B. Gollan — Perturbation theory for abstract optimization problems, J. Optim. Theory Appl. 35(1981), 417–441.

    Article  Google Scholar 

  11. A.D. Ioffe — On sensitivity analysis of nonlinear programs in Banach spaces: the approach via composite unconstrained optimization, to appear.

    Google Scholar 

  12. S.M. Robinson — Stability theorems for systems of inequalities. Part II: differentiable nonlinear systems, SIAM J. Numer. Anal. 13(1976), 497–513.

    Article  Google Scholar 

  13. A. Shapiro — Sensitivity analysis of nonlinear programs and differentiability properties of metric projections. SIAM J. Control Optim. 26 (1988), p. 628–645.

    Article  Google Scholar 

  14. A. Shapiro — Perturbation analysis of optimization problems in Banach space, Numer. Funct. Anal, and Optim., to appear.

    Google Scholar 

  15. C. Ursescu — Multifunction with convex closed graph, Czech. Mat. J. 25(1975), 438–444.

    Google Scholar 

  16. D.W. Walkup, R. J. B. Wets — A Lipschitz characterization of convex polyhedra. Proc. Amer. Math. Soc. 23(1969), 167–173.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bonnans, J.F., Ioffe, A.D., Shapiro, A. (1992). Expansion of exact and approximate solutions in nonlinear programming. In: Oettli, W., Pallaschke, D. (eds) Advances in Optimization. Lecture Notes in Economics and Mathematical Systems, vol 382. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-51682-5_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-51682-5_8

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-55446-2

  • Online ISBN: 978-3-642-51682-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics