A unified view of interior point methods for linear programming
From MaRDI portal
Publication:803041
DOI10.1007/BF02023048zbMATH Open0726.90049MaRDI QIDQ803041FDOQ803041
Authors: Ansuman Bagchi, David F. Shanno 
Publication date: 1990
Published in: Annals of Operations Research (Search for Journal in Brave)
Recommendations
Linear programming (90C05) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Cites Work
- On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
- A new polynomial-time algorithm for linear programming
- Title not available (Why is that?)
- A polynomial-time algorithm, based on Newton's method, for linear programming
- Title not available (Why is that?)
- An Implementation of a Primal-Dual Interior Point Method for Linear Programming
- Interior path following primal-dual algorithms. I: Linear programming
- An implementation of Karmarkar's algorithm for linear programming
- Title not available (Why is that?)
- Boundary Behavior of Interior Point Algorithms in Linear Programming
- A variation on Karmarkar’s algorithm for solving linear programming problems
- An extension of Karmarkar's algorithm for linear programming using dual variables
- A multiplicative barrier function method for linear programming
- A modification of Karmarkar's linear programming algorithm
- Introduction: New approaches to linear programming
- Search directions for interior linear-programming methods
- A variant of Karmarkar's linear programming algorithm for problems in standard form
Cited In (14)
- On the equivalence of the simplex methods and a multiplier-alike method for linear programming
- Integrability of vector and multivector fields associated with interior point methods for linear programming
- Unified complexity analysis for Newton LP methods
- A polynomial method of approximate centers for linear programming
- Four Good Reasons to Use an Interior Point Solver Within a MIP Solver
- A unified approach to interior point algorithms for linear complementary problems
- A robust and efficient proposal for solving linear systems arising in interior-point methods for linear programming
- Piecewise linear programming via interior points
- Title not available (Why is that?)
- Title not available (Why is that?)
- A branch bound method for subset sum problem
- Title not available (Why is that?)
- Efficient solution of two-stage stochastic linear programs using interior point methods
- On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
This page was built for publication: A unified view of interior point methods for linear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q803041)
