scientific article; zbMATH DE number 3908161

MaRDI QIDQ3686495zbMATH OpenFDO

Authors P. F. Pickel

Publication date 1985

zbMATH Keywords

surveycomputational complexityperfect graphsKarmarkar's algorithmcomputational comparisonellipsoid algorithmgeneralized reduced gradientaugmented Lagrangian code

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Linear programming (90C05) Analysis of algorithms and problem complexity (68Q25) Nonlinear programming (90C30) Extremal problems in graph theory (05C35)

Recommendations

• An ellipsoid algorithm for the computation of fixed points
• scientific article; zbMATH DE number 3843493
• Algorithms for Polyhedral Approximation of Multidimensional Ellipsoids
• The ellipsoid algorithm using parallel cuts
• Publication:4892205
• scientific article; zbMATH DE number 279596
• Complexity investigations on the ellipsoid algorithm
• Rank-two update algorithms for the minimum volume enclosing ellipsoid problem
• Algorithms of projection of a point onto an ellipsoid
• Karmarkar's algorithm and the ellipsoid method

Cited in

(4)

• An ellipsoid algorithm for the computation of fixed points
• A strengthened acceptance criterion for approximate projections in Karmarkar's algorithm
• scientific article; zbMATH DE number 3843493 (Why is no real title available?)
• Implementing an affine scaling algorithm for linear programming

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 Q3686495)