Continuous convex sets and zero duality gap for convex programs

Published: 2011/12/15

Convex Optimization constrainedoptimization, continuous convex sets, convexprograms, inner aperture directions, recessionanalysis Short URL: https://optimization-online.org/?p=11840

This article uses classical notions of convex analysis over euclidean spaces, like Gale & Klee’s boundary rays and asymptotes of a convex set, or the inner aperture directions defined by Larman and Brøndsted for the same class of sets, to provide a new zero duality gap criterion for ordinary convex programs. On this ground, we are able to characterize objective functions and respectively feasible sets for which the duality gap is always zero, re- gardless of the value of the constraints and respectively of the objective function.

Continuous convex sets and zero duality gap for convex programs

Citation

Article