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