Quadratic Memory Is Necessary for Optimal Query Complexity in Convex Optimization: Center of Mass Is Pareto Optimal.

Saved in:

Bibliographic Details
Title:	Quadratic Memory Is Necessary for Optimal Query Complexity in Convex Optimization: Center of Mass Is Pareto Optimal.
Authors:	Blanchard, Moïse¹ (AUTHOR) moiseb@mit.edu, Zhang, Junhui¹ (AUTHOR) junhuiz@mit.edu, Jaillet, Patrick¹ (AUTHOR) jaillet@mit.edu
Source:	Mathematics of Operations Research (INFORMS). Nov2025, Vol. 50 Issue 4, p2941-2971. 31p.
Database:	Business Source Ultimate

Description
ISSN:	0364765X
DOI:	10.1287/moor.2023.0208