Pages that link to "Item:Q1890928"
From MaRDI portal
The following pages link to On polynomiality of the Mehrotra-type predictor-corrector interior-point algorithms (Q1890928):
Displayed 7 items.
- Polynomial time second order mehrotra-type predictor--corrector algorithms (Q864824) (← links)
- Approximate Farkas lemmas and stopping rules for iterative infeasible-point algorithms for linear programming (Q1290596) (← links)
- Improved complexity using higher-order correctors for primal-dual Dikin affine scaling (Q1361107) (← links)
- A new class of polynomial primal-dual methods for linear and semidefinite optimization (Q1848379) (← links)
- A Mehrotra-type predictor-corrector algorithm with polynomiality and \(Q\)-subquadratic convergence (Q1915908) (← links)
- Solving large-scale linear programs by interior-point methods under the Matlab<sup>∗</sup>Environment<sup>†</sup> (Q4227923) (← links)
- User'S guide To Lipsol linear-programming interior point solvers V0.4 (Q4504786) (← links)