Quadratic Memory Is Necessary for Optimal Query Complexity in Convex Optimization: Center of Mass Is Pareto Optimal.
Saved in:
| Title: | Quadratic Memory Is Necessary for Optimal Query Complexity in Convex Optimization: Center of Mass Is Pareto Optimal. |
|---|---|
| Authors: | Blanchard, Moïse1, moiseb@mit.edu, Zhang, Junhui1, junhuiz@mit.edu, Jaillet, Patrick1, jaillet@mit.edu |
| Source: | Mathematics of Operations Research (INFORMS); Nov2025, Vol. 50 Issue 4, p2941-2971, 31p |
| Database: | Applied Science & Technology Source |
| ISSN: | 0364765X |
|---|---|
| DOI: | 10.1287/moor.2023.0208 |
