BLANCHARD, Moïse, ZHANG, Junhui und JAILLET, Patrick, 2025. Quadratic Memory Is Necessary for Optimal Query Complexity in Convex Optimization: Center of Mass Is Pareto Optimal. Mathematics of Operations Research. 1 November 2025. Vol. 50, no. 4, p. 2941-2971. DOI 10.1287/moor.2023.0208.
Elsevier - Harvard (with titles)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 50, 2941-2971. https://doi.org/10.1287/moor.2023.0208
American Psychological Association 7th editionBlanchard, 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, 50(4), 2941-2971. https://doi.org/10.1287/moor.2023.0208
Springer - Basic (author-date)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 50:2941-2971. https://doi.org/10.1287/moor.2023.0208
Juristische Zitierweise (Stüber) (Deutsch)Blanchard, Moïse/ Zhang, Junhui/ Jaillet, Patrick, Quadratic Memory Is Necessary for Optimal Query Complexity in Convex Optimization: Center of Mass Is Pareto Optimal., Mathematics of Operations Research 2025, 2941-2971.