Splitting-based randomized iterative methods for solving indefinite least squares problem
From MaRDI portal
Publication:2698193
DOI10.1016/j.amc.2023.127892OpenAlexW4320525602MaRDI QIDQ2698193
Publication date: 21 April 2023
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2203.15340
splitting methodcoordinate descentKaczmarzGauss-Seidelrandomized methodindefinite least squares problem
Uses Software
Cites Work
- Unnamed Item
- An Analysis of the Total Least Squares Problem
- Preconditioned conjugate gradient methods for the solution of indefinite least squares problems
- A randomized Kaczmarz algorithm with exponential convergence
- The equality constrained indefinite least squares problem: Theory and algorithms
- On the partial condition numbers for the indefinite least squares problem
- Block SOR methods for the solution of indefinite least squares problems
- Algorithms for indefinite linear least squares problems
- Accelerated sampling Kaczmarz Motzkin algorithm for the linear feasibility problem
- A greedy block Kaczmarz algorithm for solving large-scale linear systems
- Block sampling Kaczmarz-Motzkin methods for consistent linear systems
- Variant of greedy randomized Kaczmarz for ridge regression
- Paved with good intentions: analysis of a randomized block Kaczmarz method
- On mixed and componentwise condition numbers for indefinite least squares problem
- Incomplete hyperbolic Gram-Schmidt-based preconditioners for the solution of large indefinite least squares problems
- An algorithm for solving the indefinite least squares problem with equality constraints
- Randomized Extended Kaczmarz for Solving Least Squares
- Iterative Methods for Solving Factorized Linear Systems
- Randomized Methods for Linear Constraints: Convergence Rates and Conditioning
- An accelerated randomized Kaczmarz algorithm
- Convergence Properties of the Randomized Extended Gauss--Seidel and Kaczmarz Methods
- A Stable and Efficient Algorithm for the Indefinite Linear Least-Squares Problem
- Solving the Indefinite Least Squares Problem by Hyperbolic QR Factorization
- Preasymptotic convergence of randomized Kaczmarz method
- On Greedy Randomized Kaczmarz Method for Solving Large Sparse Linear Systems
- On Adaptive Sketch-and-Project for Solving Linear Systems
- Greed Works: An Improved Analysis of Sampling Kaczmarz--Motzkin
- USSOR method for solving the indefinite least squares problem
- Backward error and condition number analysis for the indefinite linear least squares problem
- Randomized Extended Average Block Kaczmarz for Solving Least Squares
- A structurally backward stable algorithm for solving the indefinite least squares problem with equality constraints
- Faster Randomized Block Kaczmarz Algorithms
- A Sampling Kaczmarz--Motzkin Algorithm for Linear Feasibility
- Rows versus Columns: Randomized Kaczmarz or Gauss--Seidel for Ridge Regression
- The Relaxation Method for Linear Inequalities
- Algebraic properties and perturbation results for the indefinite least squares problem with equality constraints
- Greedy Motzkin–Kaczmarz methods for solving linear systems
This page was built for publication: Splitting-based randomized iterative methods for solving indefinite least squares problem
