The chaotic nature of faster gradient descent methods
From MaRDI portal
Publication:454335
DOI10.1007/s10915-011-9521-3zbMath1252.65073OpenAlexW2053136023MaRDI QIDQ454335
Kees van den Doel, Uri M. Ascher
Publication date: 1 October 2012
Published in: Journal of Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10915-011-9521-3
chaosdynamical systemsnumerical examplesiterative methodsgradient descent methodsteepest descent method
Related Items (13)
Riemannian optimization and multidisciplinary design optimization ⋮ Algorithms that satisfy a stopping criterion, probably ⋮ Runge-Kutta-like scaling techniques for first-order methods in convex optimization ⋮ Cooperative concurrent asynchronous computation of the solution of symmetric linear systems ⋮ Delayed Gradient Methods for Symmetric and Positive Definite Linear Systems ⋮ Schur properties of convolutions of gamma random variables ⋮ Fast gradient methods with alignment for symmetric linear systems without using Cauchy step ⋮ Discrete processes and their continuous limits ⋮ Robust fitting of ellipsoids by separating interior and exterior points during optimization ⋮ An efficient gradient method using the Yuan steplength ⋮ Asymptotic rate of convergence of a two-layer iterative method of the variational type ⋮ Faster gradient descent and the efficient recovery of images ⋮ Level set of the asymptotic rate of convergence for the method of steepest descent
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On a successive transformation of probability distribution and its application to the analysis of the optimum gradient method
- Artificial time integration
- Steepest descent, CG, and iterative regularization of ill-posed problems
- On the behavior of the gradient norm in the steepest descent method
- Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming
- On the asymptotic behaviour of some new gradient methods
- Faster gradient descent and the efficient recovery of images
- A Numerical Approach to Ergodic Problem of Dissipative Dynamical Systems
- Preconditioned all-at-once methods for large, sparse parameter estimation problems
- R-linear convergence of the Barzilai and Borwein gradient method
- Two-Point Step Size Gradient Methods
- Period Three Implies Chaos
- Gradient Method with Retards and Generalizations
- Numerical Optimization
- Alternate minimization gradient method
- Inexact Preconditioned Conjugate Gradient Method with Inner-Outer Iteration
- Computational Methods for Inverse Problems
- Gradient descent and fast artificial time integration
- The cyclic Barzilai-–Borwein method for unconstrained optimization
- Relaxed steepest descent and Cauchy-Barzilai-Borwein method
This page was built for publication: The chaotic nature of faster gradient descent methods
