Towards an asymptotic analysis of Karmarkar's algorithm

DOI10.1016/0020-0190(86)90134-1zbMATH Open0625.90050OpenAlexW2037650903MaRDI QIDQ580169FDOQ580169

Authors: 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

Recommendations

• On the number of iterations of Karmarkar's algorithm for linear programming
• On the Performance of Karmarkar’s Algorithm over a Sequence of Iterations
• scientific article; zbMATH DE number 4085412
• scientific article; zbMATH DE number 4079165
• scientific article; zbMATH DE number 556487

zbMATH Keywords

algorithmworst case analysis

Mathematics Subject Classification ID

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

Cites Work

• A new polynomial-time algorithm for linear programming

Cited In (7)

• A new simple homotopy algorithm for linear programming. I
• A tight analysis and near-optimal instances of the algorithm of Anderson and Woll
• A polynomial-time algorithm, based on Newton's method, for linear programming
• On the asymptotic behaviour of the Aragón Artacho-Campoy algorithm
• On a class of strongly asymmetric PKA algorithms
• Convergence in Karmarkar's algorithm: a review
• Title not available (Why is that?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q580169)