Pages that link to "Item:Q3929533"
From MaRDI portal
The following pages link to On the non-polynomiality of the relaxation method for systems of linear inequalities (Q3929533):
Displaying 11 items.
- Solving the general quadratic programming problem in a finite number of steps (Q382174) (← links)
- A strongly polynomial-time algorithm for the strict homogeneous linear-inequality feasibility problem (Q486939) (← links)
- A polynomial projection algorithm for linear feasibility problems (Q747780) (← links)
- Projection algorithms for linear programming (Q1199509) (← links)
- Convergence criteria for generalized gradient methods of solving locally Lipschitz feasibility problems (Q1803652) (← links)
- A projection method for least-squares solutions to overdetermined systems of linear inequalities (Q1821512) (← links)
- Locally polynomial method for solving systems of linear inequalities (Q2206481) (← links)
- A polynomial algorithm for convex quadratic optimization subject to linear inequalities (Q2297665) (← links)
- On Chubanov's Method for Linear Programming (Q2962562) (← links)
- Convergence of the cyclical relaxation method for linear inequalities (Q3337217) (← links)
- Comments on: Recent progress on the combinatorial diameter of polytopes and simplicial complexes (Q5965568) (← links)
