Sufficient Conditions for Kuhn–Tucker Vectors in Convex Programming

DOI10.1137/0317048zbMath0432.90084OpenAlexW2071144844MaRDI QIDQ3870696

P. Levine, Jean-Charles Pomerol

Publication date: 1979

Published in: SIAM Journal on Control and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0317048

zbMATH Keywords

Lagrange multiplierdualitysufficient conditionscontinuous linear programmingdual programlocally convex vector spacesSlater type conditionsconvex programs in Banach spacesexistence of a Kuhn-Tucker vector

Mathematics Subject Classification ID

Convex programming (90C25) Normed linear spaces and Banach spaces; Banach lattices (46B99) Programming in abstract spaces (90C48) Optimality conditions for problems in abstract spaces (49K27)

Related Items (5)

Convex analysis can be helpful for the asymptotic analysis of monotone operators ⋮ Unnamed Item ⋮ The boundedness of the Lagrange multipliers set and duality in mathematical programming ⋮ A corrected proof of a result of Grinold ⋮ Preservation of persistence and stability under intersections and operations. II: Stability

This page was built for publication: Sufficient Conditions for Kuhn–Tucker Vectors in Convex Programming