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):
Displayed 3 items.
- The complexity of self-regular proximity based infeasible IPMs (Q2506182) (← links)
- A Class of Infeasible Interior Point Algorithms for Convex Quadratic Programming (Q3068659) (← links)
- Computational experience with a modified potential reduction algorithm for linear programming (Q5200565) (← links)