Double Smoothing Technique for Large-Scale Linearly Constrained Convex Optimization.
Olivier DevolderFrançois GlineurYurii E. NesterovPublished in: SIAM J. Optim. (2012)
Keyphrases
- convex optimization
- linearly constrained
- linear constraints
- interior point methods
- variational inequalities
- primal dual
- low rank
- convex sets
- convex relaxation
- norm minimization
- total variation
- convex optimization problems
- face recognition
- semidefinite program
- evolutionary algorithm
- alternating direction method of multipliers
- feature space
- multiscale