Pages that link to "Item:Q3767120"
From MaRDI portal
The following pages link to A variant of Karmarkar's linear programming algorithm for problems in standard form (Q3767120):
Displayed 39 items.
- A unified view of interior point methods for linear programming (Q803041) (← 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)
- An \(O(n^ 3L)\) potential reduction algorithm for linear programming (Q811360) (← links)
- A ``build-down'' scheme for linear programming (Q912758) (← links)
- A survey of dynamic network flows (Q917417) (← links)
- A standard form variant, and safeguarded linesearch, for the modified Karmarkar algorithm (Q920840) (← links)
- Karmarkar's algorithm and the ellipsoid method (Q1095025) (← links)
- Convergence results and numerical experiments on a linear programming hybrid algorithm (Q1095026) (← links)
- Relaxed variants of Karmarkar's algorithm for linear programs with unknown optimal objective value (Q1103522) (← links)
- Exploiting special structure in Karmarkar's linear programming algorithm (Q1106098) (← links)
- An analog of Karmarkar's algorithm for inequality constrained liner programs, with a `new' class of projective transformations for centering a polytope (Q1106099) (← links)
- Computing Karmarkar projections quickly (Q1107438) (← links)
- A relaxed version of Karmarkar's method (Q1108926) (← links)
- A combined phase I-phase II projective algorithm for linear programming (Q1114588) (← links)
- Conical projection algorithms for linear programming (Q1117835) (← links)
- Cutting planes and column generation techniques with the projective algorithm (Q1123123) (← links)
- A polynomial-time algorithm for a class of linear complementarity problems (Q1123139) (← links)
- An \(O(\sqrt n L)\) iteration potential reduction algorithm for linear complementarity problems (Q1176569) (← links)
- Polynomial-time algorithms for linear programming based only on primal scaling and projected gradients of a potential function (Q1177228) (← 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)
- Degeneracy in interior point methods for linear programming: A survey (Q1312753) (← 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)
- Convergence analysis of the projective scaling algorithm based on a long-step homogeneous affine scaling algorithm (Q1919098) (← links)
- Projective transformations for interior-point algorithms, and a superlinearly convergent algorithm for the w-center problem (Q2367917) (← links)
- Combining phase I and phase II in a potential reduction algorithm for linear programming (Q2368075) (← links)
- Search directions for interior linear-programming methods (Q2639771) (← links)
- A sequential quadratic programming method for potentially infeasible mathematical programs (Q2640450) (← links)
- El metodo de Karmarkar: Un estudio de sus variantes (Q3360002) (← links)
- Recovering optimal dual solutions in Karmarkar's polynomial algorithm for linear programming (Q3780756) (← links)
- On the symmetric affiine scaling algorithm for line programming<sup>*</sup> (Q4764582) (← links)