Black-box acceleration of monotone convex program solvers

DOI10.1287/OPRE.2022.2352MaRDI QIDQ6579661zbMATH OpenFDO

Authors Palma London, Shai Vardi, Reza Eghbali, Adam Wierman

Publication date 25 July 2024

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/OPRE.2022.2352

zbMATH Keywords

convex optimizationdimension reductionlinear programmingoptimization

Mathematics Subject Classification ID

Convex programming (90C25)

Recommendations

• scientific article; zbMATH DE number 2163027
• Faster and simpler approximation algorithms for mixed packing and covering problems
• Nearly-linear time positive LP solver with faster convergence rate
• A randomized scheme for speeding up algorithms for linear and convex programming problems with high constraints-to-variables ratio
• Nearly linear-time packing and covering LP solvers. Nearly linear-time packing and covering LP solvers, achieving width-independence and =(1/)-convergence

This page was built for publication: Black-box acceleration of monotone convex program solvers

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