Pages that link to "Item:Q3780756"
From MaRDI portal
The following pages link to Recovering optimal dual solutions in Karmarkar's polynomial algorithm for linear programming (Q3780756):
Displayed 34 items.
- Computing material collapse displacement fields on a Cray X-MP/48 by the LP primal affine scaling algorithm (Q752020) (← 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 standard form variant, and safeguarded linesearch, for the modified Karmarkar algorithm (Q920840) (← links)
- Exploiting special structure in Karmarkar's linear programming algorithm (Q1106098) (← links)
- A combined phase I-phase II projective algorithm for linear programming (Q1114588) (← 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)
- A polynomial-time algorithm for a class of linear complementarity problems (Q1123139) (← 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)
- 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)
- 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)
- Computing Karmarkar's projections quickly by using matrix factorization (Q1815744) (← links)
- A primal-dual interior-point method for linear programming based on a weighted barrier function (Q1906738) (← links)
- Convergence analysis of the projective scaling algorithm based on a long-step homogeneous affine scaling algorithm (Q1919098) (← links)
- Linear updates for a single-phase projective method (Q2276876) (← links)
- An \(O(n^ 3L)\) primal interior point algorithm for convex quadratic programming (Q2638936) (← links)
- El metodo de Karmarkar: Un estudio de sus variantes (Q3360002) (← links)
- An alternative derivation of the projective interior point method for linear programming through the least squares approach (Q4764596) (← links)
- A new potential reduction algorithm for smooth convex programming (Q4944415) (← links)
- An ADMM-based interior-point method for large-scale linear programming (Q4999335) (← links)