Optimally linearizing the alternating direction method of multipliers for convex programming.
Bingsheng HeFeng MaXiaoming YuanPublished in: Comput. Optim. Appl. (2020)
Keyphrases
- convex programming
- convex optimization
- alternating direction method of multipliers
- low rank
- interior point methods
- total variation
- primal dual
- convex relaxation
- approximation algorithms
- image denoising
- convex sets
- multiresolution
- graph cuts
- convex functions
- text classification
- denoising
- dynamic programming
- matrix completion
- active learning