A primal projective interior point method for linear programming
From MaRDI portal
Publication:1176804
DOI10.1007/BF01586924zbMATH Open0741.90046MaRDI QIDQ1176804FDOQ1176804
Authors: Donald Goldfarb, Dong Xiao 
Publication date: 25 June 1992
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Recommendations
- A new polynomial-time algorithm for linear programming
- New trajectory-following polynomial-time algorithm for linear programming problems
- On the finite convergence of interior-point algorithms for linear programming
- A primal-dual infeasible-interior-point algorithm for linear programming
- A Centered Projective Algorithm for Linear Programming
Linear programming (90C05) Fractional programming (90C32) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Cites Work
- A new polynomial-time algorithm for linear programming
- Interior path following primal-dual algorithms. I: Linear programming
- Conical projection algorithms for linear programming
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A variation on Karmarkar’s algorithm for solving linear programming problems
- An extension of Karmarkar's algorithm for linear programming using dual variables
- A monotonic projective algorithm for fractional linear programming
- A modification of Karmarkar's linear programming algorithm
- A different convergence proof of the projective method for linear programming
- A Self-Correcting Version of Karmarkar’s Algorithm
Cited In (11)
- An \(O(\sqrt {n} L)\) iteration bound primal-dual cone affine scaling algorithm for linear programming
- Title not available (Why is that?)
- New trajectory-following polynomial-time algorithm for linear programming problems
- A circular cone relaxation primal interior point algorithm for LP
- PCx: an interior-point code for linear programming
- Projected orthogonal vectors in two-dimensional search interior point algorithms for linear programming
- An experimental approach to karmarkar’s projective method for linear programming
- Polynomial primal-dual cone affine scaling for semidefinite programming
- On interior algorithms for linear programming with no regularity assumptions
- A fifth bibliography of fractional programming*
- Title not available (Why is that?)
This page was built for publication: A primal projective interior point method for linear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1176804)
