Pages that link to "Item:Q2962562"
From MaRDI portal
The following pages link to On Chubanov's Method for Linear Programming (Q2962562):
Displaying 8 items.
- A strongly polynomial-time algorithm for the strict homogeneous linear-inequality feasibility problem (Q486939) (← links)
- A polynomial projection-type algorithm for linear programming (Q1667181) (← links)
- Solving conic systems via projection and rescaling (Q1683682) (← links)
- A comparative note on the relaxation algorithms for the linear semi-infinite feasibility problem (Q1686516) (← links)
- Sampling Kaczmarz-Motzkin method for linear feasibility problems: generalization and acceleration (Q2149567) (← links)
- Rescaled Coordinate Descent Methods for Linear Programming (Q3186489) (← links)
- A Computational Framework for Solving Nonlinear Binary Optimization Problems in Robust Causal Inference (Q5060782) (← links)
- Rescaling Algorithms for Linear Conic Feasibility (Q5119854) (← links)