Volumetric path following algorithms for linear programming
type: Item
instance of: scholarly article
title: Volumetric path following algorithms for linear programming
zbMATH Open document ID: 0881.90092
DOI: 10.1007/BF02614386
author: Kurt M. Anstreicher
published in: Mathematical Programming. Series A. Series B
publication date: 1998-02-19T00:00:00Z
Mathematics Subject Classification ID: 90C05
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 1038511
zbMATH Keywords: small step path following algorithms
zbMATH Keywords: mixed volumetric-logarithmic barriers
zbMATH Keywords: quadratic convergence
MaRDI profile type: Publication
cites work: Large step volumetric potential reduction algorithms for linear programming
cites work: On the classical logarithmic barrier function method for a class of smooth convex programming problems
cites work: Path-Following Methods for Linear Programming
cites work: Matrix Analysis
cites work: Q4324980
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: A new algorithm for minimizing convex functions over convex sets
cites work: A technique for bounding the number of iterations in path following algorithms
Recommended article: Path-Following Methods for Linear Programming
Recommended article: Mixed volume computation via linear programming
Recommended article: A maximal volume cone algorithm for linear programming problems
Recommended article: A path following algorithm for a class of convex programming problems
Recommended article: Q5412905
Recommended article: A path-following version of the Todd-Burrell procedure for linear programming
Recommended article: On the generalized path-following methods for linear programming
Recommended article: Q4788088
Recommended article: Large step volumetric potential reduction algorithms for linear programming
Recommended article: New trajectory-following polynomial-time algorithm for linear programming problems
description: scientific article; zbMATH DE number 1038511