On Zero Duality Gap and the Farkas Lemma for Conic Programming.
Constantin ZalinescuPublished in: Math. Oper. Res. (2008)
Keyphrases
- conic programming
- duality gap
- primal dual
- augmented lagrangian
- exact penalty
- set covering problem
- convex programming
- optimality conditions
- inequality constraints
- convex optimization
- dual formulation
- optimal solution
- linear programming
- constrained optimization problems
- linear programming problems
- constrained optimization
- set covering
- approximation algorithms
- branch and bound algorithm
- convergence rate
- linear program
- image denoising
- particle swarm optimization
- search algorithm