Pages that link to "Item:Q1915913"
From MaRDI portal
The following pages link to A lower bound on the number of iterations of long-step primal-dual linear programming algorithms (Q1915913):
Displaying 5 items.
- Smoothed analysis of condition numbers and complexity implications for linear programming (Q623362) (← links)
- A simpler and tighter redundant Klee-Minty construction (Q941030) (← links)
- An infeasible interior-point algorithm with full-Newton step for linear optimization (Q2464638) (← links)
- How good are interior point methods? Klee-Minty cubes tighten iteration-complexity bounds (Q2476985) (← links)
- The central path visits all the vertices of the Klee–Minty cube (Q3423600) (← links)
