Regularized Kaczmarz Algorithms for Tensor Recovery
From MaRDI portal
Publication:5860371
DOI10.1137/21M1398562OpenAlexW3206040143MaRDI QIDQ5860371
Publication date: 19 November 2021
Published in: SIAM Journal on Imaging Sciences (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2102.06852
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (3)
Extended randomized Kaczmarz method for sparse least squares and impulsive noise problems ⋮ Randomized Kaczmarz method with adaptive stepsizes for inconsistent linear systems ⋮ A weighted randomized sparse Kaczmarz method for solving linear systems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- Randomized block Kaczmarz method with projection for solving least squares
- Optimization techniques in computer vision. Ill-posed problems and regularization
- Factorization strategies for third-order tensors
- Acceleration of randomized Kaczmarz method via the Johnson-Lindenstrauss lemma
- Randomized Kaczmarz solver for noisy linear systems
- A randomized Kaczmarz algorithm with exponential convergence
- Linear convergence of the randomized sparse Kaczmarz method
- Almost sure convergence of the Kaczmarz algorithm with random measurements
- Sparse randomized Kaczmarz for support recovery of jointly sparse corrupted multiple measurement vectors
- Coordinate descent algorithms
- Paved with good intentions: analysis of a randomized block Kaczmarz method
- Convergence rates for Kaczmarz-type regularization methods
- Mathematical Models for Local Nontexture Inpaintings
- 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
- Convergence of the linearized Bregman iteration for ℓ₁-norm minimization
- A Singular Value Thresholding Algorithm for Matrix Completion
- Convergence Properties of the Randomized Extended Gauss--Seidel and Kaczmarz Methods
- Tensor-Based Formulation and Nuclear Norm Regularization for Multienergy Computed Tomography
- On Greedy Randomized Kaczmarz Method for Solving Large Sparse Linear Systems
- Phase retrieval via randomized Kaczmarz: theoretical guarantees
- Third-Order Tensors as Operators on Matrices: A Theoretical and Computational Framework with Applications in Imaging
- Tensor Regression with Applications in Neuroimaging Data Analysis
- An Augmented Lagrangian Method for Total Variation Video Restoration
- Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing
- Convex Analysis
- Convex analysis and monotone operator theory in Hilbert spaces
- Stochastic gradient descent, weighted sampling, and the randomized Kaczmarz algorithm
- Randomized subspace actions and fusion frames
This page was built for publication: Regularized Kaczmarz Algorithms for Tensor Recovery
