APA (7th ed.) Citation

Blanchard, M., Zhang, J., & Jaillet, P. (2025). Quadratic Memory Is Necessary for Optimal Query Complexity in Convex Optimization: Center of Mass Is Pareto Optimal. Mathematics of Operations Research (INFORMS), 50(4), 2941. https://doi.org/10.1287/moor.2023.0208

Chicago Style (17th ed.) Citation

Blanchard, Moïse, Junhui Zhang, and Patrick Jaillet. "Quadratic Memory Is Necessary for Optimal Query Complexity in Convex Optimization: Center of Mass Is Pareto Optimal." Mathematics of Operations Research (INFORMS) 50, no. 4 (2025): 2941. https://doi.org/10.1287/moor.2023.0208.

MLA (9th ed.) Citation

Blanchard, Moïse, et al. "Quadratic Memory Is Necessary for Optimal Query Complexity in Convex Optimization: Center of Mass Is Pareto Optimal." Mathematics of Operations Research (INFORMS), vol. 50, no. 4, 2025, p. 2941, https://doi.org/10.1287/moor.2023.0208.