Generalized Courant-Beltrami penalty functions and zero duality gap for conic convex programs

DOI10.1007/S11117-012-0214-4zbMath1280.49049OpenAlexW1963616707MaRDI QIDQ395589

Emil Ernst, Michel Volle

Publication date: 29 January 2014

Published in: Positivity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11117-012-0214-4

zbMATH Keywords

zero duality gapconic convex programCourant-Beltrami penalty function

Mathematics Subject Classification ID

Convex programming (90C25) Optimality conditions and duality in mathematical programming (90C46) Programming in abstract spaces (90C48) Duality theory (optimization) (49N15) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20)

Related Items (1)

Zero duality gap for convex programs: a generalization of the Clark-Duffin theorem

Cites Work

• Unnamed Item
• New dual constraint qualifications characterizing zero duality gaps of convex programs and semidefinite programs
• Slice-continuous sets in reflexive Banach spaces: convex constrained optimization and strict convex separation
• Convex analysis and nonlinear optimization. Theory and examples.
• Slice-continuous sets in reflexive Banach spaces: some complements
• Duality gap of the conic convex constrained optimization problems in normed spaces
• Scalar convergence of convex sets
• Duality gap in convex programming
• Convex functions with continuous epigraph or continuous level sets
• Convex programs having some linear constraints
• Continuous Convex Sets.

This page was built for publication: Generalized Courant-Beltrami penalty functions and zero duality gap for conic convex programs