Stable Bounds on the Duality Gap of Separable Nonconvex Optimization Problems

DOI10.1287/moor.2022.1291OpenAlexW4287958899MaRDI QIDQ6199283

Alexandre d'Aspremont, Thomas Kerdreux, Igor Colin

Publication date: 23 February 2024

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/moor.2022.1291

zbMATH Keywords

convex relaxationShapley-Folkman theorem

Mathematics Subject Classification ID

Convex programming (90C25) Nonconvex programming, global optimization (90C26)

This page was built for publication: Stable Bounds on the Duality Gap of Separable Nonconvex Optimization Problems