Duality gap in convex programming

DOI10.1007/s10107-003-0461-zzbMath1084.90032OpenAlexW2083782649MaRDI QIDQ1881045

Yanyan Li

Publication date: 27 September 2004

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

Full work available at URL: https://doi.org/10.1007/s10107-003-0461-z

zbMATH Keywords

duality gapconvex programmingproperty D

Mathematics Subject Classification ID

Convex programming (90C25) Optimality conditions and duality in mathematical programming (90C46)

Related Items (8)

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 ⋮ Primal or dual strong-duality in nonconvex optimization and a class of quasiconvex problems having zero duality gap ⋮ On epsilon-stability in optimization ⋮ Some convex programs without a duality gap ⋮ Gap continuity of multimaps ⋮ Duality gap of the conic convex constrained optimization problems in normed spaces ⋮ On the lower semicontinuity of the value function and existence of solutions in quasiconvex optimization

This page was built for publication: Duality gap in convex programming