Sufficient conditions for the existence of multipliers and Lagrangian duality in abstract optimization problems
From MaRDI portal
Publication:1335123
DOI10.1007/BF02191781zbMath0824.49032MaRDI QIDQ1335123
Publication date: 27 September 1994
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Nonlinear programming (90C30) Programming in abstract spaces (90C48) Duality theory (optimization) (49N15)
Related Items (4)
Lagrangian multipliers, saddle points, and duality in vector optimization of set-valued maps ⋮ Strong Lagrange duality and the maximum principle for nonlinear discrete time optimal control problems ⋮ A General Lagrange Multipliers Theorem and Related Questions ⋮ Theorems of the alternative and optimality conditions for convexlike and general convexlike programming
Cites Work
- Unnamed Item
- Unnamed Item
- Abstract Kuhn-Tucker theorems
- Theorems of the alternative for multifunctions with applications to optimization: General results
- Perfect duality for convexlike programs
- Multiplier rules and the separation of convex sets
- Theorems of the alternative and optimality conditions
- The Fritz John necessary optimality conditions in the presence of equality and inequality constraints
- Optimization and nonsmooth analysis
- Convexlike alternative theorems and mathematical programming
- Regularity and Stability for Convex Multivalued Functions
- Convex Analysis
This page was built for publication: Sufficient conditions for the existence of multipliers and Lagrangian duality in abstract optimization problems