A circular cone relaxation primal interior point algorithm for LP

DOI10.1080/02331930310001611475zbMath1098.90090OpenAlexW2016618607MaRDI QIDQ4467177

Igor S. Litvinchev

Publication date: 9 June 2004

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331930310001611475

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Interior-point methods (90C51)

Cites Work

• A new polynomial-time algorithm for linear programming
• A different convergence proof of the projective method for linear programming
• A primal projective interior point method for linear programming
• A polynomial method of approximate centers for linear programming
• An \(O(\sqrt {n} L)\) iteration bound primal-dual cone affine scaling algorithm for linear programming
• A variation on Karmarkar’s algorithm for solving linear programming problems
• A new variant of the primal affine scaling algorithm for linear programs
• Path-Following Methods for Linear Programming
• A Low Complexity Interior-Point Algorithm for Linear Programming
• On a Wide Region of Centers and Primal-Dual Interior Point Algorithms for Linear Programming

This page was built for publication: A circular cone relaxation primal interior point algorithm for LP