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 12 items.
- Smoothed analysis of condition numbers and complexity implications for linear programming (Q623362) (← links)
- A simpler and tighter redundant Klee-Minty construction (Q941030) (← links)
- On lower bound updates in primal potential reduction methods for linear programming (Q1181907) (← links)
- Primal-dual algorithms for linear programming based on the logarithmic barrier method (Q1337204) (← links)
- A lower bound on the average number of pivot-steps for solving linear programs. Valid for all variants of the simplex-algorithm (Q1974584) (← 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)
- Central Path Curvature and Iteration-Complexity for Redundant Klee—Minty Cubes (Q3565464) (← links)
- (Q4288560) (← links)
- Log-Barrier Interior Point Methods Are Not Strongly Polynomial (Q4564017) (← links)
- Simplified<i>O</i>(<i>nL</i>) infeasible interior-point algorithm for linear optimization using full-Newton steps (Q5436917) (← links)
