Pages that link to "Item:Q1114587"
From MaRDI portal
The following pages link to New trajectory-following polynomial-time algorithm for linear programming problems (Q1114587):
Displayed 5 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)
- A polynomial method of approximate centers for linear programming (Q1196720) (← links)
- An interior-proximal method for convex linearly constrained problems and its extension to variational inequalities (Q1924060) (← links)
- A Polynomial Method of Weighted Centers for Convex Quadratic Programming (Q3976933) (← links)