Gradient descent in the absence of global Lipschitz continuity of the gradients
From MaRDI portal
(Redirected from Publication:6583712)
Recommendations
- Gradient descent only converges to minimizers: non-isolated critical points and invariant regions
- Gradient Convergence in Gradient methods with Errors
- The method of gradient descent for minimizing non-convex functions
- On the global convergence rate of the gradient descent method for functions with Hölder continuous gradients
- Global convergence of the gradient method for functions definable in o-minimal structures
Cites work
- A class of nonmonotone trust region algorithms for unconstrained optimization problems
- A descent lemma beyond Lipschitz gradient continuity: first-order methods revisited and applications
- A trust region method for optimization problem with singular solutions
- Adaptive cubic regularisation methods for unconstrained optimization. I: Motivation, convergence and numerical results
- Adaptive cubic regularisation methods for unconstrained optimization. II: Worst-case function- and derivative-evaluation complexity
- An adaptive trust-region method without function evaluations
- Analysis of recursive stochastic algorithms
- Black-Box Complexity of Local Minimization
- Cauchy and the gradient method
- Convergence and exponential convergence of identification algorithms with directional forgetting factor
- Convergence of stochastic algorithms: from the Kushner–Clark theorem to the Lyapounov functional method
- Evaluation complexity of algorithms for nonconvex optimization. Theory, computation and perspectives
- Exponential convergence of recursive last squares with exponential forgetting factor
- Exponential convergence of the Kalman filter based parameter estimation algorithm
- Fast gradient descent method for mean-CVaR optimization
- First order methods beyond convexity and Lipschitz gradient continuity with applications to quadratic inverse problems
- First-order methods in optimization
- scientific article; zbMATH DE number 3159112 (Why is no real title available?)
- scientific article; zbMATH DE number 1405930 (Why is no real title available?)
- scientific article; zbMATH DE number 7306906 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- Inexact model: a framework for optimization and variational inequalities
- Large-scale machine learning with stochastic gradient descent
- Minimization of functions having Lipschitz continuous first partial derivatives
- Mémoire sur le problème d'analyse relatif à l'équilibre des plaques élastiques encastrées.
- Nonlinear programming
- Recursive forgetting algorithms
- Relatively smooth convex optimization by first-order methods, and applications
- Robust Stochastic Approximation Approach to Stochastic Programming
- Stopping criteria for, and strong convergence of, stochastic gradient descent on Bottou-Curtis-Nocedal functions
- Superlinearly convergent trust-region method without the assumption of positive-definite Hessian
- The method of steepest descent for non-linear minimization problems
- Universal gradient methods for convex optimization problems
Cited in
(1)
This page was built for publication: Gradient descent in the absence of global Lipschitz continuity of the gradients
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6583712)
