Some variants of the Todd low-complexity algorithm

DOI10.1007/BF02193465zbMath0842.90083OpenAlexW2054387754MaRDI QIDQ1904958

Yanyan Li

Publication date: 6 August 1996

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02193465

zbMATH Keywords

interior-point algorithmpotential function

Mathematics Subject Classification ID

Linear programming (90C05)

Uses Software

• Matlab

Cites Work

• Unnamed Item
• A modification of Karmarkar's linear programming algorithm
• A new polynomial-time algorithm for linear programming
• An \(O(n^ 3L)\) potential reduction algorithm for linear programming
• 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
• Strict monotonicity in Todd's low-complexity algorithm for linear programming
• A variation on Karmarkar’s algorithm for solving linear programming problems
• Large Step Path-Following Methods for Linear Programming, Part II: Potential Reduction Method
• A Low Complexity Interior-Point Algorithm for Linear Programming