Smooth Primal-Dual Coordinate Descent Algorithms for Nonsmooth Convex Optimization.
Ahmet AlacaogluQuoc Tran-DinhOlivier FercoqVolkan CevherPublished in: NIPS (2017)
Keyphrases
- convex optimization
- primal dual
- convex optimization problems
- interior point
- interior point methods
- variational inequalities
- convergence rate
- linear program
- linear programming
- convex programming
- convex functions
- linear programming problems
- approximation algorithms
- dual formulation
- convex sets
- semidefinite programming
- image processing
- worst case
- computationally intensive
- total variation
- learning problems
- natural images
- quadratic program
- object recognition
- computational complexity
- learning algorithm
- convex constraints
- alternating direction method of multipliers