On Lower and Upper Bounds in Smooth and Strongly Convex Optimization.
Yossi ArjevaniShai Shalev-ShwartzOhad ShamirPublished in: J. Mach. Learn. Res. (2016)
Keyphrases
- convex optimization
- lower and upper bounds
- lower bound
- upper bound
- interior point methods
- low rank
- primal dual
- total variation
- convex optimization problems
- lagrangian relaxation
- norm minimization
- convex relaxation
- convex programming
- semidefinite program
- valid inequalities
- augmented lagrangian
- learning algorithm
- itemsets
- image segmentation
- dual formulation