Towards an asymptotic analysis of Karmarkar's algorithm

DOI10.1016/0020-0190(86)90134-1zbMath0625.90050OpenAlexW2037650903MaRDI QIDQ580169

Lenore Blum

Publication date: 1986

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(86)90134-1

zbMATH Keywords

algorithmworst case analysis

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Linear programming (90C05)

Related Items (2)

A new simple homotopy algorithm for linear programming. I ⋮ A polynomial-time algorithm, based on Newton's method, for linear programming

Cites Work

• A new polynomial-time algorithm for linear programming

This page was built for publication: Towards an asymptotic analysis of Karmarkar's algorithm