Computational complexity of Inexact Proximal Point Algorithm for Convex Optimization under Holderian Growth.
Andrei PatrascuPaul IroftiPublished in: CoRR (2021)
Keyphrases
- convex optimization
- basis pursuit
- computational complexity
- proximal point algorithm
- interior point methods
- low rank
- total variation
- primal dual
- special case
- np hard
- denoising
- convex optimization problems
- norm minimization
- convex relaxation
- convex formulation
- alternating direction method of multipliers
- operator splitting
- natural images
- computer vision
- image segmentation
- semidefinite program
- feature selection