A primal dual modified subgradient algorithm with sharp Lagrangian.
Regina Sandra BurachikAlfredo N. IusemJefferson G. MeloPublished in: J. Glob. Optim. (2010)
Keyphrases
- primal dual
- convex optimization
- optimal solution
- convergence rate
- linear programming problems
- linear programming
- computational complexity
- dual formulation
- np hard
- lower bound
- objective function
- convex hull
- linear program
- markov random field
- worst case
- motion estimation
- approximation algorithms
- dynamic programming
- semidefinite programming
- simplex method
- special case
- simplex algorithm
- saddle point
- multiresolution
- duality gap
- algorithm for linear programming