Convergence in Karmarkar’s Algorithm for Linear Programming

DOI10.1137/0724060zbMATH Open0632.65073OpenAlexW2039394058MaRDI QIDQ3769878FDOQ3769878

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/

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

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)

Cited In (11)

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

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)