A variable-metric variant of the Karmarkar algorithm for linear programming

DOI10.1007/BF02592068zbMath0635.90058MaRDI QIDQ3775323

Kathryn Turner, A. M. Morshedi, John E. jun. Dennis

Publication date: 1987

Published in: Mathematical Programming (Search for Journal in Brave)

zbMATH Keywords

projective algorithmKaramarkar algorithmvariable-metric techniques

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05)

Related Items

Implementing an affine scaling algorithm for linear programming, Varieties with $\mathbb {P}$-units, A variant of Karmarkar's linear programming algorithm for problems in standard form, Asymptotic behaviour of Karmarkar's method for linear programming, A standard form variant, and safeguarded linesearch, for the modified Karmarkar algorithm, A hybrid method for the nonlinear least squares problem with simple bounds, Computational results of an interior point algorithm for large scale linear programming, Automorphism groups of positive entropy on projective threefolds, Compact Kähler manifolds with automorphism groups of maximal rank, On the monodromy of moduli spaces of sheaves on K3 surfaces, El metodo de Karmarkar: Un estudio de sus variantes, Deriving Karmarkar's LP algorithm using angular projection matrix, 𝑛-dimensional projective varieties with the action of an abelian group of rank 𝑛-1, Quasi-Newton approaches to interior point methods for quadratic problems, A note on automorphisms and birational transformations of holomorphic symplectic manifolds, Practical quasi-Newton methods for solving nonlinear systems, Computing projections for the Karmarkar algorithm, A global Weinstein splitting theorem for holomorphic Poisson manifolds, A quadratically convergent method for linear programming, Interior proximal point algorithm for linear programs

Cites Work

• Unnamed Item
• 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
• On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
• An experimental approach to karmarkar’s projective method for linear programming