A standard form variant, and safeguarded linesearch, for the modified Karmarkar algorithm

DOI10.1007/BF01580868zbMath0708.90046MaRDI QIDQ920840

Kurt M. Anstreicher

Publication date: 1990

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

zbMATH Keywords

line searchmodified Karmarkar algorithmsufficient decrease criterion

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Abstract computational complexity for mathematical programming problems (90C60) Linear programming (90C05)

Related Items

Polynomial-time algorithms for linear programming based only on primal scaling and projected gradients of a potential function, A survey of search directions in interior point methods for linear programming, Long steps in an \(O(n^ 3L)\) algorithm for linear programming, On partial updating in a potential reduction linear programming algorithm of Kojima, Mizuno, and Yoshise, An interior point method, based on rank-1 updates, for linear programming, An infeasible-start framework for convex quadratic optimization, with application to constraint-reduced interior-point and other methods

Cites Work

• Unnamed Item
• A monotonic projective algorithm for fractional linear programming
• A new polynomial-time algorithm for linear programming
• Karmarkar's algorithm with improved steps
• A strengthened acceptance criterion for approximate projections in Karmarkar's algorithm
• An extension of Karmarkar's algorithm for linear programming using dual variables
• Computing Karmarkar projections quickly
• Conical projection algorithms for linear programming
• A variant of Karmarkar's linear programming algorithm for problems in standard form
• A variable-metric variant of the Karmarkar algorithm for linear programming
• Recovering optimal dual solutions in Karmarkar's polynomial algorithm for linear programming