On the complexity of linear programming under finite precision arithmetic
type: Item
instance of: scholarly article
title: On the complexity of linear programming under finite precision arithmetic
zbMATH Open document ID: 0894.90112
DOI: 10.1007/BF01582132
author: Jorge R. Vera
published in: Mathematical Programming. Series A. Series B
publication date: 1998-03-11T00:00:00Z
Mathematics Subject Classification ID: 90C05
Mathematics Subject Classification ID: 65G99
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 1127726
zbMATH Keywords: interior point methods
zbMATH Keywords: error analysis
zbMATH Keywords: conditioning
zbMATH Keywords: finite precision arithmetic
zbMATH Keywords: computing error bounds
zbMATH Keywords: logarithmic barrier method
MaRDI profile type: Publication
cites work: Some Remarks on the Foundations of Numerical Analysis
cites work: Incorporating Condition Measures into the Complexity Theory of Linear Programming
cites work: Ill-Posedness and the Complexity of Deciding Existence of Solutions to Linear Programs
cites work: A polynomial-time algorithm, based on Newton's method, for linear programming
cites work: Q4324980
cites work: On the classical logarithmic barrier function method for a class of smooth convex programming problems
cites work: Interior-point methods for convex programming
cites work: Linear programming, complexity theory and elementary functional analysis
cites work: Q3359644
cites work: Q5674306
cites work: Some perturbation theory for linear programming
full work available at URL: https://doi.org/10.1007/bf01582132
OpenAlex ID: W2039868808
description: scientific article; zbMATH DE number 1127726