[1] Kurt M Anstreicher. "On Vaidya's volumetric cutting plane method for convex programming". In: Mathematics of Operations Research 22.1 (1997), pp. 63-89.
[2] Kurt M Anstreicher. "Towards a practical volumetric cutting plane method for convex programming". In: SIAM Journal on Optimization 9.1 (1998), pp. 190-206.
[3] Aharon Ben-Tal and Arkadi Nemirovski. "Non-euclidean restricted memory level method for large-scale convex optimization". In: Mathematical Programming 102.3 (Jan. 2005), pp. 407-456.
[4] Dimitris Bertsimas and Santosh Vempala. "Solving convex programs by random walks". In: Journal of the ACM (JACM) 51.4 (2004), pp. 540-556.
[5] Moise Blanchard, Junhui Zhang, and Patrick Jaillet. "Quadratic Memory is Necessary for Optimal Query Complexity in Convex Optimization: Center-of-Mass is Pareto-Optimal". In: arXiv preprint arXiv:2302.04963 (2023).
[6] Mark Braverman et al. "Communication Lower Bounds for Statistical Estimation Problems via a Distributed Data Processing Inequality". In: Proceedings of the Forty-Eighth Annual ACM Symposium on Theory of Computing. STOC '16. Cambridge, MA, USA: Association for Computing Machinery, 2016, pp. 1011-1020.
[7] C. G. Broyden. "The Convergence of a Class of Double-rank Minimization Algorithms 1. General Considerations". In: IMA Journal of Applied Mathematics 6.1 (Mar. 1970), pp. 76-90.
[8] Sébastien Bubeck. “Convex Optimization: Algorithms and Complexity”. In: Foundations and Trends® in Machine Learning 8.3-4 (2015), pp. 231–357.
[9] Sébastien Bubeck, Yin Tat Lee, and Mohit Singh. A geometric alternative to Nesterov's accelerated gradient descent. 2015.
[10] Sébastien Bubeck and Dan Mikulincer. "How to trap a gradient flow". In: Conference on Learning Theory. PMLR. 2020, pp. 940-960.
[11] Xi Chen and Binghui Peng. "Memory-Query Tradeoffs for Randomized Convex Optimization". In: arXiv preprint arXiv:2306.12534 (2023).
[12] Alexandre d'Aspremont, Damien Scieur, and Adrien Taylor. "Acceleration Methods". In: Foundations and Trends® in Optimization 5.1-2 (2021), pp. 1-245.
[13] Yuval Dagan, Gil Kur, and Ohad Shamir. "Space lower bounds for linear prediction in the streaming model". In: Proceedings of the Thirty-Second Conference on Learning Theory. Ed. by Alina Beygelzimer and Daniel Hsu. Vol. 99. Proceedings of Machine Learning Research. PMLR, 25–28 Jun 2019, pp. 929–954.
[14] Yuval Dagan and Ohad Shamir. "Detecting Correlations with Little Memory and Communication". In: Proceedings of the 31st Conference On Learning Theory. Ed. by Sébastien Bubeck, Vianney Perchet, and Philippe Rigollet. Vol. 75. Proceedings of Machine Learning Research. PMLR, June 2018, pp. 1145-1198.
[15] James Demmel, Ioana Dumitriu, and Olga Holtz. "Fast linear algebra is stable". In: Numerische Mathematik 108.1 (2007), pp. 59-91.
[16] Kim Donghwan and Jeffrey Fessler. "Optimized first-order methods for smooth convex minimization". In: Mathematical Programming 159 (June 2014).
[17] Yoel Drori and Marc Teboulle. "Performance of first-order methods for smooth convex minimization: a novel approach". In: Mathematical Programming 145.1 (June 2014), pp. 451-482.
[18] Dmitriy Drusvyatskiy, Maryam Fazel, and Scott Roy. "An Optimal First Order Method Based on Optimal Quadratic Averaging". In: SIAM Journal on Optimization 28.1 (2018), pp. 251-271.
[19] Uriel Feige and Gideon Schechtman. "On the optimality of the random hyperplane rounding technique for MAX CUT". In: Random Structures & Algorithms 20.3 (2002), pp. 403-440.