Linear programming and the Newton barrier flow
From MaRDI portal
Publication:1111465
DOI10.1007/BF01580774zbMath0657.90059MaRDI QIDQ1111465
Publication date: 1988
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Related Items
Limiting behavior of weighted central paths in linear programming, On the length of primal-dual projection of potential reduction algorithm, Degeneracy in interior point methods for linear programming: A survey, K-K-T multiplier estimates and objective function lower bounds from projective SUMT, A Survey on Analog Models of Computation
Cites Work
- A modification of Karmarkar's linear programming algorithm
- A new polynomial-time algorithm for linear programming
- An algorithm for linear programming which requires \(O(((m+n)n^ 2+(m+n)^{1.5}n)L)\) arithmetic operations
- Introduction: New approaches to linear programming
- A polynomial-time algorithm, based on Newton's method, for linear programming
- On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
- A variation on Karmarkar’s algorithm for solving linear programming problems
- The Nonlinear Geometry of Linear Programming. I Affine and Projective Scaling Trajectories
- The Nonlinear Geometry of Linear Programming. II Legendre Transform Coordinates and Central Trajectories
- Boundary Behavior of Interior Point Algorithms in Linear Programming
