Pages that link to "Item:Q3818123"
From MaRDI portal
The following pages link to Improved Bounds and Containing Ellipsoids in Karmarkar's Linear Programming Algorithm (Q3818123):
Displayed 18 items.
- Global ellipsoidal approximations and homotopy methods for solving convex analytic programs (Q583119) (← links)
- On the finite convergence of interior-point algorithms for linear programming (Q687096) (← links)
- On the computation of weighted analytic centers and dual ellipsoids with the projective algorithm (Q688920) (← links)
- The affine-scaling direction for linear programming is a limit of projective-scaling directions (Q806963) (← links)
- A ``build-down'' scheme for linear programming (Q912758) (← links)
- Exploiting special structure in Karmarkar's linear programming algorithm (Q1106098) (← links)
- Eliminating columns in the simplex method for linear programming (Q1113797) (← links)
- An optimal-basis identification technique for interior-point linear programming algorithms (Q1174842) (← links)
- On combined phase 1-phase 2 projective methods for linear programming (Q1207329) (← links)
- Primal-dual-infeasible Newton approach for the analytic center deep-cutting plane method (Q1293951) (← links)
- Degeneracy in interior point methods for linear programming: A survey (Q1312753) (← links)
- Updating lower bounds when using Karmarkar's projective algorithm for linear programming (Q1321368) (← links)
- On solution-containing ellipsoids in linear programming (Q1321453) (← links)
- On improved Choi-Goldfarb solution-containing ellipsoids in linear programming (Q1591595) (← links)
- Containing and shrinking ellipsoids in the path-following algorithm (Q1813834) (← links)
- Linear updates for a single-phase projective method (Q2276876) (← links)
- Ellipsoids that contain all the solutions of a positive semi-definite linear complementarity problem (Q2276889) (← links)
- A direct ellipsoid method for linear programming (Q4287866) (← links)