Skip to main content

Lagrange Multipliers with Optimal Sensitivity Properties in Constrained Optimization

  • Chapter
Book cover Large-Scale Nonlinear Optimization

Part of the book series: Nonconvex Optimization and Its Applications ((NOIA,volume 83))

  • 2631 Accesses

Summary

We consider optimization problems with inequality and abstract set constraints, and we derive sensitivity properties of Lagrange multipliers under very weak conditions. In particular, we do not assume uniqueness of a Lagrange multiplier or continuity of the perturbation function. We show that the Lagrange multiplier of minimum norm defines the optimal rate of improvement of the cost per unit constraint violation.

Research supported by NSF Grant ECS-0218328.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover 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.

References

  1. Bazaraa, M. S., Sherali, H. D., and Shetty, C. M., Nonlinear Programming Theory and Algorithms, (2nd Ed.), Wiley, N. Y (1993).

    Google Scholar 

  2. Bertsekas, D. P., with Nedić, A., and Ozdaglar, A. E., Convex Analysis and Optimization, Athena Scientific, Belmont, MA (2003).

    Google Scholar 

  3. Bertsekas, D. P., Ozdaglar, A. E., and Tseng, P., Enhanced Fritz John Conditions for Convex Programming, Lab. for Information and Decision Systems Report 2631, MIT (2004). To appear in SIAM J. on Optimization.

    Google Scholar 

  4. Bertsekas, D. P., and Ozdaglar, A. E. Pseudonormality and a Lagrange Multiplier Theory for Constrained Optimization, J. Opt. Theory Appl., Vol. 114, pp. 287–343 (2002)

    Article  MathSciNet  Google Scholar 

  5. Bertsekas, D. P., Nonlinear Programming: 2nd Edition, Athena Scientific, Belmont, MA (1999).

    Google Scholar 

  6. Bonnans, J. F., and Shapiro, A., Perturbation Analysis of Optimization Problems, Springer-Verlag, N. Y. (2000).

    Google Scholar 

  7. Rockafellar, R. T., and Wets, R. J.-B., Variational Analysis, Springer-Verlag, Berlin (1998).

    Google Scholar 

  8. Rockafellar, R. T., Lagrange Multipliers and Optimality, SIAM Review, Vol. 35, pp. 183–238 (1993).

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer Science+Business Media, Inc.

About this chapter

Cite this chapter

Bertsekas, D.P. (2006). Lagrange Multipliers with Optimal Sensitivity Properties in Constrained Optimization. In: Di Pillo, G., Roma, M. (eds) Large-Scale Nonlinear Optimization. Nonconvex Optimization and Its Applications, vol 83. Springer, Boston, MA. https://doi.org/10.1007/0-387-30065-1_2

Download citation

Publish with us

Policies and ethics