A variant of Karmarkar's linear programming algorithm for problems in standard form
From MaRDI portal
Publication:3767120
DOI10.1007/BF02591685zbMath0629.90056OpenAlexW4230009129MaRDI QIDQ3767120
Publication date: 1987
Published in: Mathematical Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02591685
Related Items
Interior-point algorithms for semi-infinite programming, Projective transformations for interior-point algorithms, and a superlinearly convergent algorithm for the w-center problem, Combining phase I and phase II in a potential reduction algorithm for linear programming, Karmarkar's algorithm and the ellipsoid method, Convergence results and numerical experiments on a linear programming hybrid algorithm, Search directions for interior linear-programming methods, A sequential quadratic programming method for potentially infeasible mathematical programs, Relaxed variants of Karmarkar's algorithm for linear programs with unknown optimal objective value, Exploiting special structure in Karmarkar's linear programming algorithm, An analog of Karmarkar's algorithm for inequality constrained liner programs, with a `new' class of projective transformations for centering a polytope, Computing Karmarkar projections quickly, A relaxed version of Karmarkar's method, A combined phase I-phase II projective algorithm for linear programming, Conical projection algorithms for linear 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, Recovering optimal dual solutions in Karmarkar's polynomial algorithm for linear programming, A ``build-down scheme for linear programming, A survey of dynamic network flows, A standard form variant, and safeguarded linesearch, for the modified Karmarkar algorithm, An \(O(\sqrt n L)\) iteration potential reduction algorithm for linear complementarity problems, Polynomial-time algorithms for linear programming based only on primal scaling and projected gradients of a potential function, 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, El metodo de Karmarkar: Un estudio de sus variantes, A unified view of interior point methods for linear programming, Degeneracy in interior point methods for linear programming: A survey, On monotonicity in the scaled potential algorithm for linear programming, On the symmetric affiine scaling algorithm for line programming*, 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 new polynomial-time algorithm for linear programming
- An extension of Karmarkar's algorithm for linear programming using dual variables
- A relaxed version of Karmarkar's method
- An experimental approach to karmarkar’s projective method for linear programming
- A variable-metric variant of the Karmarkar algorithm for linear programming
