1. D. P. Bertsekas, Nonlinear
Programming (Athena Sci., Belmont, 2016).
2. R. T. Rockafellar, “Problem decomposition in block-separable convex
optimization: Ideas old and new,” J. Nonlinear Convex Anal. 19 (9), 1459–1474 (2018).
3. J.-P. Aubin, L’analyse non linéaire et
ses motivations économiques (Paris–New York–Barcelone, Masson, 1984;
Mir, Moscow, 1988).
4. D. Jalota, K. Gopalakrishnan, N. Azizan, R. Johari, and M. Pavone, “Online
learning for traffic routing under unknown preferences,” Proc. 26th
Int. Conf. Artif. Intell. Stat. (2023), 206,
3210–3229.
5. A. Beck, A. Nedić, A. Ozdaglar, and M. Teboulle, “An
$$
O(1/k)
$$ gradient method for network resource allocation problems,” IEEE Trans.
Control. Network Syst. 1 (1), 64–73 (2014).
https://doi.org/10.1109/TCNS.2014.2309751