A randomized center path method for a class of linear programming problems

MaRDI QIDQ3014538zbMATH OpenFDO

Authors Haidong Zhang, Ye Lou, Xiaofang Chen

Publication date 19 July 2011

zbMATH Keywords

linear programmingimportant samplingcenter path method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05)

Recommendations

• Average case complexity results for a centering algorithm for linear programming problems under Gaussian distributions
• A randomized scheme for speeding up algorithms for linear and convex programming problems with high constraints-to-variables ratio
• Linear programming — Randomization and abstract frameworks
• A combinatorial bound for linear programming and related problems
• Toward Probabilistic Analysis of Interior-Point Algorithms for Linear Programming

Cited in

(1)

• scientific article; zbMATH DE number 1855673 (Why is no real title available?)

This page was built for publication: A randomized center path method for a class of linear programming problems

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