Recovering optimal dual solutions in Karmarkar's polynomial algorithm for linear programming
From MaRDI portal
Publication:3780756
DOI10.1007/BF02592079zbMath0639.90062OpenAlexW2076658620MaRDI QIDQ3780756
Publication date: 1987
Published in: Mathematical Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02592079
Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Linear programming (90C05)
Related Items
Interior-point algorithms for semi-infinite programming, An \(O(n^ 3L)\) primal interior point algorithm for convex quadratic programming, Exploiting special structure in Karmarkar's linear programming algorithm, A primal-dual interior-point method for linear programming based on a weighted barrier function, A combined phase I-phase II projective algorithm for linear programming, An extension of Karmarkar's projective algorithm for convex quadratic programming, Convergence analysis of the projective scaling algorithm based on a long-step homogeneous affine scaling algorithm, Cutting planes and column generation techniques with the projective algorithm, A polynomial-time algorithm for a class of linear complementarity problems, A ``build-down scheme for linear programming, A standard form variant, and safeguarded linesearch, for the modified Karmarkar algorithm, An optimal-basis identification technique for interior-point linear programming algorithms, An \(O(\sqrt n L)\) iteration potential reduction algorithm for linear complementarity problems, On lower bound updates in primal potential reduction methods for linear programming, A combined phase I-phase II scaled potential algorithm for linear programming, A survey of search directions in interior point methods for linear programming, On Anstreicher's combined phase I-phase II projective algorithm for linear programming, Solving combinatorial optimization problems using Karmarkar's algorithm, Long steps in an \(O(n^ 3L)\) algorithm for linear programming, On combined phase 1-phase 2 projective methods for linear programming, Linear updates for a single-phase projective method, A new potential reduction algorithm for smooth convex programming, El metodo de Karmarkar: Un estudio de sus variantes, Computing material collapse displacement fields on a Cray X-MP/48 by the LP primal affine scaling algorithm, Computing Karmarkar's projections quickly by using matrix factorization, An ADMM-based interior-point method for large-scale linear programming, Degeneracy in interior point methods for linear programming: A survey, On monotonicity in the scaled potential algorithm for linear programming, An alternative derivation of the projective interior point method for linear programming through the least squares approach, Theoretical efficiency of a shifted-barrier-function algorithm for linear programming, The affine-scaling direction for linear programming is a limit of projective-scaling directions, Strict monotonicity and improved complexity in the standard form projective algorithm for linear programming, An \(O(n^ 3L)\) potential reduction algorithm for linear programming, Updating lower bounds when using Karmarkar's projective algorithm for linear programming
Cites Work
- A monotonic projective algorithm for fractional linear programming
- A modification of Karmarkar's linear programming algorithm
- A new polynomial-time algorithm for linear programming
- An algorithm for linear programming which requires \(O(((m+n)n^ 2+(m+n)^{1.5}n)L)\) arithmetic operations
- An extension of Karmarkar's algorithm for linear programming using dual variables
- A multiplicative barrier function method for linear programming
- A polynomial-time algorithm, based on Newton's method, for linear programming
- On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
- A variant of Karmarkar's linear programming algorithm for problems in standard form
