A unified view of interior point methods for linear programming

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)

zbMATH Keywords

interior point methodsprojective methodsaffine methodslogarithmic barrier methodmethod of centers

Mathematics Subject Classification ID

Linear programming (90C05) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Recommendations

• scientific article; zbMATH DE number 223544
• Insights into the interior-point methods
• An interior point method for linear programming
• scientific article; zbMATH DE number 946715
• Primal-dual methods for linear programming

Cites work

• scientific article; zbMATH DE number 4164543 (Why is no real title available?)
• scientific article; zbMATH DE number 3301975 (Why is no real title available?)
• scientific article; zbMATH DE number 3307153 (Why is no real title available?)
• A modification of Karmarkar's linear programming algorithm
• A multiplicative barrier function method for linear programming
• A new polynomial-time algorithm for linear programming
• A polynomial-time algorithm, based on Newton's method, for linear programming
• A variant of Karmarkar's linear programming algorithm for problems in standard form
• A variation on Karmarkar’s algorithm for solving linear programming problems
• An Implementation of a Primal-Dual Interior Point Method for Linear Programming
• An extension of Karmarkar's algorithm for linear programming using dual variables
• An implementation of Karmarkar's algorithm for linear programming
• Boundary Behavior of Interior Point Algorithms in Linear Programming
• Interior path following primal-dual algorithms. I: Linear programming
• Introduction: New approaches to linear programming
• On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
• Search directions for interior linear-programming methods

Cited in

(14)

• On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
• 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
• scientific article; zbMATH DE number 4097127 (Why is no real title available?)
• scientific article; zbMATH DE number 946715 (Why is no real title available?)
• Efficient solution of two-stage stochastic linear programs using interior point methods
• Piecewise linear programming via interior points
• On the equivalence of the simplex methods and a multiplier-alike method for linear programming
• Four Good Reasons to Use an Interior Point Solver Within a MIP Solver
• Integrability of vector and multivector fields associated with interior point methods for linear programming
• Unified complexity analysis for Newton LP methods
• scientific article; zbMATH DE number 4185410 (Why is no real title available?)
• A branch bound method for subset sum problem
• A polynomial method of approximate centers for linear programming

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)