Pages that link to "Item:Q3885509"
From MaRDI portal
The following pages link to The Relaxation Method for Solving Systems of Linear Inequalities (Q3885509):
Displaying 15 items.
- A Data-Independent Distance to Infeasibility for Linear Conic Systems (Q4959838) (← links)
- Greed Works: An Improved Analysis of Sampling Kaczmarz--Motzkin (Q4999361) (← links)
- (Q5110197) (← links)
- Rescaling Algorithms for Linear Conic Feasibility (Q5119854) (← links)
- A THEORY OF COMPLEXITY, CONDITION, AND ROUNDOFF (Q5177339) (← links)
- Linear Convergence of Projection Algorithms (Q5219736) (← links)
- A Sampling Kaczmarz--Motzkin Algorithm for Linear Feasibility (Q5372620) (← links)
- Projection and Rescaling Algorithm for Finding Maximum Support Solutions to Polyhedral Conic Systems (Q5870377) (← links)
- Computational relaxation method for modeling electrostatic systems with non-trivial geometries (Q5889432) (← links)
- A simple polynomial-time rescaling algorithm for solving linear programs (Q5900037) (← links)
- Obtuse cones and Gram matrices with non-negative inverse (Q5947466) (← links)
- Conic version of Loewner-John ellipsoid theorem (Q5962723) (← links)
- A deterministic rescaled perceptron algorithm (Q5962726) (← links)
- A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix (Q6120839) (← links)
- Efficient randomized block Kaczmarz method for linear feasibility (Q6661009) (← links)