A fast dual proximal-gradient method for separable convex optimization with linear coupled constraints.
Jueyou LiGuo ChenZhaoyang DongZhiyou WuPublished in: Comput. Optim. Appl. (2016)
Keyphrases
- convex optimization
- gradient method
- convex formulation
- primal dual
- convergence rate
- dual formulation
- linear constraints
- operator splitting
- interior point methods
- total variation
- optimization methods
- convex programming
- convex optimization problems
- step size
- convex relaxation
- multiscale
- image classification
- objective function
- negative matrix factorization
- constrained optimization
- training set
- feature selection