Primal-dual methods for linear programming
type: Item
instance of: scholarly article
title: Primal-dual methods for linear programming
zbMATH Open document ID: 0855.90081
DOI: 10.1007/BF01585940
author: Philip E. Gill
author: Walter Murray
author: Dulce B. Ponceleón
author: Michael A. Saunders
published in: Mathematical Programming. Series A. Series B
publication date: 1997-02-03T00:00:00Z
Mathematics Subject Classification ID: 90C05
zbMATH DE Number: 934389
zbMATH Keywords: interior-point methods
zbMATH Keywords: logarithmic barrier function
MaRDI profile type: Publication
cites work: A Study of Indicators for Identifying Zero Variables in Interior-Point Methods
cites work: Q5588268
cites work: Q4288553
cites work: On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
cites work: Path-Following Methods for Linear Programming
cites work: Theoretical convergence of large-step primal-dual interior point algorithms for linear programming
cites work: Q3491304
cites work: Feasibility issues in a primal-dual interior-point method for linear programming
cites work: Computational experience with a primal-dual interior point method for linear programming
cites work: On Implementing Mehrotra’s Predictor–Corrector Interior-Point Method for Linear Programming
cites work: An Implementation of a Primal-Dual Interior Point Method for Linear Programming
cites work: Q4206561
cites work: On the Implementation of a Primal-Dual Interior Point Method
cites work: Interior path following primal-dual algorithms. I: Linear programming
cites work: Q5652137
cites work: Q4016509
full work available at URL: https://doi.org/10.1007/bf01585940
OpenAlex ID: W2170451819
description: scientific article; zbMATH DE number 934389