Jérôme Bolte
Orcid: 0000-0002-1676-8407Affiliations:
- University Toulouse Capitole, Toulouse, France
According to our database1,
Jérôme Bolte
authored at least 45 papers
between 2003 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on tse-fr.eu
-
on orcid.org
-
on id.loc.gov
On csauthors.net:
Bibliography
2024
Math. Program., May, 2024
SIAM J. Optim., March, 2024
CoRR, 2024
2023
SIAM J. Optim., December, 2023
The backtrack Hölder gradient method with application to min-max and min-min problems.
Open J. Math. Optim., 2023
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023
Proceedings of the Eleventh International Conference on Learning Representations, 2023
2022
Neural Process. Lett., 2022
Math. Program., 2022
Nonsmooth automatic differentiation: a cheap gradient principle and other complexity results.
CoRR, 2022
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022
2021
Conservative set valued fields, automatic differentiation, stochastic gradient methods and deep learning.
Math. Program., 2021
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021
2020
Math. Program., 2020
Long term dynamics of the subgradient method for Lipschitz path differentiable functions.
CoRR, 2020
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020
2019
On Linear Convergence of Non-Euclidean Gradient Methods without Strong Convexity and Lipschitz Gradient Continuity.
J. Optim. Theory Appl., 2019
Conservative set valued fields, automatic differentiation, stochastic gradient method and deep learning.
CoRR, 2019
2018
First Order Methods Beyond Convexity and Lipschitz Gradient Continuity with Applications to Quadratic Inverse Problems.
SIAM J. Optim., 2018
Math. Oper. Res., 2018
2017
From error bounds to the complexity of first-order descent methods for convex functions.
Math. Program., 2017
A Descent Lemma Beyond Lipschitz Gradient Continuity: First-Order Methods Revisited and Applications.
Math. Oper. Res., 2017
2016
Majorization-Minimization Procedures and Convergence of SQP Methods for Semi-Algebraic and Tame Programs.
Math. Oper. Res., 2016
2015
2014
Math. Program., 2014
2013
Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods.
Math. Program., 2013
2012
Asymptotic expansions for interior penalty solutions of control constrained linear-quadratic problems.
Math. Program., 2012
2011
Math. Oper. Res., 2011
2010
Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Lojasiewicz Inequality.
Math. Oper. Res., 2010
Proceedings of the International Conference on Image Processing, 2010
2009
On the convergence of the proximal algorithm for nonsmooth functions involving analytic features.
Math. Program., 2009
2008
Found. Comput. Math., 2008
2007
The [barred L]ojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems.
SIAM J. Optim., 2007
2004
SIAM J. Control. Optim., 2004
2003
Barrier Operators and Associated Gradient-Like Dynamical Systems for Constrained Minimization Problems.
SIAM J. Control. Optim., 2003