Kuhn–Tucker Conditions for a Convex Programming Problem in Banach Spaces Partially Ordered by Cone with Empty Interior

DOI10.1080/01630563.2012.657739zbMath1246.90115arXiv1102.2532OpenAlexW2161899403MaRDI QIDQ2895670

Feyzullah Ahmetoğlu

Publication date: 4 July 2012

Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1102.2532

zbMATH Keywords

convex programmingsaddle pointKuhn-Tucker conditionstrong simultaneity condition

Mathematics Subject Classification ID

Convex programming (90C25) Numerical optimization and variational techniques (65K10)

Related Items (1)

Logarithmic-Barrier Decomposition Interior-Point Methods for Stochastic Linear Optimization in a Hilbert Space

Cites Work

• Second-order conditions and constraint qualifications in stability and sensitivity analysis of solutions to optimization problems in Hilbert spaces
• Algorithms for infinite quadratic programming in \(L_p\) spaces
• Necessary and sufficient conditions for stable conjugate duality
• On the cones of tangents with applications to mathematical programming
• A new geometric condition for Fenchel's duality in infinite dimensional spaces
• Linear programming interpretations of Mather's variational principle

This page was built for publication: Kuhn–Tucker Conditions for a Convex Programming Problem in Banach Spaces Partially Ordered by Cone with Empty Interior