Jérôme Bolte

Orcid: 0000-0002-1676-8407

According to our database1, Jérôme Bolte authored at least 41 papers between 2003 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Swarm gradient dynamics for global optimization: the mean-field limit case.
Math. Program., May, 2024

Differentiating Nonsmooth Solutions to Parametric Monotone Inclusion Problems.
SIAM J. Optim., March, 2024

2023
Subgradient Sampling for Nonsmooth Nonconvex Minimization.
SIAM J. Optim., December, 2023

One-step differentiation of iterative algorithms.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

On the complexity of nonsmooth automatic differentiation.
Proceedings of the Eleventh International Conference on Learning Representations, 2023

2022
Second-Order Step-Size Tuning of SGD for Non-Convex Optimization.
Neural Process. Lett., 2022

Optimal complexity and certification of Bregman first-order methods.
Math. Program., 2022

Curiosities and counterexamples in smooth convex optimization.
Math. Program., 2022

Nonsmooth automatic differentiation: a cheap gradient principle and other complexity results.
CoRR, 2022

Automatic differentiation of nonsmooth iterative algorithms.
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

Quartic First-Order Methods for Low-Rank Minimization.
J. Optim. Theory Appl., 2021

An Inertial Newton Algorithm for Deep Learning.
J. Mach. Learn. Res., 2021

Nonsmooth Implicit Differentiation for Machine-Learning and Optimization.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Numerical influence of ReLU'(0) on backpropagation.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

2020
The multiproximal linearization method for convex composite problems.
Math. Program., 2020

A Hölderian backtracking method for min-max and min-min problems.
CoRR, 2020

Long term dynamics of the subgradient method for Lipschitz path differentiable functions.
CoRR, 2020

A mathematical model for automatic differentiation in machine learning.
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

Qualification Conditions in Semialgebraic Programming.
SIAM J. Optim., 2018

Nonconvex Lagrangian-Based Optimization: Monitoring Schemes and Global Convergence.
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
Definable Zero-Sum Stochastic Games.
Math. Oper. Res., 2015

2014
Proximal alternating linearized minimization for nonconvex and nonsmooth problems.
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
Generic Optimality Conditions for Semialgebraic Convex Programs.
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

Alternating proximal algorithm for blind image recovery.
Proceedings of the International Conference on Image Processing, 2010

2009
Tame functions are semismooth.
Math. Program., 2009

On the convergence of the proximal algorithm for nonsmooth functions involving analytic features.
Math. Program., 2009

2008
A Unifying Local Convergence Result for Newton's Method in Riemannian Manifolds.
Found. Comput. Math., 2008

2007
Clarke Subgradients of Stratifiable Functions.
SIAM J. Optim., 2007

The [barred L]ojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems.
SIAM J. Optim., 2007

2004
Hessian Riemannian Gradient Flows in Convex Programming.
SIAM J. Control. Optim., 2004

2003
Barrier Operators and Associated Gradient-Like Dynamical Systems for Constrained Minimization Problems.
SIAM J. Control. Optim., 2003


  Loading...