Lower Bounds on the Oracle Complexity of Nonsmooth Convex Optimization via Information Theory.
Gábor BraunCristobal GuzmanSebastian PokuttaPublished in: CoRR (2014)
Keyphrases
- convex optimization
- information theory
- lower bound
- information theoretic
- worst case
- interior point methods
- upper bound
- low rank
- total variation
- conditional entropy
- primal dual
- norm minimization
- convex optimization problems
- augmented lagrangian
- convex relaxation
- objective function
- computational complexity
- mutual information
- optimal solution
- operator splitting
- regularization term
- image denoising
- image restoration
- image processing
- alternating direction method of multipliers