O(m) bound on number of iterations in sphere methods for LP

MaRDI QIDQ2865879zbMATH OpenFDO

Authors Katta G. Murty

Publication date 11 December 2013

Published in Algorithmic Operations Research (Search for Journal in Brave)

Full work available at URL http://journals.hil.unb.ca/index.php/AOR/article/view/19441

zbMATH Keywords

number of iterationssphere methodsdescent stepsinsphereslinear program (LP)touching facets

Mathematics Subject Classification ID

Linear programming (90C05)

Recommendations

• Sphere methods for LP
• Note on implementing the new sphere method for LP using matrix inversions sparingly
• Fast descent methods for LPs with no matrix inversions
• Average number of iterations of some polynomial interior-point -- algorithms for linear programming
• scientific article; zbMATH DE number 4091176

Cited in

(3)

• Note on implementing the new sphere method for LP using matrix inversions sparingly
• Sphere methods for LP
• Fast descent methods for LPs with no matrix inversions

This page was built for publication: \(O(m)\) bound on number of iterations in sphere methods for LP

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