Linear convergence of the randomized sparse Kaczmarz method
From MaRDI portal
Publication:1717238
DOI10.1007/s10107-017-1229-1zbMath1408.65038arXiv1610.02889OpenAlexW2531859882MaRDI QIDQ1717238
Dirk A. Lorenz, Frank Schöpfer
Publication date: 7 February 2019
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1610.02889
error boundslinear convergencesparse solutionssplit feasibility problemrandomized Kaczmarz methodBregman projections
Numerical solutions to overdetermined systems, pseudoinverses (65F20) Numerical mathematical programming methods (65K05) Convex programming (90C25)
Related Items (19)
Greedy randomized and maximal weighted residual Kaczmarz methods with oblique projection ⋮ Feasibility-based fixed point networks ⋮ Adaptively sketched Bregman projection methods for linear systems ⋮ Rates of convergence of randomized Kaczmarz algorithms in Hilbert spaces ⋮ Extended randomized Kaczmarz method for sparse least squares and impulsive noise problems ⋮ A Fast Averaged Kaczmarz Iteration with Convex Penalty for Inverse Problems in Hilbert Spaces ⋮ Randomized Kaczmarz method with adaptive stepsizes for inconsistent linear systems ⋮ Stochastic mirror descent method for linear ill-posed problems in Banach spaces ⋮ Faster randomized block sparse Kaczmarz by averaging ⋮ Sparse sampling Kaczmarz–Motzkin method with linear convergence ⋮ On the Convergence of Stochastic Gradient Descent for Linear Inverse Problems in Banach Spaces ⋮ Bregman Itoh-Abe methods for sparse optimisation ⋮ Accelerating Sparse Recovery by Reducing Chatter ⋮ A simple recovery framework for signals with time-varying sparse support ⋮ Random activations in primal-dual splittings for monotone inclusions with a priori information ⋮ Convergence Analysis of Inexact Randomized Iterative Methods ⋮ Regularized Kaczmarz Algorithms for Tensor Recovery ⋮ A weighted randomized sparse Kaczmarz method for solving linear systems ⋮ Semi-supervised learning-assisted imaging method for electrical capacitance tomography
Uses Software
Cites Work
- Strongly convex programming for exact matrix completion and robust principal component analysis
- Block Kaczmarz method with inequalities
- Randomized Kaczmarz solver for noisy linear systems
- A randomized Kaczmarz algorithm with exponential convergence
- A multiprojection algorithm using Bregman projections in a product space
- The rate of convergence for the method of alternating projections. II
- Convergence of Bregman projection methods for solving consistent convex feasibility problems in reflexive Banach spaces
- Strong conical hull intersection property, bounded linear regularity, Jameson's property \((G)\), and error bounds in convex optimization
- Almost sure convergence of the Kaczmarz algorithm with random measurements
- Restricted strong convexity and its applications to convergence analysis of gradient-type methods in convex optimization
- Fast low-rank modifications of the thin singular value decomposition
- AIR tools -- a MATLAB package of algebraic iterative reconstruction methods
- Paved with good intentions: analysis of a randomized block Kaczmarz method
- Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function
- Stochastic First-Order Methods with Random Constraint Projection
- Linear Convergence of Descent Methods for the Unconstrained Minimization of Restricted Strongly Convex Functions
- Randomized Extended Kaczmarz for Solving Least Squares
- Augmented $\ell_1$ and Nuclear-Norm Models with a Globally Linearly Convergent Algorithm
- The Linearized Bregman Method via Split Feasibility Problems: Analysis and Generalizations
- Efficiency of Coordinate Descent Methods on Huge-Scale Optimization Problems
- Analysis and Generalizations of the Linearized Bregman Method
- Convergence of the linearized Bregman iteration for ℓ₁-norm minimization
- A Singular Value Thresholding Algorithm for Matrix Completion
- Randomized Methods for Linear Constraints: Convergence Rates and Conditioning
- The multiple-sets split feasibility problem and its applications for inverse problems
- An iterative regularization method for the solution of the split feasibility problem in Banach spaces
- Decoding by Linear Programming
- Sparse and Redundant Representations
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
- Some continuity properties of polyhedral multifunctions
- Atomic Decomposition by Basis Pursuit
- Variational Analysis
- Bregman Monotone Optimization Algorithms
- A unified treatment of some iterative algorithms in signal processing and image reconstruction
- Iterative oblique projection onto convex sets and the split feasibility problem
- On Projection Algorithms for Solving Convex Feasibility Problems
- Exact Regularization of Polyhedral Norms
- Several solution methods for the split feasibility problem
- Proximity function minimization using multiple Bregman projections, with applications to split feasibility and Kullback--Leibler distance minimization
- Stochastic gradient descent, weighted sampling, and the randomized Kaczmarz algorithm
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Linear convergence of the randomized sparse Kaczmarz method
