Gradient descent in the absence of global Lipschitz continuity of the gradients
type: Item
instance of: scholarly article
title: Gradient descent in the absence of global Lipschitz continuity of the gradients
author: Vivak Patel
author: Albert S. Berahas
published in: SIAM Journal on Mathematics of Data Science
publication date: 2024-08-06T00:00:00Z
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 68T99
Mathematics Subject Classification ID: 68W40
zbMATH DE Number: 7892807
zbMATH Keywords: gradient descent
zbMATH Keywords: diminishing step sizes
zbMATH Keywords: convergence
zbMATH Keywords: divergence
MaRDI profile type: Publication
cites work: Minimization of functions having Lipschitz continuous first partial derivatives
cites work: A Descent Lemma Beyond Lipschitz Gradient Continuity: First-Order Methods Revisited and Applications
cites work: First-Order Methods in Optimization
cites work: Q4938927
cites work: Nonlinear programming
cites work: Convergence and exponential convergence of identification algorithms with directional forgetting factor
cites work: First Order Methods Beyond Convexity and Lipschitz Gradient Continuity with Applications to Quadratic Inverse Problems
cites work: Large-Scale Machine Learning with Stochastic Gradient Descent
cites work: Exponential convergence of the Kalman filter based parameter estimation algorithm
cites work: Adaptive cubic regularisation methods for unconstrained optimization. I: Motivation, convergence and numerical results
cites work: Adaptive cubic regularisation methods for unconstrained optimization. II: Worst-case function- and derivative-evaluation complexity
cites work: Evaluation Complexity of Algorithms for Nonconvex Optimization: Theory, Computation and Perspectives
cites work: The method of steepest descent for non-linear minimization problems
cites work: Convergence of stochastic algorithms: from the Kushner–Clark theorem to the Lyapounov functional method
cites work: An adaptive trust-region method without function evaluations
cites work: Mémoire sur le problème d'analyse relatif à l'équilibre des plaques élastiques encastrées.
cites work: Fast gradient descent method for mean-CVaR optimization
cites work: Exponential convergence of recursive last squares with exponential forgetting factor
cites work: A class of nonmonotone trust region algorithms for unconstrained optimization problems
cites work: Cauchy and the gradient method
cites work: Analysis of recursive stochastic algorithms
cites work: Relatively Smooth Convex Optimization by First-Order Methods, and Applications
cites work: Robust Stochastic Approximation Approach to Stochastic Programming
cites work: Universal gradient methods for convex optimization problems
cites work: Q5491447
cites work: Recursive forgetting algorithms
cites work: Stopping criteria for, and strong convergence of, stochastic gradient descent on Bottou-Curtis-Nocedal functions
cites work: Inexact model: a framework for optimization and variational inequalities
cites work: Black-Box Complexity of Local Minimization
cites work: Q5149016
cites work: Superlinearly convergent trust-region method without the assumption of positive-definite Hessian
cites work: A trust region method for optimization problem with singular solutions
cites work: Q3277015
DOI: 10.1137/22M1527210
description: scientific article; zbMATH DE number 7892807