Kill a Bird with Two Stones: Closing the Convergence Gaps in Non-Strongly Convex Optimization by Directly Accelerated SVRG with Double Compensation and Snapshots.
Yuanyuan LiuFanhua ShangWeixin AnHongying LiuZhouchen LinPublished in: ICML (2022)
Keyphrases
- convex optimization
- operator splitting
- interior point methods
- low rank
- total variation
- alternating direction
- primal dual
- augmented lagrangian
- convex relaxation
- convex optimization problems
- semidefinite program
- convex constraints
- convergence rate
- convex formulation
- norm minimization
- learning algorithm
- higher order
- image restoration
- high quality
- low rank matrix