Generalized Courant-Beltrami penalty functions and zero duality gap for conic convex programs
From MaRDI portal
Publication:395589
DOI10.1007/s11117-012-0214-4zbMath1280.49049MaRDI QIDQ395589
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
90C25: Convex programming
90C46: Optimality conditions and duality in mathematical programming
90C48: Programming in abstract spaces
49N15: Duality theory (optimization)
52A20: Convex sets in (n) dimensions (including convex hypersurfaces)
Related Items
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.