F. Alvarez, J. Bolte, and O. Brahic, Hessian Riemannian gradient flows in convex programming, SIAM Journal on Control and Optimization, vol.43, pp.477-501, 2004.
URL : https://hal.archives-ouvertes.fr/hal-01928141

H. Attouch, J. Bolte, P. Redont, and M. Teboulle, Singular Riemannian barrier methods and gradient-projection dynamical systems for constrained optimization, Optimization, vol.53, pp.435-454, 2004.

H. Attouch, J. Bolte, and B. F. Svaiter, Convergence of descent methods for semialgebraic and tame problems: proximal algorithms, forward-backward splitting and regularized Gauss-Seidel method, Mathematical Programming, vol.137, pp.91-129, 2013.

H. Attouch, X. Goudou, and P. Redont, The heavy ball with friction method, I. The continuous dynamical system: global exploration of the local minima of a real-valued function by asymptotic analysis of a dissipative dynamical system, Communications in Contemporary Mathematics, vol.2, pp.1-34, 2000.

H. Attouch and J. Peypouquet, The rate of convergence of Nesterov's accelerated forwardbackward method is actually faster than 1/k 2, SIAM Journal on Optimization, vol.26, pp.1824-1834, 2016.

H. Attouch and M. Teboulle, Regularized Lotka-Volterra dynamical system as continuous proximal-like method in optimization, Journal of Optimization Theory and Applications, vol.121, pp.541-570, 2004.

A. Auslender, P. J. Silva, and M. Teboulle, Nonmonotone projected gradient methods based on barrier and euclidean distances, Computational Optimization and Applications, vol.38, pp.305-327, 2007.

A. Auslender and M. Teboulle, Interior gradient and proximal methods for convex and conic optimization, SIAM Journal on Optimization, vol.16, pp.697-725, 2006.

A. Beck and M. Teboulle, Mirror descent and nonlinear projected subgradient methods for convex optimization, Operations Research Letters, pp.167-175, 2003.

, A fast iterative shrinkage-thresholding algorithm for linear inverse problems, SIAM Journal on Imaging Sciences, vol.2, pp.183-202, 2009.

M. Bertero, P. Boccacci, G. Desiderà, and G. Vicidomini, Image deblurring with Poisson data: from cells to galaxies, Inverse Problems, vol.25, p.123006, 2009.

D. P. Bertsekas, R. Gallager, and D. Networks, , 1992.

J. Bolte and M. Teboulle, Barrier operators and associated gradient-like dynamical systems for constrained minimization problems, SIAM Journal on Control and Optimization, vol.42, pp.1266-1292, 2003.

I. M. Bomze, Evolution towards the maximum clique, Journal of Global Optimization, vol.10, pp.143-164, 1997.

I. M. Bomze, Global escape strategies for maximizing quadratic forms over a simplex, Journal of Global Optimization, vol.11, pp.325-338, 1997.

I. M. Bomze, Regularity versus degeneracy in dynamics, games, and optimization: A unified approach to different aspects, SIAM Review, vol.44, pp.394-414, 2002.

I. M. Bomze, W. Schachinger, and R. Ullrich, The complexity of simple models-a study of worst and typical hard cases for the standard quadratic optimization problem, Mathematics of Operations Research, vol.43, pp.651-674, 2017.

J. Bonnans and C. Pola, A trust region interior point algorithm for linearly constrained optimization, SIAM Journal on Optimization, vol.7, pp.717-731, 1997.
URL : https://hal.archives-ouvertes.fr/inria-00074725

M. Bravo, D. S. Leslie, and P. Mertikopoulos, Bandit learning in concave N -person games, NIPS '18: Proceedings of the 32nd International Conference on Neural Information Processing Systems, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01891523

S. Bubeck, Convex optimization: Algorithms and complexity, Foundations and Trends in Machine Learning, vol.8, pp.231-358, 2015.

A. Cabot, H. Engler, and S. Gadat, On the long time behavior of second order differential equations with asymptotically small dissipation, Transactions of the American Mathematical Society, vol.361, pp.5983-6017, 2009.

E. Candès and T. Tao, The Dantzig selector: Statistical estimation when p is much larger than n, The Annals of Statistics, vol.35, pp.2313-2351, 2007.

E. J. Candès and T. Tao, Decoding by linear programming, IEEE transactions on information theory, vol.51, pp.4203-4215, 2005.

B. Cox, A. Juditsky, and A. Nemirovski, Dual subgradient algorithms for large-scale nonsmooth learning problems, Mathematical Programming, vol.148, pp.143-180, 2014.
URL : https://hal.archives-ouvertes.fr/hal-00978358

J. J. Duistermaat, On Hessian Riemannian structures, Asian Journal of Mathematics, vol.5, pp.79-91, 2001.

