A build-up variant of the logarithmic barrier method for LP
type: Item
instance of: scholarly article
title: A build-up variant of the logarithmic barrier method for LP
zbMATH Open document ID: 0757.90052
DOI: 10.1016/0167-6377(92)90104-B
published in: Operations Research Letters
publication date: 1993-01-16T00:00:00Z
Mathematics Subject Classification ID: 90C05
Mathematics Subject Classification ID: 90-08
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 95791
zbMATH Keywords: interior point method
zbMATH Keywords: polynomial algorithm
zbMATH Keywords: build-up variant
zbMATH Keywords: logarithmic barrier method
zbMATH Keywords: worst case
author: D. Den Hertog
author: C. Roos
author: Tamás Terlaky
describes a project that uses: ACCPM
MaRDI profile type: Publication
cites work: A Complexity Reduction for the Long-Step Path-Following Algorithm for Linear Programming
cites work: Cutting planes and column generation techniques with the projective algorithm
cites work: A new polynomial-time algorithm for linear programming
cites work: Solving combinatorial optimization problems using Karmarkar's algorithm
cites work: Interior path following primal-dual algorithms. I: Linear programming
cites work: A polynomial-time algorithm, based on Newton's method, for linear programming
cites work: A polynomial method of approximate centers for linear programming
cites work: Q3494376
cites work: An \(O(n^ 3L)\) potential reduction algorithm for linear programming
cites work: A Potential Reduction Algorithm Allowing Column Generation
cites work: A ``build-down'' scheme for linear programming
full work available at URL: 0167-6377(92)90104-b
OpenAlex ID: W2058153952
description: scientific article; zbMATH DE number 95791