A novel stepsize for gradient descent method
From MaRDI portal
Cites work
- A descent lemma beyond Lipschitz gradient continuity: first-order methods revisited and applications
- A non-Euclidean gradient descent method with sketching for unconstrained matrix minimization
- Cauchy and the gradient method
- Cauchy's method of minimization
- Cubic regularization of Newton method and its global performance
- Foundations of Optimization
- scientific article; zbMATH DE number 3304564 (Why is no real title available?)
- Introduction to nonlinear optimization: theory, algorithms, and applications with MATLAB
- Lectures on convex optimization
- Matrix and tensor factorization techniques for recommender systems
- Minimization of functions having Lipschitz continuous first partial derivatives
- Nonlinear programming
- Polyak's gradient method for split feasibility problem constrained by level sets
- Some modified fast iterative shrinkage thresholding algorithms with a new adaptive non-monotone stepsize strategy for nonsmooth and convex minimization problems
- Stabilized Barzilai-Borwein method
- Stochastic gradient descent with Polyak's learning rate
- The Variable Metric Forward-Backward Splitting Algorithm Under Mild Differentiability Assumptions
- Two-Point Step Size Gradient Methods
Cited in
(5)- Projection algorithm with extrapolations from the past for variational inequalities
- A new proximal gradient method for solving mixed variational inequality problems with a novel explicit stepsize and applications
- Novel subgradient extragradient methods for equilibrium problems in Hilbert spaces
- A new strongly convergent adaptive inertial subgradient extragradient method with convergence rates
- An adaptive stochastic gradient descent algorithm for solving convex optimization problenms
This page was built for publication: A novel stepsize for gradient descent method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6564290)
