Interior-point methods: Worst case and average case analysis of a phase-I algorithm and a termination procedure.
type: Item
instance of: scholarly article
title: Interior-point methods: Worst case and average case analysis of a phase-I algorithm and a termination procedure.
zbMATH Open document ID: 1046.90040
author: Petra Huhn
author: K. H. Borgwardt
published in: Journal of Complexity
publication date: 2003-05-14T00:00:00Z
full work available at URL: (31)Interior Point methods Worst -Case and Average Case Analysis.pdf
Mathematics Subject Classification ID: 90C05
zbMATH DE Number: 1910726
zbMATH Keywords: linear programming
zbMATH Keywords: interior-point methods
zbMATH Keywords: probabilistic analysis.
MaRDI profile type: Publication
OpenAlex ID: W2084215264
cites work: A simplex algorithm whose average number of steps is bounded between two quadratic functions of the smaller dimension
cites work: New results on the average behavior of simplex algorithms
cites work: Average performance of a self-dual interior point algorithm for linear programming
cites work: Probabilistic analysis of an infeasible-interior-point algorithm for linear programming
cites work: Q3134873
cites work: Probabilistic analysis of optimization algorithms - some aspects from a practical point of view
cites work: Erratum: ``A sharp upper bound for the expected number of shadow vertices in LP-polyhedra under orthogonal projection on two-dimensional planes''
cites work: Q4296156
cites work: Q4346077
cites work: Q4494406
cites work: A new polynomial-time algorithm for linear programming
cites work: Finding an interior point in the optimal face of linear programs
cites work: On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
cites work: Q4739657
cites work: On the average number of steps of the simplex method of linear programming
cites work: Polynomial expected behavior of a pivoting algorithm for linear complementarity and linear programming problems
cites work: Probabilistic Models for Linear Programming
cites work: Characterizations, bounds, and probabilistic analysis of two complexity measures for linear programming problems
cites work: Toward Probabilistic Analysis of Interior-Point Algorithms for Linear Programming
cites work: Q4382667
DOI: 10.1006/JCOM.2002.0640
Recommended article: Q4494406
Recommended article: Interior-point methods for linear programming: a review
Recommended article: Q4496026
Recommended article: Feature Article—Interior Point Methods for Linear Programming: Computational State of the Art
Recommended article: Q4203435
Recommended article: Q4382667
Recommended article: Q4715640
Recommended article: Interior-point methods
Recommended article: A survey of search directions in interior point methods for linear programming
description: scientific article; zbMATH DE number 1910726