Pages that link to "Item:Q1589768"
From MaRDI portal
The following pages link to Average number of iterations of some polynomial interior-point -- algorithms for linear programming (Q1589768):
Displaying 7 items.
- Average case complexity results for a centering algorithm for linear programming problems under Gaussian distributions (Q1002052) (← links)
- An algorithm that is polynomial on the average in integer linear programming (Q1363304) (← links)
- On the probabilistic complexity of finding an approximate solution for linear programming (Q2483208) (← links)
- Probabilistic analysis of an infeasible-interior-point algorithm for linear programming (Q2757589) (← links)
- \(O(m)\) bound on number of iterations in sphere methods for LP (Q2865879) (← links)
- (Q4288560) (← links)
- Toward Probabilistic Analysis of Interior-Point Algorithms for Linear Programming (Q4294728) (← links)