Strict monotonicity and improved complexity in the standard form projective algorithm for linear programming
From MaRDI portal
Publication:1319021
DOI10.1007/BF01585181zbMath0795.90038MaRDI QIDQ1319021
Publication date: 12 April 1994
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Linear programming (90C05) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
Analyticity of weighted central paths and error bounds for semidefinite programming ⋮ Todd's low-complexity algorithm is a predictor-corrector path-following method
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A monotonic projective algorithm for fractional linear programming
- A new polynomial-time algorithm for linear programming
- An \(O(n^ 3L)\) potential reduction algorithm for linear programming
- Karmarkar's algorithm with improved steps
- A different convergence proof of the projective method for linear programming
- A strengthened acceptance criterion for approximate projections in Karmarkar's algorithm
- An extension of Karmarkar's algorithm for linear programming using dual variables
- A polynomial Newton method for linear programming
- A polynomial-time algorithm, based on Newton's method, for linear programming
- Conical projection algorithms for linear programming
- Polynomial-time algorithms for linear programming based only on primal scaling and projected gradients of a potential function
- Long steps in an \(O(n^ 3L)\) algorithm for linear programming
- A Centered Projective Algorithm for Linear Programming
- A variant of Karmarkar's linear programming algorithm for problems in standard form
- Recovering optimal dual solutions in Karmarkar's polynomial algorithm for linear programming
- Large Step Path-Following Methods for Linear Programming, Part I: Barrier Function Method
- Large Step Path-Following Methods for Linear Programming, Part II: Potential Reduction Method
- A Family of Search Directions for Karmarkar's Algorithm
- A Path-Following Projective Interior Point Method for Linear Programming
