Sampled limited memory methods for massive linear inverse problems
From MaRDI portal
Publication:5000590
DOI10.1088/1361-6420/ab77daOpenAlexW3007809852MaRDI QIDQ5000590
J. Tanner Slagel, Luis Tenorio, Julianne Chung, Matthias Chung
Publication date: 14 July 2021
Published in: Inverse Problems (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1912.07962
Algorithms in computer science (68Wxx) Mathematical programming (90Cxx) Numerical linear algebra (65Fxx) Computer aspects of numerical algorithms (65Yxx) Numerical methods for mathematical programming, optimization and variational techniques (65Kxx)
Related Items (4)
An Optimal Scheduled Learning Rate for a Randomized Kaczmarz Algorithm ⋮ slimTrain---A Stochastic Approximation Method for Training Separable Deep Neural Networks ⋮ A variable projection method for large-scale inverse problems with \(\ell^1\) regularization ⋮ Foreword to special issue of Inverse Problems on modern challenges in imaging
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions
- A Stochastic Quasi-Newton Method for Large-Scale Optimization
- Randomized block Kaczmarz method with projection for solving least squares
- Acceleration of randomized Kaczmarz method via the Johnson-Lindenstrauss lemma
- Generalized row-action methods for tomographic imaging
- Block-iterative methods for consistent and inconsistent linear equations
- A Sherman-Morrison approach to the solution of linear systems
- On the acceleration of Kaczmarz's method for inconsistent linear systems
- Randomized Kaczmarz solver for noisy linear systems
- A randomized Kaczmarz algorithm with exponential convergence
- A note on the behavior of the randomized Kaczmarz algorithm of Strohmer and Vershynin
- Comments on the randomized Kaczmarz method
- Strong underrelaxation in Kaczmarz's method for inconsistent systems
- Extensions of block-projections methods with relaxation parameters to inconsistent and rank-deficient least-squares problems
- The randomized Kaczmarz method with mismatched adjoint
- Paved with good intentions: analysis of a randomized block Kaczmarz method
- Projection method for solving a singular system of linear equations and its applications
- The Mathematics of Computerized Tomography
- Fundamentals of Computerized Tomography
- Global Convergence of Online Limited Memory BFGS
- Randomized Extended Kaczmarz for Solving Least Squares
- LSRN: A Parallel Iterative Solver for Strongly Over- or Underdetermined Systems
- Blendenpik: Supercharging LAPACK's Least-Squares Solver
- Randomized Iterative Methods for Linear Systems
- Lectures on Stochastic Programming
- Robust Stochastic Approximation Approach to Stochastic Programming
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
- Relaxation methods for image reconstruction
- Randomized Quasi-Newton Updates Are Linearly Convergent Matrix Inversion Algorithms
- Preasymptotic convergence of randomized Kaczmarz method
- Optimization Methods for Large-Scale Machine Learning
- Sampled Tikhonov regularization for large linear inverse problems
- Semi-convergence properties of Kaczmarz’s method
- Discrete Inverse Problems
- On‐line learning for very large data sets
- Numerical methods for coupled super-resolution
- Two Algorithms Related to the Method of Steepest Descent
- Stochastic gradient descent, weighted sampling, and the randomized Kaczmarz algorithm
This page was built for publication: Sampled limited memory methods for massive linear inverse problems
