A simple and elementary proof of the Karush-Kuhn-Tucker theorem for inequality-constrained optimization
From MaRDI portal
Publication:1001320
DOI10.1007/s11590-008-0096-3zbMath1154.90587OpenAlexW2070850346MaRDI QIDQ1001320
Stephen E. Wright, Alexey A. Tret'yakov, Olga A. Brezhneva
Publication date: 17 February 2009
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-008-0096-3
Related Items
A short elementary proof of the Lagrange multiplier theorem, Fritz John necessary optimality conditions of the alternative-type, Duality and Convex Programming, An elementary proof of the Karush–Kuhn–Tucker theorem in normed linear spaces for problems with a finite number of inequality constraints
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An elementary proof of the Fritz-John and Karush-Kuhn-Tucker conditions in nonlinear programming
- A constructive proof of the Kuhn-Tucker multiplier rule
- Lagrange Multipliers and Optimality
- On the Development of Optimization Theory
- Modern Multiplier Rules
- The Lagrange Multiplier Rule
