Pages that link to "Item:Q3976933"
From MaRDI portal
The following pages link to A Polynomial Method of Weighted Centers for Convex Quadratic Programming (Q3976933):
Displayed 4 items.
- On the computation of weighted analytic centers and dual ellipsoids with the projective algorithm (Q688920) (← links)
- A survey of search directions in interior point methods for linear programming (Q1181912) (← links)
- The linear complementarity problem, sufficient matrices, and the criss- cross method (Q1260955) (← links)
- Primal-dual target-following algorithms for linear programming (Q1915912) (← links)