Lower Bounds for Parallel and Randomized Convex Optimization.
Jelena DiakonikolasCristóbal GuzmánPublished in: COLT (2019)
Keyphrases
- convex optimization
- lower bound
- upper bound
- interior point methods
- low rank
- primal dual
- total variation
- convex programming
- objective function
- norm minimization
- convex optimization problems
- convex relaxation
- convex formulation
- semidefinite program
- worst case
- np hard
- operator splitting
- semi supervised
- pairwise
- optimal solution
- computer vision
- semi definite programming
- low rank matrix