Fast Primal-Dual Gradient Method for Strongly Convex Minimization Problems with Linear Constraints.
Alexey ChernovPavel E. DvurechenskyAlexander V. GasnikovPublished in: DOOR (2016)
Keyphrases
- minimization problems
- primal dual
- linear constraints
- interior point
- convergence rate
- convex optimization
- total variation
- convex sets
- convex constraints
- low rank
- interior point methods
- linear programming
- linear programming problems
- quadratic program
- variational inequalities
- linear program
- semidefinite programming
- approximation algorithms
- step size
- semidefinite
- image denoising
- denoising
- convex relaxation
- image processing
- natural images
- kernel matrix
- valid inequalities
- pairwise