Pages that link to "Item:Q3989817"
From MaRDI portal
The following pages link to A Method for the Parametric Center Problem, with a Strictly Monotone Polynomial-Time Algorithm for Linear Programming (Q3989817):
Displaying 4 items.
- A scaling technique for finding the weighted analytic center of a polytope (Q687084) (← links)
- Theoretical efficiency of a shifted-barrier-function algorithm for linear programming (Q806962) (← links)
- A cutting plane algorithm for convex programming that uses analytic centers (Q1922689) (← links)
- Projective transformations for interior-point algorithms, and a superlinearly convergent algorithm for the w-center problem (Q2367917) (← links)
