Pages that link to "Item:Q1090601"
From MaRDI portal
The following pages link to An extension of Karmarkar's algorithm for linear programming using dual variables (Q1090601):
Displaying 50 items.
- The steepest descent gravitational method for linear programming (Q583105) (← links)
- On the computation of weighted analytic centers and dual ellipsoids with the projective algorithm (Q688920) (← links)
- A unified view of interior point methods for linear programming (Q803041) (← links)
- Theoretical efficiency of a shifted-barrier-function algorithm for linear programming (Q806962) (← links)
- Computing projections for the Karmarkar algorithm (Q806966) (← links)
- An \(O(n^ 3L)\) potential reduction algorithm for linear programming (Q811360) (← links)
- Karmarkar's algorithm with improved steps (Q910334) (← links)
- Asymptotic behaviour of Karmarkar's method for linear programming (Q911987) (← links)
- A ``build-down'' scheme for linear programming (Q912758) (← links)
- On the improvement per iteration in Karmarkar's algorithm for linear programming (Q918862) (← links)
- A standard form variant, and safeguarded linesearch, for the modified Karmarkar algorithm (Q920840) (← links)
- Extension of a projective interior point method for linearly constrained convex programming (Q990634) (← links)
- Introduction: New approaches to linear programming (Q1088596) (← links)
- A strengthened acceptance criterion for approximate projections in Karmarkar's algorithm (Q1089251) (← links)
- A polynomial Newton method for linear programming (Q1094330) (← links)
- Karmarkar's algorithm and the ellipsoid method (Q1095025) (← links)
- Convergence results and numerical experiments on a linear programming hybrid algorithm (Q1095026) (← links)
- Implementing an affine scaling algorithm for linear programming (Q1097168) (← 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)
- On the convexity of the multiplicative version of Karmarkar's potential function (Q1111466) (← links)
- New trajectory-following polynomial-time algorithm for linear programming problems (Q1114587) (← links)
- A combined phase I-phase II projective algorithm for linear programming (Q1114588) (← links)
- Conical projection algorithms for linear programming (Q1117835) (← links)
- An extension of Karmarkar's projective algorithm for convex quadratic programming (Q1121792) (← links)
- Cutting planes and column generation techniques with the projective algorithm (Q1123123) (← links)
- An optimal-basis identification technique for interior-point linear programming algorithms (Q1174842) (← links)
- An \(O(\sqrt n L)\) iteration potential reduction algorithm for linear complementarity problems (Q1176569) (← links)
- A primal projective interior point method for linear programming (Q1176804) (← links)
- Polynomial-time algorithms for linear programming based only on primal scaling and projected gradients of a potential function (Q1177228) (← links)
- Interior point algorithms for linear programming with inequality constraints (Q1181732) (← 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 potential-function reduction algorithm for solving a linear program directly from an infeasible ``warm start'' (Q1181909) (← links)
- Solving combinatorial optimization problems using Karmarkar's algorithm (Q1196181) (← links)
- A polynomial method of approximate centers for linear programming (Q1196720) (← links)
- Generalization of Karmarkar's algorithm to convex homogeneous functions (Q1197885) (← links)
- Generalized convexity on affine subspaces with an application to potential functions (Q1199752) (← links)
- A projective algorithm for linear programming with no regularity condition (Q1200753) (← links)
- Recurrent neural networks for linear programming: Analysis and design principles (Q1200825) (← 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)
- On the number of iterations of Karmarkar's algorithm for linear programming (Q1321670) (← links)
- Interior-point algorithms for semi-infinite programming (Q1334960) (← links)
- Potential-reduction methods in mathematical programming (Q1361104) (← links)
