Cover Image

Worst-case convergence analysis of relatively inexact gradient descent on smooth convex functions

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Vernimmen, Pierre, Glineur, François
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

Empirical and computer-aided robustness analysis of long-step and accelerated methods in smooth convex optimization
by: Vernimmen, Pierre, et al.
Published: (2025)

Exact worst-case convergence rates of gradient descent: a complete analysis for all constant stepsizes over nonconvex and convex functions
by: Rotaru, Teodor, et al.
Published: (2024)

Proximal gradient methods with inexact oracle of degree q for composite optimization
by: Nabou, Yassine, et al.
Published: (2024)

Global and local approaches for the minimization of a sum of pointwise minima of convex functions
by: Van Dessel, Guillaume, et al.
Published: (2025)

Non-smooth stochastic gradient descent using smoothing functions
by: Giovannelli, Tommaso, et al.
Published: (2025)

Presolve techniques for quasi-convex chance constraints with finite-support low-dimensional uncertainty
by: Van Dessel, Guillaume, et al.
Published: (2025)

Improved convergence rates for the Difference-of-Convex algorithm
by: Rotaru, Teodor, et al.
Published: (2024)

On the convergence analysis of the decentralized projected gradient descent method
by: Choi, Woocheol, et al.
Published: (2023)

Global minimization of a minimum of a finite collection of functions
by: Van Dessel, Guillaume, et al.
Published: (2024)

On the Worst-Case Analysis of Cyclic Block Coordinate Descent type Algorithms
by: Kamri, Yassine, et al.
Published: (2025)

Exact Convergence rate of the subgradient method by using Polyak step size
by: Zamani, Moslem, et al.
Published: (2024)

A relative-error inexact ADMM splitting algorithm for convex optimization with inertial effects
by: Alves, M. Marques, et al.
Published: (2024)

Dual first-order methods for efficient computation of convex hull prices
by: Tanji, Sofiane, et al.
Published: (2025)

Proximal gradient-type method with generalized distance and convergence analysis without global descent lemma
by: Yagishita, Shotaro, et al.
Published: (2025)

Nonconvex optimization and convergence of stochastic gradient descent, and solution of asynchronous game
by: Buck, Kevin, et al.
Published: (2025)

A short proof of near-linear convergence of adaptive gradient descent under fourth-order growth and convexity
by: Davis, Damek, et al.
Published: (2026)

An inexact inertial projective splitting algorithm with strong convergence
by: Alves, M. Marques, et al.
Published: (2025)

Proximal gradient descent on the smoothed duality gap to solve saddle point problems
by: Fercoq, Olivier
Published: (2025)

A unified framework for inexact adaptive stepsizes in the gradient methods, the conjugate gradient methods and the quasi-Newton methods for strictly convex quadratic optimization
by: Liu, Zexian
Published: (2026)

Worst-case analysis of restarted primal-dual hybrid gradient on totally unimodular linear programs
by: Hinder, Oliver
Published: (2023)

Nonlinear conjugate gradient for smooth convex functions
by: Karimi, Sahar, et al.
Published: (2021)

Introduction: Swarm-based gradient descent for non convex optimization
by: Tikko, Janina
Published: (2024)

Non-ergodic linear convergence property of the delayed gradient descent under the strongly convexity and the Polyak-Łojasiewicz condition
by: Choi, Hyung Jun, et al.
Published: (2023)

Global convergence of gradient descent for phase retrieval
by: Fougereux, Théodore, et al.
Published: (2024)

Tight Analysis of Difference-of-Convex Algorithm (DCA) Improves Convergence Rates for Proximal Gradient Descent
by: Rotaru, Teodor, et al.
Published: (2025)

Calculus rules for proximal ε-subdifferentials and inexact proximity operators for weakly convex functions
by: Bednarczuk, Ewa, et al.
Published: (2022)

On the global convergence of gradient descent for wide shallow models with bounded nonlinearities
by: Petit, Romain, et al.
Published: (2026)

On convergence rates of subgradient descent on semialgebraic functions
by: Chzhen, Evgenii, et al.
Published: (2026)

A globalized inexact semismooth Newton method for strongly convex optimal control problems
by: Wachsmuth, Daniel
Published: (2025)

Gradient directions and relative inexactness in optimization and machine learning
by: Vasin, Artem
Published: (2024)

On the Set of Possible Minimizers of a Sum of Convex Functions
by: Zamani, Moslem, et al.
Published: (2024)

Coordinate descent methods beyond smoothness and separability
by: Chorobura, Flavia, et al.
Published: (2024)

Stochastic smoothing accelerated gradient method for general constrained nonsmooth convex composite optimization
by: Wang, Ruyu, et al.
Published: (2023)

Implicit regularization of normalized gradient descent
by: Josz, Cédric
Published: (2026)

Minimizing smooth Kurdyka-Łojasiewicz functions via generalized descent methods: Convergence rate and complexity
by: Ahookhosh, Masoud, et al.
Published: (2025)

Adaptive control mechanisms in gradient descent algorithms
by: Iannelli, Andrea
Published: (2025)

Using non-convex optimization in quantum process tomography: Factored gradient descent is tough to beat
by: Quiroga, David A., et al.
Published: (2023)

Research on the descent direction of prediction correction algorithms for pseudo-convex/convex optimization problems
by: Li, Ting, et al.
Published: (2025)

Tight Convergence Rates in Gradient Mapping for the Difference-of-Convex Algorithm
by: Rotaru, Teodor, et al.
Published: (2025)

Almost sure convergence of stochastic Hamiltonian descent methods
by: Williamson, Måns, et al.
Published: (2024)