Memory-Efficient Structured Convex Optimization via Extreme Point Sampling
2021
Memory is a key computational bottleneck when solving large-scale convex optimization problems, such as semidefinite programs (SDPs). In this paper, we focus on the regime in which storing an $n\ti...
Keywords:
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
36
References
1
Citations
NaN
KQI