Convergence analysis of the ADAM algorithm for linear inverse problems
From MaRDI portal
Cites work
- A general system of differential equations to model first-order adaptive algorithms
- A randomized Kaczmarz algorithm with exponential convergence
- A Stochastic Approximation Method
- A Technique for the Numerical Solution of Certain Integral Equations of the First Kind
- Acceleration of randomized Kaczmarz method via the Johnson-Lindenstrauss lemma
- An introduction to the mathematical theory of inverse problems
- Convergence and dynamical behavior of the ADAM algorithm for nonconvex stochastic optimization
- Deconvolution and regularization with Toeplitz matrices
- scientific article; zbMATH DE number 1405930 (Why is no real title available?)
- scientific article; zbMATH DE number 3027894 (Why is no real title available?)
- Improvement of the resolution of an instrument by numerical solution of an integral equation
- On the Convergence of Stochastic Gradient Descent for Linear Inverse Problems in Banach Spaces
- On the Convergence of Stochastic Gradient Descent for Nonlinear Ill-Posed Problems
- On the discrepancy principle for stochastic gradient descent
- On the regularizing property of stochastic gradient descent
- Physics-informed neural networks for inverse problems in supersonic flows
- Randomized Kaczmarz solver for noisy linear systems
- Some methods of speeding up the convergence of iteration methods
This page was built for publication: Convergence analysis of the ADAM algorithm for linear inverse problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7299583)