Lower Bounds for Parallel and Randomized Convex Optimization.
Jelena DiakonikolasCristóbal GuzmánPublished in: J. Mach. Learn. Res. (2020)
Keyphrases
- convex optimization
- lower bound
- upper bound
- interior point methods
- low rank
- objective function
- primal dual
- convex programming
- total variation
- convex relaxation
- semi supervised
- optimal solution
- worst case
- np hard
- convex optimization problems
- convex constraints
- convex formulation
- image segmentation
- norm minimization
- alternating direction method of multipliers
- operator splitting