Duality Gap, Computational Complexity and NP Completeness: A Survey
Prabhu ManyemPublished in: CoRR (2010)
Keyphrases
- duality gap
- computational complexity
- primal dual
- augmented lagrangian
- exact penalty
- set covering problem
- inequality constraints
- special case
- np complete
- convex programming
- optimality conditions
- np hard
- optimal solution
- linear programming
- motion estimation
- approximation algorithms
- image denoising
- interior point methods
- total variation
- worst case
- evolutionary algorithm
- denoising