Bolte, JérômeORCID: https://orcid.org/0000-0002-1676-8407, Pauwels, EdouardORCID: https://orcid.org/0000-0002-8180-075X, Le, Quoc Tung and Vaiter, Samuel (2026) Geometric and computational hardness of bilevel programming. Mathematical Programming, vol.215. pp. 539-574.

Bolte, JérômeORCID: https://orcid.org/0000-0002-1676-8407, Le, Tam, Moulines, Éric and Pauwels, EdouardORCID: https://orcid.org/0000-0002-8180-075X (2025) Inexact subgradient methods for semialgebraic functions. Mathematical Programming. (In Press)

Bolte, JérômeORCID: https://orcid.org/0000-0002-1676-8407, Miclo, LaurentORCID: https://orcid.org/0000-0001-5502-2862 and Villeneuve, StéphaneORCID: https://orcid.org/0000-0003-3213-1905 (2024) Swarm gradient dynamics for global optimization: the mean-field limit case. Mathematical Programming, Vol. 205. pp. 661-701.

Koessler, Frédéric, Laclau, Marie, Renault, Jérôme and Tomala, Tristan (2024) Splitting games over finite sets. Mathematical Programming, vol.203. pp. 477-498.

Dragomir, Radu, Taylor, Adrien B., Bolte, Jérôme and D'Aspremont, Alexandre (2022) Optimal complexity and certification of Bregman first-order methods. Mathematical Programming, 194. pp. 41-83.

Bolte, Jérôme, Chen, Zheng and Pauwels, Edouard (2020) The multiproximal linearization method for convex composite problems. Mathematical Programming, vol. 182. pp. 1-36.

Bolte, Jérôme and Pauwels, Edouard (2019) Conservative set valued fields, automatic differentiation, stochastic gradient methods and deep learning. Mathematical Programming. pp. 1-33. (In Press)

Bolte, Jérôme, Nguyen, Trong Phong, Peypouquet, Juan and Suter, Bruce W. (2017) From error bounds to the complexity of first-order descent methods for convex functions. Mathematical Programming, 165 (2). pp. 471-507.

Bolte, Jérôme, Sabach, Shoham and Teboulle, Marc (2014) Proximal alternating linearized method for nonconvex and nonsmooth problems. Mathematical Programming, 146. pp. 459-494.

Attouch, Hédy, Bolte, Jérôme and Svaiter, Benar Fux (2013) Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel method. Mathematical Programming, 137 (1-2). pp. 91-129.

Alvarez, Felipe, Bolte, Jérôme, Bonnans, Frédéric and Silva-Àlvarez, Francisco José (2012) Asymptotic expansions for interior penalty solutions of control constrained linear-quadratic problems. Mathematical Programming, 135 (n°1-2). pp. 473-507.

Bolte, Jérôme, Daniilidis, Aris and Lewis, Adrian (2009) Tame Functions are Semismooth. Mathematical Programming, 117 (1-2). pp. 5-19.

Attouch, Hédy and Bolte, Jérôme (2009) On the Convergence of the Proximal Algorithm for Nonsmooth Functions Involving Analytic Features. Mathematical Programming, 116 (1-2). pp. 5-16.