Duality gap of the conic convex constrained optimization problems in normed spaces

DOI10.1007/s10107-008-0207-zzbMath1172.90012OpenAlexW1985754192MaRDI QIDQ1013974

Wen Song, Liqun Ban

Publication date: 24 April 2009

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-008-0207-z

zbMATH Keywords

normed spaceszero duality gap\({\mathcal D}(y)\) property\(S\)-convex mapping

Mathematics Subject Classification ID

Convex programming (90C25) Nonlinear programming (90C30) Sensitivity, stability, parametric optimization (90C31)

Related Items

Stable zero duality gaps in convex programming: complete dual characterisations with applications to semidefinite programs ⋮ Zero duality gap for convex programs: a generalization of the Clark-Duffin theorem ⋮ Generalized Courant-Beltrami penalty functions and zero duality gap for conic convex programs ⋮ Regularity conditions via generalized interiority notions in convex optimization: New achievements and their relation to some classical statements ⋮ On approximate solutions and saddle point theorems for robust convex optimization ⋮ Extended Farkas's lemmas and strong dualities for conic programming involving composite functions ⋮ Constraint qualifications for optimality conditions and total Lagrange dualities in convex infinite programming ⋮ Optimality conditions and total dualities for conic programming involving composite function

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some convex programs without a duality gap
• A minimax theorem for vector-valued functions
• Zero duality gaps in infinite-dimensional programming
• Optimization and stability results through cone lower semicontinuity
• Convex analysis and nonlinear optimization. Theory and examples
• Existence of optimal solutions and duality results under weak conditions
• A constraint qualification for convex programming
• Duality gap in convex programming
• On strong and total Lagrange duality for convex optimization problems
• The strong conical hull intersection property for convex programming
• An alternative formulation for a new closed cone constraint qualification
• Semidefinite Programming
• Convex Analysis