Pages that link to "Item:Q805163"
From MaRDI portal
The following pages link to O(n\({}^ pL)\)-iteration and \(O(n^ 3L)\)-operation potential reduction algorithms for linear programming (Q805163):
Displaying 10 items.
- On monotonicity in the scaled potential algorithm for linear programming (Q805164) (← links)
- A potential-reduction variant of Renegar's short-step path-following method for linear programming (Q811094) (← links)
- An \(O(n^ 3L)\) potential reduction algorithm for linear programming (Q811360) (← links)
- Polynomial-time algorithms for linear programming based only on primal scaling and projected gradients of a potential function (Q1177228) (← links)
- An \(O(n^ 3L)\) adaptive path following algorithm for a linear complementarity problem (Q1181916) (← links)
- Long steps in an \(O(n^ 3L)\) algorithm for linear programming (Q1196717) (← links)
- An interior point method, based on rank-1 updates, for linear programming (Q1290600) (← links)
- Extensions of the potential reduction algorithm for linear programming (Q1336068) (← links)
- Potential-reduction methods in mathematical programming (Q1361104) (← links)
- Polynomiality of primal-dual affine scaling algorithms for nonlinear complementarity problems (Q1366422) (← links)
