[19] Simon Lacoste-Julien and Martin Jaggi. On the global linear convergence of frank-wolfe optimization variants. Advances in neural information processing systems, 28, 2015.
[20] Yin Tat Lee and Aaron Sidford. Path finding methods for linear programming: Solving linear programs in o (vrank) iterations and faster algorithms for maximum flow. In 2014 IEEE 55th Annual Symposium on Foundations of Computer Science, pages 424-433. IEEE, 2014.
[21] Yin Tat Lee and Aaron Sidford. Efficient inverse maintenance and faster algorithms for linear programming. In 2015 IEEE 56th Annual Symposium on Foundations of Computer Science, pages 230-249. IEEE, 2015.
[22] Yin Tat Lee and Aaron Sidford. Solving linear programs with sqrt (rank) linear system solves. arXiv preprint arXiv:1910.08033, 2019.
[23] Kfir Levy and Andreas Krause. Projection free online learning over smooth sets. In The 22nd International Conference on Artificial Intelligence and Statistics, pages 1458-1466. PMLR, 2019.
[24] Ning Liu and Benjamin Grimmer. Gauges and accelerated optimization over smooth and/or strongly convex sets. arXiv preprint arXiv:2303.05037, 2023.
[25] László Lovász and Santosh Vempala. Simulated annealing in convex bodies and an o*(n4) volume algorithm. Journal of Computer and System Sciences, 72(2):392-417, 2006.
[26] Zhou Lu, Nataly Brukhim, Paula Gradu, and Elad Hazan. Projection-free adaptive regret with membership oracles. In International Conference on Algorithmic Learning Theory, pages 1055-1073. PMLR, 2023.
[27] Haipeng Luo, Chen-Yu Wei, and Kai Zheng. Efficient online portfolio with logarithmic regret. Advances in neural information processing systems, 31, 2018.
[28] Zakaria Mhammedi. Efficient projection-free online convex optimization with membership oracle. In Conference on Learning Theory, pages 5314-5390. PMLR, 2022.
[29] Zakaria Mhammedi. Exploiting the curvature of feasible sets for faster projection-free online learning. arXiv preprint arXiv:2205.11470, 2022.
[30] Zakaria Mhammedi and Khashayar Gatmiry. Quasi-newton steps for efficient online exp-concave optimization. arXiv preprint arXiv:2211.01357, 2022.
[31] Zakaria Mhammedi and Alexander Rakhlin. Damped online newton step for portfolio selection. In Conference on Learning Theory, 2-5 July 2022, London, UK, volume 178, pages 5561-5595. PMLR, 2022.
[32] Zakaria Mhammedi and Alexander Rakhlin. Damped online newton step for portfolio selection. In Conference on Learning Theory, pages 5561-5595. PMLR, 2022.
[33] Yuri Nesterov et al. Lectures on convex optimization, volume 137. Springer, 2018.
[34] Laurent Orseau, Tor Lattimore, and Shane Legg. Soft-bayes: Prod for mixtures of experts with log-loss. In International Conference on Algorithmic Learning Theory, pages 372-399. PMLR, 2017.
[35] Fabian Pedregosa, Geoffrey Negiar, Armin Askari, and Martin Jaggi. Linearly convergent frank-wolfe with backtracking line-search. In International conference on artificial intelligence and statistics, pages 1-10. PMLR, 2020.
[36] Alexander Rakhlin and Karthik Sridharan. Sequential probability assignment with binary alphabets and large classes of experts. arXiv preprint arXiv:1501.07340, 2015.
[37] Shai Shalev-Shwartz et al. Online learning and online convex optimization. Foundations and trends in Machine Learning, 4(2):107-194, 2011.
[38] Tomasz Tkocz. Asymptotic convex geometry lecture notes. 2018.