Pages that link to "Item:Q1117835"
From MaRDI portal
The following pages link to Conical projection algorithms for linear programming (Q1117835):
Displaying 28 items.
- Gradient-type methods: a unified perspective in computer science and numerical analysis (Q420252) (← links)
- On monotonicity in the scaled potential algorithm for linear programming (Q805164) (← links)
- Theoretical efficiency of a shifted-barrier-function algorithm for linear programming (Q806962) (← 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)
- A standard form variant, and safeguarded linesearch, for the modified Karmarkar algorithm (Q920840) (← links)
- Cutting planes and column generation techniques with the projective algorithm (Q1123123) (← links)
- A primal projective interior point method for linear programming (Q1176804) (← links)
- Interior point algorithms for linear programming with inequality constraints (Q1181732) (← links)
- Global convergence of the affine scaling methods for degenerate linear programming problems (Q1181905) (← links)
- On lower bound updates in primal potential reduction methods for linear programming (Q1181907) (← links)
- A combined phase I-phase II scaled potential algorithm for linear programming (Q1181908) (← links)
- A survey of search directions in interior point methods for linear programming (Q1181912) (← links)
- On Anstreicher's combined phase I-phase II projective algorithm for linear programming (Q1194852) (← links)
- Solving combinatorial optimization problems using Karmarkar's algorithm (Q1196181) (← links)
- Long steps in an \(O(n^ 3L)\) algorithm for linear programming (Q1196717) (← links)
- On combined phase 1-phase 2 projective methods for linear programming (Q1207329) (← links)
- Polynomial primal-dual cone affine scaling for semidefinite programming (Q1294555) (← links)
- Strict monotonicity and improved complexity in the standard form projective algorithm for linear programming (Q1319021) (← links)
- Updating lower bounds when using Karmarkar's projective algorithm for linear programming (Q1321368) (← links)
- Interior-point algorithms for semi-infinite programming (Q1334960) (← links)
- Containing and shrinking ellipsoids in the path-following algorithm (Q1813834) (← links)
- Polynomial affine algorithms for linear programming (Q1814590) (← links)
- On motivating the Mitchell-Todd modification of Karmarkar's algorithm for LP problems with free variables (Q1893338) (← links)
- Potential reduction method for harmonically convex programming (Q1893464) (← links)
- An \(O(\sqrt {n} L)\) iteration bound primal-dual cone affine scaling algorithm for linear programming (Q1919092) (← links)
- Convergence analysis of the projective scaling algorithm based on a long-step homogeneous affine scaling algorithm (Q1919098) (← links)
- Search directions for interior linear-programming methods (Q2639771) (← links)
