Average number of iterations of some polynomial interior-point -- algorithms for linear programming
type: Item
instance of: scholarly article
title: Average number of iterations of some polynomial interior-point -- algorithms for linear programming
zbMATH Open document ID: 0976.90071
DOI: 10.1007/BF02884182
author: Siming Huang
published in: Science in China. Series A
publication date: 2001-04-01T00:00:00Z
Mathematics Subject Classification ID: 90C05
Mathematics Subject Classification ID: 90C51
zbMATH DE Number: 1542539
zbMATH Keywords: random linear programming
zbMATH Keywords: polynomial interior-point algorithms
zbMATH Keywords: average number of iterations
MaRDI profile type: Publication
cites work: A new polynomial-time algorithm for linear programming
cites work: A simplex variant solving an m\(\times d\) linear program in O(min(m 2,d 2)) expected number of pivot steps
cites work: A simplex algorithm whose average number of steps is bounded between two quadratic functions of the smaller dimension
cites work: The simplex method. A probabilistic analysis
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: Toward Probabilistic Analysis of Interior-Point Algorithms for Linear Programming
cites work: Average performance of a self-dual interior point algorithm for linear programming
cites work: Probabilistic Models for Linear Programming
cites work: Probabilistic analysis of an infeasible-interior-point algorithm for linear programming
cites work: Q4045381
cites work: An \(O(\sqrt n L)\) iteration potential reduction algorithm for linear complementarity problems
full work available at URL: https://doi.org/10.1007/bf02884182
OpenAlex ID: W2233483240
Recommended article: Q4664936
Recommended article: Q4288560
Recommended article: Q4852860
Recommended article: Two computationally efficient polynomial-iteration infeasible interior-point algorithms for linear programming
Recommended article: An algorithm that is polynomial on the average in integer linear programming
Recommended article: Polynomiality of infeasible-interior-point algorithms for linear programming
Recommended article: Q4324980
Recommended article: Q4025649
Recommended article: Polynomial interior point algorithms for general linear complementarity problems
Recommended article: Q4203435
description: scientific article; zbMATH DE number 1542539