The following pages link to (Q2743961):
Displayed 5 items.
- Average number of iterations of some polynomial interior-point -- algorithms for linear programming (Q1589768) (← links)
- Interior-point methods (Q1593831) (← links)
- Interior-point methods: Worst case and average case analysis of a phase-I algorithm and a termination procedure. (Q1872636) (← links)
- A lower bound on the number of iterations of long-step primal-dual linear programming algorithms (Q1915913) (← links)
- On the probabilistic complexity of finding an approximate solution for linear programming (Q2483208) (← links)