Bounds on the suboptimalization of aggregation in convex programming

MaRDI QIDQ1324010zbMATH OpenFDO

Authors I. Litvinchev

Publication date 24 July 1994

Published in Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

zbMATH Keywords

aggregation

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Convex programming (90C25)

Recommendations

• Localization of the optimal solution and a posteriori bounds for aggregation
• Inequalities for discrete higher order convex functions
• A posteriori error bounds in linear programming aggregation
• scientific article; zbMATH DE number 193548
• scientific article; zbMATH DE number 4087417

Cited in

(6)

• Localization of the optimal solution and a posteriori bounds for aggregation
• A posteriori error bounds in linear programming aggregation
• Aggregating estimates by convex optimization
• scientific article; zbMATH DE number 3980917 (Why is no real title available?)
• scientific article; zbMATH DE number 4070652 (Why is no real title available?)
• scientific article; zbMATH DE number 4074812 (Why is no real title available?)

This page was built for publication: Bounds on the suboptimalization of aggregation in convex programming

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