×

zbMATH — the first resource for mathematics

On adaptive-step primal-dual interior-point algorithms for linear programming. (English) Zbl 0810.90091
The authors describe adaptive step primal-dual interior point algorithms for linear programming, having polynomial time complexity. On the base of non-rigorous probabilistic assumptions on the data, they provide heuristic reasoning for expecting that the algorithms will perform much better in practice than guaranteed by the worst-case estimates.

MSC:
90C05 Linear programming
90C51 Interior-point methods
90C60 Abstract computational complexity for mathematical programming problems
65K05 Numerical mathematical programming methods
PDF BibTeX XML Cite
Full Text: DOI