Pages that link to "Item:Q1196717"
From MaRDI portal
The following pages link to Long steps in an \(O(n^ 3L)\) algorithm for linear programming (Q1196717):
Displaying 11 items.
- Convergence behavior of interior-point algorithms (Q689124) (← links)
- Comparative analysis of affine scaling algorithms based on simplifying assumptions (Q1181906) (← links)
- On lower bound updates in primal potential reduction methods for linear programming (Q1181907) (← links)
- A survey of search directions in interior point methods for linear programming (Q1181912) (← links)
- An \(O(n^ 3L)\) adaptive path following algorithm for a linear complementarity problem (Q1181916) (← links)
- A polynomial method of approximate centers for linear programming (Q1196720) (← links)
- On partial updating in a potential reduction linear programming algorithm of Kojima, Mizuno, and Yoshise (Q1206441) (← links)
- An interior point method, based on rank-1 updates, for linear programming (Q1290600) (← links)
- An \(O(n^ 3 L)\) primal-dual potential reduction algorithm for solving convex quadratic programs (Q1315412) (← links)
- Strict monotonicity and improved complexity in the standard form projective algorithm for linear programming (Q1319021) (← links)
- Near boundary behavior of primal-dual potential reduction algorithms for linear programming (Q1803608) (← links)
