Efficient randomized block Kaczmarz method for linear feasibility
From MaRDI portal
Publication:6661009
DOI10.1007/S10092-024-00628-7MaRDI QIDQ6661009FDOQ6661009
Publication date: 10 January 2025
Published in: Calcolo (Search for Journal in Brave)
Randomized algorithms (68W20) Numerical methods for variational inequalities and related problems (65K15)
Cites Work
- Title not available (Why is that?)
- On convergence rates of subgradient optimization methods
- Row-Action Methods for Huge and Sparse Systems and Their Applications
- Bounds for error in the solution set of a perturbed linear program
- Randomized Methods for Linear Constraints: Convergence Rates and Conditioning
- Approximations to Solutions to Systems of Linear Inequalities
- Error bounds for solutions of linear equations and inequalities
- The Relaxation Method for Linear Inequalities
- The Relaxation Method for Linear Inequalities
- A primal-dual projection method for solving systems of linear inequalities
- Decomposition through formalization in a product space
- Paved with good intentions: analysis of a randomized block Kaczmarz method
- Extrapolation algorithm for affine-convex feasibility problems
- Observability in linear systems of equations and inequalities: Applications
- New methods for linear inequalities
- On a relaxation method of solving systems of linear inequalities
- The Relaxation Method for Solving Systems of Linear Inequalities
- Remarks on Perturbations in Linear Inequalities
- On greedy randomized average block Kaczmarz method for solving large linear systems
- Block Kaczmarz method with inequalities
- Recurrent neural networks for solving linear inequalities and equations
- Hoffman's least error bounds for systems of linear inequalities
- On Greedy Randomized Kaczmarz Method for Solving Large Sparse Linear Systems
- On approximate solutions of infinite systems of linear inequalities
- An Algorithm for the Optimal Solution of Linear Inequalities and its Application to Pattern Recognition
- A note on convergence rate of randomized Kaczmarz method
- Randomized Kaczmarz with averaging
- In Appreciation
- On the exact solution of systems of linear inequalities and linear programming problems
- A Sampling Kaczmarz--Motzkin Algorithm for Linear Feasibility
- Stochastic Reformulations of Linear Systems: Algorithms and Convergence Theory
- Faster Randomized Block Kaczmarz Algorithms
- Block sampling Kaczmarz-Motzkin methods for consistent linear systems
- Sampling Kaczmarz-Motzkin method for linear feasibility problems: generalization and acceleration
- Accelerated sampling Kaczmarz Motzkin algorithm for the linear feasibility problem
- Interpreting linear systems of equalities and inequalities. Application to the water supply problem
- Randomized block subsampling Kaczmarz-Motzkin method
This page was built for publication: Efficient randomized block Kaczmarz method for linear feasibility
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6661009)