Pages that link to "Item:Q1200765"
From MaRDI portal
The following pages link to Strict monotonicity in Todd's low-complexity algorithm for linear programming (Q1200765):
Displaying 5 items.
- Strict monotonicity and improved complexity in the standard form projective algorithm for linear programming (Q1319021) (← links)
- Reducing a monotone horizontal LCP to an LCP (Q1346867) (← links)
- Monotonizing linear programs with up to two nonzeroes per column (Q1433661) (← links)
- Some variants of the Todd low-complexity algorithm (Q1904958) (← links)
- A simple variant of the Mizuno-Todd-Ye predictor-corrector algorithm and its objective-function-free complexity (Q2866211) (← links)