Efficient convex optimization requires superlinear memory

DOI10.1145/3689208MaRDI QIDQ6993537zbMATH OpenFDO

Authors Annie Marsden, Vatsal Sharan, Aaron Sidford, Gregory Valiant

Publication date 25 April 2025

Published in Journal of the ACM (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

zbMATH Keywords

first-order methodsconvex optimizationmemory lower boundscutting planes methods

Mathematics Subject Classification ID

Convex programming (90C25) Analysis of algorithms and problem complexity (68Q25)

This page was built for publication: Efficient convex optimization requires superlinear memory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6993537)