A Dynamical-System Analysis of the Optimum s-Gradient Algorithm
From MaRDI portal
Recommendations
- DYNAMICAL, SYMPLECTIC AND STOCHASTIC PERSPECTIVES ON GRADIENT-BASED OPTIMIZATION
- Stochastic generalized gradient methods in problems of dynamic systems synthesis
- Stochastic quasigradient method for optimizing the parameters of dynamic systems
- Extremum seeking of dynamical systems via gradient descent and stochastic approximation methods
- scientific article; zbMATH DE number 4210923
- A variable structure gradient adaptive algorithm for a class of dynamical systems
- Analysis of a sequential Monte Carlo method for optimization in dynamical systems
- Dynamical systems gradient method for solving ill-conditioned linear algebraic systems
- On the convergence analysis of the optimized gradient method
- Gradient method with dynamical retards for large-scale optimization problems
Cited in
(12)- Level set of the asymptotic rate of convergence for the method of steepest descent
- An extension of the second order dynamical system that models Nesterov's convex gradient method
- Steepest descent method with random step lengths
- dsoa : The implementation of a dynamic system optimization algorithm
- Studying convergence of gradient algorithms via optimal experimental design theory
- An asymptotically optimal gradient algorithm for quadratic optimization with low computational cost
- Estimation of spectral bounds in gradient algorithms
- Gradient algorithms for quadratic optimization with fast convergence rates
- DYNAMICAL, SYMPLECTIC AND STOCHASTIC PERSPECTIVES ON GRADIENT-BASED OPTIMIZATION
- On the Forsythe conjecture
- A speed up strategy for gradient methods
- A Proof of the Forsythe Conjecture for the Two-Step Restarted Conjugate Gradient Method
This page was built for publication: A Dynamical-System Analysis of the Optimum s-Gradient Algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3567628)
