Large step volumetric potential reduction algorithms for linear programming
type: Item
instance of: scholarly article
title: Large step volumetric potential reduction algorithms for linear programming
zbMATH Open document ID: 0848.90080
DOI: 10.1007/BF02206828
author: Kurt M. Anstreicher
published in: Annals of Operations Research
publication date: 1996-07-01T00:00:00Z
Mathematics Subject Classification ID: 90C05
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 894995
zbMATH Keywords: interior algorithm
zbMATH Keywords: potential reduction algorithms
zbMATH Keywords: mixed volumetric-logarithmic, barrier function algorithms
MaRDI profile type: Publication
cites work: Polynomial-time algorithms for linear programming based only on primal scaling and projected gradients of a potential function
cites work: Polynomial affine algorithms for linear programming
cites work: Large Step Path-Following Methods for Linear Programming, Part I: Barrier Function Method
cites work: Large Step Path-Following Methods for Linear Programming, Part II: Potential Reduction Method
cites work: Matrix Analysis
cites work: Q4324980
cites work: Q4739657
cites work: A polynomial-time algorithm, based on Newton's method, for linear programming
cites work: Q3494376
cites work: A new algorithm for minimizing convex functions over convex sets
cites work: A technique for bounding the number of iterations in path following algorithms
cites work: An \(O(n^ 3L)\) potential reduction algorithm for linear programming
description: scientific article; zbMATH DE number 894995