Pages that link to "Item:Q1321670"
From MaRDI portal
The following pages link to On the number of iterations of Karmarkar's algorithm for linear programming (Q1321670):
Displaying 4 items.
- Interior-point algorithms for semi-infinite programming (Q1334960) (← links)
- Potential-reduction methods in mathematical programming (Q1361104) (← links)
- A lower bound on the number of iterations of long-step primal-dual linear programming algorithms (Q1915913) (← links)
- Log-Barrier Interior Point Methods Are Not Strongly Polynomial (Q4564017) (← links)
