Convergence analysis of a stochastic heavy-ball method for linear ill-posed problems
From MaRDI portal
Cites work
- A general convergence analysis of some Newton-type methods for nonlinear inverse problems
- Accelerated Landweber iterations for the solution of ill-posed equations
- An adaptive heavy ball method for ill-posed inverse problems
- Convergence of Best Entropy Estimates
- Convergence rates of a dual gradient method for constrained linear ill-posed problems
- scientific article; zbMATH DE number 1807400 (Why is no real title available?)
- scientific article; zbMATH DE number 936298 (Why is no real title available?)
- Landweber iteration of Kaczmarz type with general non-smooth convex penalty functionals
- Linear inverse problems with discrete data. I. General formulation and singular system analysis
- Maximum Entropy Regularization for Fredholm Integral Equations of the First Kind
- On a regularized Levenberg-Marquardt method for solving nonlinear inverse problems
- On the regularizing property of stochastic gradient descent
- Probability theory and stochastic processes
- Some methods of speeding up the convergence of iteration methods
- Stochastic gradient descent for linear inverse problems in Hilbert spaces
- Stochastic mirror descent method for linear ill-posed problems in Banach spaces
- Temporal back-projection algorithms for photoacoustic tomography with integrating line detectors
- The mathematics of computerized tomography
This page was built for publication: Convergence analysis of a stochastic heavy-ball method for linear ill-posed problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6972792)