Efficient Convex Optimization Requires Superlinear Memory (Extended Abstract).
Annie MarsdenVatsal SharanAaron SidfordGregory ValiantPublished in: IJCAI (2023)
Keyphrases
- extended abstract
- convex optimization
- interior point methods
- total variation
- convex programming
- low rank
- convex relaxation
- convex optimization problems
- norm minimization
- computationally intensive
- primal dual
- object recognition
- higher order
- semi definite programming
- convex constraints
- alternating direction method of multipliers