Zero Duality Gap for Convex Programs: A Generalization of the Clark-Duffin Theorem.

Emil Ernst Michel Volle

Published in: J. Optim. Theory Appl. (2013)

Keyphrases

convex programs
duality gap
primal dual
convex functions
augmented lagrangian
convex programming
linear programming
optimality conditions
set covering problem
natural images
linear program
special case
problems in computer vision
linear programming problems
inequality constraints