F. Facchinei and J. Pang, Finite-Dimensional Variational Inequalities and Complementarity Problems -Volume I and, Springer Series in Operations Research, vol.II, 2003.

M. Fukushima, A modified Frank-Wolfe algorithm for solving the traffic assignment problem, Transportation Research Part B: Methodological, vol.18, pp.169-177, 1984.

S. Ghadimi and G. Lan, Accelerated gradient methods for nonconvex nonlinear and stochastic programming, Mathematical Programming, vol.156, pp.59-99, 2016.

O. Güler, D. Hertog, C. Roos, T. Terlaky, and T. Tsuchiya, Degeneracy in interior point methods for linear programming: a survey, Annals of Operations Research, vol.46, pp.107-138, 1993.

G. Haeser, H. Liu, and Y. Ye, Optimality condition and complexity analysis for linearlyconstrained optimization without differentiability on the boundary, Mathematical Programming, online, 2018.

J. Hofbauer and K. Sigmund, Evolutionary game dynamics, Bulletin of the American Mathematical Society, vol.40, pp.479-519, 2003.

J. Lagarias, R. Vanderbei, and I. I. , Dikin's convergence result for the affine scaling algorithm, Contemporary Math, vol.114, pp.109-119, 1990.

J. M. Lee, Introduction to Smooth Manifolds, Graduate Texts in Mathematics, 2003.

H. Liu, T. Yao, R. Li, and Y. Ye, Folded concave penalized sparse linear regression: sparsity, statistical performance, and algorithmic theory for local solutions, Mathematical Programming, vol.166, pp.207-240, 2017.

P. Mertikopoulos, E. V. Belmega, R. Negrel, and L. Sanguinetti, Distributed stochastic optimization via matrix exponential learning, IEEE Transactions on Signal Processing, vol.65, pp.2277-2290, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01382285

P. Mertikopoulos and W. H. Sandholm, Riemannian game dynamics, Journal of Economic Theory, vol.177, pp.315-364, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01382281

P. Mertikopoulos and M. Staudigl, On the convergence of gradient-like flows with noisy gradient input, SIAM Journal on Optimization, vol.28, pp.163-197, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01404586

P. Mertikopoulos and Z. Zhou, Learning in games with continuous action sets and unknown payoff functions, Mathematical Programming, vol.173, pp.465-507, 2019.

A. S. Nemirovski and D. B. Yudin, Problem Complexity and Method Efficiency in Optimization, 1983.

Y. Nesterov, Primal-dual subgradient methods for convex problems, Mathematical Programming, vol.120, pp.221-259, 2009.

Y. Nesterov and A. S. Nemirovski, Interior Point Polynomial Methods in Convex programming, 1994.

N. Nisan, T. Roughgarden, É. Tardos, and V. V. Vazirani, Algorithmic Game Theory, 2007.

J. Nocedal and S. J. Wright, Numerical Optimization, 2000.

B. T. Polyak, Introduction to Optimization, Optimization Software, 1987.

R. A. Polyak, Regularized Newton method for unconstrained convex optimization, Mathematical Programming, vol.120, pp.125-145, 2009.

S. Shalev-shwartz, Online learning and online convex optimization, Foundations and Trends in Machine Learning, vol.4, pp.107-194, 2011.

W. Su, S. Boyd, and E. J. Candès, A differential equation for modeling Nesterov's accelerated gradient method: Theory and insights, NIPS '14: Proceedings of the 27th International Conference on Neural Information Processing Systems, pp.2510-2518, 2014.

P. Tseng, Convergence properties of Dikin's affine scaling algorithm for nonconvex quadratic minimization, Journal of Global Optimization, vol.30, pp.285-300, 2004.

P. Tseng, I. M. Bomze, and W. Schachinger, A first-order interior-point method for linearly constrained smooth optimization, Mathematical Programming, vol.127, pp.399-424, 2011.

R. J. Vanderbei, M. S. Meketon, and B. A. Freedman, A modification of Karmarkar's linear programming algorithm, Algorithmica, pp.395-407, 1986.

S. A. Vavasis, Quadratic programming is in NP, Information Processing Letters, pp.73-77, 1990.

L. Vigneri, G. Paschos, and P. Mertikopoulos, Large-scale network utility maximization: Countering exponential growth with exponentiated gradients, INFOCOM '19: Proceedings of the 38th IEEE International Conference on Computer Communications, 2019.
URL : https://hal.archives-ouvertes.fr/hal-02405759

A. Wibisono, A. C. Wilson, and M. I. Jordan, A variational perspective on accelerated methods in optimization, Proceedings of the National Academy of Sciences, vol.113, p.7351, 2016.