Pages that link to "Item:Q1915903"
From MaRDI portal
The following pages link to Basic lemmas in polynomial-time infeasible-interior-point methods for linear programs (Q1915903):
Displaying 7 items.
- Two new predictor-corrector algorithms for second-order cone programming (Q536560) (← links)
- Approximate Farkas lemmas and stopping rules for iterative infeasible-point algorithms for linear programming (Q1290596) (← links)
- A predictor-corrector infeasible-interior-point algorithm for linear programming (Q1342276) (← links)
- An arc-search \({\mathcal {O}}(nL)\) infeasible-interior-point algorithm for linear programming (Q1653277) (← links)
- An infeasible-interior-point algorithm using projections onto a convex set (Q1915905) (← links)
- Two computationally efficient polynomial-iteration infeasible interior-point algorithms for linear programming (Q1989949) (← links)
- The complexity of self-regular proximity based infeasible IPMs (Q2506182) (← links)
