Pages that link to "Item:Q1319021"
From MaRDI portal
The following pages link to Strict monotonicity and improved complexity in the standard form projective algorithm for linear programming (Q1319021):
Displaying 5 items.
- Analyticity of weighted central paths and error bounds for semidefinite programming (Q948959) (← links)
- Todd's low-complexity algorithm is a predictor-corrector path-following method (Q1197903) (← links)
- Strict monotonicity in Todd's low-complexity algorithm for linear programming (Q1200765) (← links)
- New projection-type methods for monotone LCP with finite termination (Q1614999) (← links)
- Strict Fejér monotonicity by superiorization of feasibility-seeking projection methods (Q2346394) (← links)