Lower Bounds on the Oracle Complexity of Nonsmooth Convex Optimization via Information Theory.
Gábor BraunCristobal GuzmanSebastian PokuttaPublished in: IEEE Trans. Inf. Theory (2017)
Keyphrases
- convex optimization
- information theory
- lower bound
- information theoretic
- worst case
- interior point methods
- upper bound
- low rank
- convex relaxation
- primal dual
- total variation
- conditional entropy
- norm minimization
- augmented lagrangian
- convex sets
- operator splitting
- high quality
- objective function
- image processing
- learning algorithm