On Lower and Upper Bounds for Smooth and Strongly Convex Optimization Problems.
Yossi ArjevaniShai Shalev-ShwartzOhad ShamirPublished in: CoRR (2015)
Keyphrases
- lower and upper bounds
- convex optimization problems
- convex optimization
- lower bound
- upper bound
- optimization problems
- structured sparsity
- upper and lower bounds
- primal dual
- learning problems
- lagrangian relaxation
- interior point methods
- objective function
- worst case
- linear programming
- image segmentation
- e learning
- dual variables
- data sets
- total variation
- np hard
- support vector
- optimal solution
- multiscale
- feature selection