scientific article; zbMATH DE number 3843493

MaRDI QIDQ3313619zbMATH OpenFDO

Authors Bożenna Waluk, Stanisław Walukiewicz

Publication date 1983

zbMATH Keywords

systems of linear inequalitiessurrogate constraintsComputational experimentscomparison of algorithmsellipsoid algorithmdeep cutsrange ellipsoids

Mathematics Subject Classification ID

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

Recommendations

• Complexity investigations on the ellipsoid algorithm
• scientific article; zbMATH DE number 3908161
• An ellipsoid algorithm for the computation of fixed points
• Algorithms for Polyhedral Approximation of Multidimensional Ellipsoids
• scientific article; zbMATH DE number 568568
• A Computational Comparison of the Ellipsoid Algorithm with Several Nonlinear Programming Algorithms
• Comparison of several fast algorithms for projection onto an ellipsoid
• r-algorithms and ellipsoids
• The ellipsoid algorithm using parallel cuts
• Publication:4892205

Cited in

(10)

• scientific article; zbMATH DE number 3980933 (Why is no real title available?)
• Application of the ellipsoid method in an interactive procedure for multicriteria linear programming
• The Ellipsoid Method Generates Dual Variables
• An ellipsoid algorithm for the computation of fixed points
• An Oblivious Ellipsoid Algorithm for Solving a System of (In)Feasible Linear Inequalities
• scientific article; zbMATH DE number 568568 (Why is no real title available?)
• scientific article; zbMATH DE number 3858843 (Why is no real title available?)
• A Computational Comparison of the Ellipsoid Algorithm with Several Nonlinear Programming Algorithms
• scientific article; zbMATH DE number 3952492 (Why is no real title available?)
• scientific article; zbMATH DE number 3908161 (Why is no real title available?)

This page was built for publication:

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