Gradient descent avoids strict saddles with a simple line-search method too

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Muşat, Andreea-Alexandra, Boumal, Nicolas
Format:	Preprint
Published:	2025
Subjects:	Optimization and Control Numerical Analysis Dynamical Systems 90C30 (Primary) 65K05, 37C75, 58K05 (Secondary)
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A non-autonomous center-stable set theorem for saddle avoidance in optimization
by: Muşat, Andreea-Alexandra, et al.
Published: (2026)

A practical randomized trust-region method to escape saddle points in high dimension
by: Dragomir, Radu-Alexandru, et al.
Published: (2026)

A Sequential Homotopy Method for Mathematical Programming Problems
by: Potschka, Andreas, et al.
Published: (2019)

A line search filter sequential adaptive cubic regularisation algorithm for nonlinearly constrained optimization
by: Pei, Yonggang, et al.
Published: (2024)

Shadow splitting methods for nonconvex optimisation: epi-approximation, convergence and saddle point avoidance
by: Atenas, Felipe
Published: (2025)

Stochastic momentum ADMM for nonconvex and nonsmooth optimization with application to PnP algorithm
by: Deng, Kangkang, et al.
Published: (2025)

Parallel block coordinate descent methods with identification strategies
by: Lopes, Ronaldo, et al.
Published: (2025)

Retractions by Alternating Projections
by: Chen, Shixiang, et al.
Published: (2026)

Accelerated Gradient Methods with Gradient Restart: Global Linear Convergence
by: Bao, Chenglong, et al.
Published: (2024)

On the Convergence Rates of Iterative Regularization Algorithms for Composite Bi-Level Optimization
by: Shtern, Shimrit, et al.
Published: (2025)

Inexact Riemannian Gradient Descent Method for Nonconvex Optimization
by: Zhou, Juan, et al.
Published: (2024)

On the regularization property of Levenberg-Marquardt method with Singular Scaling for nonlinear inverse problems
by: Filippozzi, Rafaela, et al.
Published: (2025)

Convergence analysis of Levenberg-Marquardt method with Singular Scaling for nonzero residue nonlinear least-squares problems
by: Filippozzi, Rafaela, et al.
Published: (2024)

The Global R-linear Convergence of Nesterov's Accelerated Gradient Method with Unknown Strongly Convex Parameter
by: Bao, Chenglong, et al.
Published: (2023)

A descent method for nonsmooth multiobjective optimization problems on Riemannian manifolds
by: Tang, Chunming, et al.
Published: (2023)

Gradient descent with adaptive stepsize converges (nearly) linearly under fourth-order growth
by: Davis, Damek, et al.
Published: (2024)

Anderson Accelerated Primal-Dual Hybrid Gradient for solving LP
by: Zhou, Yingxin, et al.
Published: (2025)

Model-Driven Subspaces for Large-Scale Optimization with Local Approximation Strategy
by: He, Yitong, et al.
Published: (2025)

ASPEN: An Additional Sampling Penalty Method for Finite-Sum Optimization Problems with Nonlinear Equality Constraints
by: Krejić, Nataša, et al.
Published: (2025)

Globally Optimal Solutions to a Class of Fractional Optimization Problems Based on Proximal Gradient Algorithm
by: Lin, Yizun, et al.
Published: (2023)

A Two-step Krasnosel'skii-Mann Algorithm with Adaptive Momentum and Its Applications to Image Denoising and Matrix Completion
by: He, Yongxin, et al.
Published: (2025)

A New Linear Programming Approach and a New Backtracking Strategy for Multiple-Gradient Descent in Multi-Objective Optimization
by: Della Santa, Francesco
Published: (2024)

Nonsmooth convex-concave saddle point problems with cardinality penalties
by: Bian, Wei, et al.
Published: (2024)

Mathematical programs with complementarity constraints and application to hyperparameter tuning for nonlinear support vector machines
by: Ward, Samuel, et al.
Published: (2025)

Approximate Bregman Proximal Gradient Algorithm for Relatively Smooth Nonconvex Optimization
by: Takahashi, Shota, et al.
Published: (2023)

A novel numerical method tailored for unconstrained optimization problems
by: Li, Lin, et al.
Published: (2025)

Alternating Gradient-Type Algorithm for Bilevel Optimization with Inexact Lower-Level Solutions via Moreau Envelope-based Reformulation
by: Bai, Xiaoning, et al.
Published: (2024)

An Interior-Point Algorithm for Continuous Nonlinearly Constrained Optimization with Noisy Function and Derivative Evaluations
by: Curtis, Frank E., et al.
Published: (2025)

A Two Stepsize SQP Method for Nonlinear Equality Constrained Stochastic Optimization
by: O'Neill, Michael J.
Published: (2024)

Complexity of an inexact stochastic SQP algorithm for equality constrained optimization
by: O'Neill, Michael J., et al.
Published: (2026)

Modified parameter of Dai Liao conjugacy condition of the conjugate gradient method
by: Alhawarat, Ahmad
Published: (2023)

An inexact infeasible arc-search interior-point method for linear optimization problems
by: Iida, Einosuke, et al.
Published: (2024)

Improved convergence rates for the multiobjective Frank-Wolfe method
by: Gonçalves, Douglas S., et al.
Published: (2024)

An NEPv Approach for Feature Selection via Orthogonal OCCA with the (2,1)-norm Regularization
by: Wang, Li, et al.
Published: (2025)

On the Convergence and Complexity of Proximal Gradient and Accelerated Proximal Gradient Methods under Adaptive Gradient Estimation
by: Bollapragada, Raghu, et al.
Published: (2025)

On the convergence of proximal gradient methods for convex simple bilevel optimization
by: Latafat, Puya, et al.
Published: (2023)

A Proximal Stochastic Gradient Method with Adaptive Step Size and Variance Reduction for Convex Composite Optimization
by: Fang, Changjie, et al.
Published: (2025)

Spectral conjugate gradient projection methods for large-scale monotone equations without Lipschitz continuity
by: Hamiss, Kabenge, et al.
Published: (2026)

Accelerating Diagonal Methods for Bilevel Optimization: Unified Convergence via Continuous-Time Dynamics
by: Boţ, Radu Ioan, et al.
Published: (2025)

Augmented Lagrangian methods for fully convex composite optimization
by: De Marchi, Alberto, et al.
Published: (2025)