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

DOI10.1007/S11117-012-0214-4zbMATH Open1280.49049OpenAlexW1963616707MaRDI QIDQ395589FDOQ395589

Authors: E. Ernst, M. 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

Recommendations

• scientific article; zbMATH DE number 432981
• Application of the penalty function method to generalized convex programs
• Conjugate duality for generalized convex optimization problems
• Zero duality gap for convex programs: a generalization of the Clark-Duffin theorem
• Duality gap of the conic convex constrained optimization problems in normed spaces
• Dual convergence for penalty algorithms in convex programming
• Zero duality gap for a class of nonconvex optimization problems
• Generalized concavity and duality in continuous programming
• scientific article; zbMATH DE number 3885664
• On Zero Duality Gap and the Farkas Lemma for Conic Programming

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) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20) Programming in abstract spaces (90C48) Duality theory (optimization) (49N15)

Cites Work

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

Cited In (2)

• A conic duality Frank-Wolfe-type theorem via exact penalization in quadratic optimization
• Zero duality gap for convex programs: a generalization of the Clark-Duffin theorem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q395589)