On Lower Complexity Bounds for Large-Scale Smooth Convex Optimization.

Cristobal Guzman Arkadi Nemirovski

Published in: CoRR (2013)

Keyphrases

convex optimization
lower complexity
low complexity
total variation
data complexity
interior point methods
computational complexity
primal dual
convex optimization problems
lower bound
motion estimation
machine learning
optimal solution
object recognition