Efficient randomized block Kaczmarz method for linear feasibility
From MaRDI portal
Publication:6661009
Recommendations
- Block Kaczmarz method with inequalities
- Sampling Kaczmarz-Motzkin method for linear feasibility problems: generalization and acceleration
- Accelerated sampling Kaczmarz Motzkin algorithm for the linear feasibility problem
- A sampling Kaczmarz-Motzkin algorithm for linear feasibility
- Randomized Kaczmarz algorithm with averaging and block projection
Cites work
- A note on convergence rate of randomized Kaczmarz method
- A primal-dual projection method for solving systems of linear inequalities
- A sampling Kaczmarz-Motzkin algorithm for linear feasibility
- Accelerated sampling Kaczmarz Motzkin algorithm for the linear feasibility problem
- An Algorithm for the Optimal Solution of Linear Inequalities and its Application to Pattern Recognition
- Approximations to Solutions to Systems of Linear Inequalities
- Block Kaczmarz method with inequalities
- Block sampling Kaczmarz-Motzkin methods for consistent linear systems
- Bounds for error in the solution set of a perturbed linear program
- Decomposition through formalization in a product space
- Error bounds for solutions of linear equations and inequalities
- Extrapolation algorithm for affine-convex feasibility problems
- Faster randomized block Kaczmarz algorithms
- Hoffman's least error bounds for systems of linear inequalities
- In Appreciation
- Interpreting linear systems of equalities and inequalities. Application to the water supply problem
- New methods for linear inequalities
- Observability in linear systems of equations and inequalities: Applications
- On a relaxation method of solving systems of linear inequalities
- On approximate solutions of infinite systems of linear inequalities
- On convergence rates of subgradient optimization methods
- On greedy randomized Kaczmarz method for solving large sparse linear systems
- On greedy randomized average block Kaczmarz method for solving large linear systems
- On the exact solution of systems of linear inequalities and linear programming problems
- Optimization models
- Paved with good intentions: analysis of a randomized block Kaczmarz method
- Randomized Kaczmarz with averaging
- Randomized block subsampling Kaczmarz-Motzkin method
- Randomized methods for linear constraints: convergence rates and conditioning
- Recurrent neural networks for solving linear inequalities and equations
- Remarks on Perturbations in Linear Inequalities
- Row-Action Methods for Huge and Sparse Systems and Their Applications
- Sampling Kaczmarz-Motzkin method for linear feasibility problems: generalization and acceleration
- Stochastic reformulations of linear systems: algorithms and convergence theory
- The Relaxation Method for Linear Inequalities
- The Relaxation Method for Linear Inequalities
- The Relaxation Method for Solving Systems of Linear Inequalities
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)
