A short elementary proof of the Lagrange multiplier theorem

DOI10.1007/s11590-011-0349-4zbMath1259.90129OpenAlexW1989957789MaRDI QIDQ1926606

Stephen E. Wright, Alexey A. Tret'yakov, Olga A. Brezhneva

Publication date: 28 December 2012

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-011-0349-4

zbMATH Keywords

first-order necessary conditionsnonlinear programmingLagrange multiplier theorem

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Related Items (2)

New perspective on some classical results in analysis and optimization ⋮ A new proof of the Lagrange multiplier rule

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An elementary proof of the Fritz-John and Karush-Kuhn-Tucker conditions in nonlinear programming
• A simple and elementary proof of the Karush-Kuhn-Tucker theorem for inequality-constrained optimization
• A constructive proof of the Kuhn-Tucker multiplier rule
• Lagrange Multipliers and Optimality
• Optimization and nonsmooth analysis
• Modern Multiplier Rules
• The Lagrange Multiplier Rule

This page was built for publication: A short elementary proof of the Lagrange multiplier theorem