Cover Image

A Fast Newton Method Under Local Lipschitz Smoothness

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Gratton, Serge, Jerad, Sadok, Toint, Philippe L.
Format:	Preprint
Published:	2025
Subjects:	Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A Stochastic Objective-Function-Free Adaptive Regularization Method with Optimal Complexity
by: Gratton, Serge, et al.
Published: (2024)

Complexity of Adagrad and other first-order methods for nonconvex optimization problems with bounds constraints
by: Gratton, Serge, et al.
Published: (2024)

Complexity and performance for two classes of noise-tolerant first-order algorithms
by: Gratton, S., et al.
Published: (2022)

A Simple First-Order Algorithm for Full-Rank Equality Constrained Optimization
by: Gratton, Serge, et al.
Published: (2025)

OPM, a collection of Optimization Problems in Matlab
by: Gratton, Serge, et al.
Published: (2021)

On Global Rates for Regularization Methods based on Secant Derivative Approximations
by: Cartis, Coralia, et al.
Published: (2025)

S2MPJ and CUTEst optimization problems for Matlab, Python and Julia
by: Gratton, Serge, et al.
Published: (2024)

Stochastic convergence of parallel asynchronous adaptive first-order methods
by: Gratton, Serge, et al.
Published: (2026)

Iteration complexity of the Difference-of-Convex Algorithm for unconstrained optimization: a simple proof
by: Gratton, Serge, et al.
Published: (2026)

A Parameter-Free First-Order Algorithm for Non-Convex Optimization with $\tilde{\mkern1mu O}(ε^{-5/3})$ Global Rate
by: Xiong, Sichao, et al.
Published: (2026)

Recursive Bound-Constrained AdaGrad with Applications to Multilevel and Domain Decomposition Minimization
by: Gratton, Serge, et al.
Published: (2025)

An objective-function-free algorithm for nonconvex stochastic optimization with deterministic equality and inequality constraints
by: Gratton, S., et al.
Published: (2026)

Refining asymptotic complexity bounds for nonconvex optimization methods, including why steepest descent is $o(ε^{-2})$ rather than $\mathcal{O}(ε^{-2})$
by: Gratton, Serge, et al.
Published: (2024)

Lipschitz-Free Mirror Descent Methods for Non-Smooth Optimization Problems
by: Yuan, Bowen, et al.
Published: (2025)

Trust Region Methods For Nonconvex Stochastic Optimization Beyond Lipschitz Smoothness
by: Xie, Chenghan, et al.
Published: (2023)

Fast Stochastic Second-Order Adagrad for Nonconvex Bound-Constrained Optimization
by: Bellavia, S., et al.
Published: (2025)

Multilevel Regularized Newton Methods with Fast Convergence Rates
by: Tsipinakis, Nick, et al.
Published: (2024)

A Smoothing Newton Method for Rank-one Matrix Recovery
by: Maunu, Tyler, et al.
Published: (2025)

An Efficient Smoothing Damped Newton Method for Large-Scale Mathematical Programs with Equilibrium Constraints
by: Wang, Yixin, et al.
Published: (2025)

An objective-function-free algorithm for general smooth constrained optimization
by: Bellavia, S., et al.
Published: (2026)

A Newton-type Method for Non-smooth Under-determined Systems of Equations
by: Pinta, Titus
Published: (2025)

Newton methods beyond Hessian Lipschitz continuity: A nonlinear preconditioning approach
by: Bodard, Alexander, et al.
Published: (2026)

Homogeneous Second-Order Descent Framework: A Fast Alternative to Newton-Type Methods
by: He, Chang, et al.
Published: (2023)

A Stochastic Quasi-Newton Method for Non-convex Optimization with Non-uniform Smoothness
by: Sun, Zhenyu, et al.
Published: (2024)

An Adaptive Smoothing Algorithm for Non-Lipschitz Optimization on Manifolds with Complexity Guarantees
by: Wang, Lei, et al.
Published: (2026)

Greedy Newton: Newton's Method with Exact Line Search
by: Shea, Betty, et al.
Published: (2024)

A Riemannian Proximal Newton Method
by: Si, Wutao, et al.
Published: (2023)

Revisiting Randomized Smoothing: Nonsmooth Nonconvex Optimization Beyond Global Lipschitz Continuity
by: Xia, Jingfan, et al.
Published: (2025)

An optimally fast objective-function-free minimization algorithm using random subspaces
by: Bellavia, S., et al.
Published: (2023)

Faster Computation of Entropic Optimal Transport via Stable Low Frequency Modes
by: Chhaibi, Reda, et al.
Published: (2025)

Revisiting Convergence: Shuffling Complexity Beyond Lipschitz Smoothness
by: He, Qi, et al.
Published: (2025)

A Riemannian Proximal Newton-CG Method
by: Huang, Wen, et al.
Published: (2024)

Smoothing Accelerated Proximal Gradient Method with Fast Convergence Rate for Nonsmooth Multi-objective Optimization
by: Huang, Chengzhi
Published: (2023)

Improved Complexity for Smooth Nonconvex Optimization: A Two-Level Online Learning Approach with Quasi-Newton Methods
by: Jiang, Ruichen, et al.
Published: (2024)

A Smooth Locally Exact Penalty Method for Optimization Problems over Generalized Stiefel Manifolds
by: Jiang, Linshuo, et al.
Published: (2026)

A Regularized Newton Method for Nonconvex Optimization with Global and Local Complexity Guarantees
by: Zhou, Yuhao, et al.
Published: (2025)

Loss-Transformation Invariance in the Damped Newton Method
by: Shestakov, Alexander, et al.
Published: (2025)

Adaptive Regularized Newton Method with Inexact Hessian
by: Shestakov, Aleksandr, et al.
Published: (2025)

Subspace Quasi-Newton Method with Gradient Approximation
by: Miyaishi, Taisei, et al.
Published: (2024)

A Stochastic Newton-type Method for Non-smooth Optimization
by: Pinta, Titus
Published: (2025)