Pages that link to "Item:Q1290624"
From MaRDI portal
The following pages link to A modified layered-step interior-point algorithm for linear programming (Q1290624):
Displaying 7 items.
- A strong bound on the integral of the central path curvature and its relationship with the iteration-complexity of primal-dual path-following LP algorithms (Q930345) (← links)
- Underlying paths in interior point methods for the monotone semidefinite linear complementarity problem (Q985306) (← links)
- Improved complexity results on solving real-number linear feasibility problems (Q2490340) (← links)
- Log-Barrier Interior Point Methods Are Not Strongly Polynomial (Q4564017) (← links)
- (Q4795355) (← links)
- What Tropical Geometry Tells Us about the Complexity of Linear Programming (Q5150211) (← links)
- A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix (Q6120839) (← links)