Pages that link to "Item:Q1961981"
From MaRDI portal
The following pages link to An infeasible-interior-point potential-reduction algorithm for linear programming (Q1961981):
Displaying 9 items.
- An \(O(n^ 3L)\) potential reduction algorithm for linear programming (Q811360) (← links)
- A potential-function reduction algorithm for solving a linear program directly from an infeasible ``warm start'' (Q1181909) (← links)
- Potential-reduction methods in mathematical programming (Q1361104) (← links)
- On the worst case complexity of potential reduction algorithms for linear programming (Q1373761) (← links)
- A constant-potential infeasible-start interior-point algorithm with computational experiments and applications (Q1383829) (← links)
- The complexity of self-regular proximity based infeasible IPMs (Q2506182) (← links)
- A Class of Infeasible Interior Point Algorithms for Convex Quadratic Programming (Q3068659) (← links)
- Infeasible-Interior-Point Primal-Dual Potential-Reduction Algorithms for Linear Programming (Q4764308) (← links)
- Computational experience with a modified potential reduction algorithm for linear programming (Q5200565) (← links)