Pages that link to "Item:Q1667181"
From MaRDI portal
The following pages link to A polynomial projection-type algorithm for linear programming (Q1667181):
Displaying 9 items.
- Relaxation, new combinatorial and polynomial algorithms for the linear feasibility problem (Q705124) (← links)
- A polynomial projection algorithm for linear feasibility problems (Q747780) (← links)
- A simple projection algorithm for linear programming problems (Q1755785) (← links)
- A relaxed primal-dual path-following algorithm for linear programming (Q1915911) (← links)
- Sampling Kaczmarz-Motzkin method for linear feasibility problems: generalization and acceleration (Q2149567) (← links)
- (Q3050157) (← links)
- Rescaled Coordinate Descent Methods for Linear Programming (Q3186489) (← links)
- Rescaling Algorithms for Linear Conic Feasibility (Q5119854) (← links)
- A Sampling Kaczmarz--Motzkin Algorithm for Linear Feasibility (Q5372620) (← links)