Convergence in Karmarkar’s Algorithm for Linear Programming

DOI10.1137/0724060MaRDI QIDQ3769878zbMATHOpenAlexFDO

Authors Joel Franklin

Publication date 1987

Published in SIAM Journal on Numerical Analysis (Search for Journal in Brave)

Full work available at URL https://authors.library.caltech.edu/13073/

zbMATH Keywords

convergenceunbounded solutionsKarmarkar's algorithmprojective-iterative method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Large-scale problems in mathematical programming (90C06)

Recommendations

• scientific article; zbMATH DE number 892376
• scientific article; zbMATH DE number 892328
• On the Performance of Karmarkar’s Algorithm over a Sequence of Iterations
• scientific article; zbMATH DE number 556487
• scientific article; zbMATH DE number 4068603

Cited in

(11)

• On the improvement per iteration in Karmarkar's algorithm for linear programming
• scientific article; zbMATH DE number 4064763 (Why is no real title available?)
• scientific article; zbMATH DE number 4085412 (Why is no real title available?)
• A strengthened acceptance criterion for approximate projections in Karmarkar's algorithm
• Convergence in Karmarkar's algorithm: a review
• scientific article; zbMATH DE number 650970 (Why is no real title available?)
• Convergence results and numerical experiments on a linear programming hybrid algorithm
• On the Performance of Karmarkar’s Algorithm over a Sequence of Iterations
• Parameter \(\alpha\) versus number of iterations in Karmarkar's algorithm for LP
• A Self-Correcting Version of Karmarkar’s Algorithm
• Asymptotic behaviour of Karmarkar's method for linear programming

This page was built for publication: Convergence in Karmarkar’s Algorithm for Linear Programming

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