Primal-dual methods for linear programming

DOI10.1007/BF01585940zbMath0855.90081OpenAlexW2170451819MaRDI QIDQ1924065

Walter Murray, Philip E. Gill, Dulce B. Ponceleón, Michael A. Saunders

Publication date: 3 February 1997

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01585940

zbMATH Keywords

interior-point methodslogarithmic barrier function

Mathematics Subject Classification ID

Linear programming (90C05)

Related Items (2)

The convergence of an interior-point method using modified search directions in final iterations ⋮ LOQO:an interior point code for quadratic programming

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Feasibility issues in a primal-dual interior-point method for linear programming
• Computational experience with a primal-dual interior point method for linear programming
• Interior path following primal-dual algorithms. I: Linear programming
• Theoretical convergence of large-step primal-dual interior point algorithms for linear programming
• On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
• On the Implementation of a Primal-Dual Interior Point Method
• Path-Following Methods for Linear Programming
• On Implementing Mehrotra’s Predictor–Corrector Interior-Point Method for Linear Programming
• An Implementation of a Primal-Dual Interior Point Method for Linear Programming
• A Study of Indicators for Identifying Zero Variables in Interior-Point Methods

This page was built for publication: Primal-dual methods for linear programming