Login / Signup
On lower complexity bounds for large-scale smooth convex optimization.
Cristobal Guzman
Arkadi Nemirovski
Published in:
J. Complex. (2015)
Keyphrases
</>
convex optimization
lower complexity
low complexity
data complexity
interior point methods
lower bound
convex optimization problems
primal dual
total variation
norm minimization
high quality
computational complexity
operator splitting
query evaluation
degraded images
objective function
computer vision