{"ID":2850798,"CreatedAt":"2026-06-01T04:54:23.091178241Z","UpdatedAt":"2026-06-01T04:54:23.091178241Z","DeletedAt":null,"paper_url":"https://arxiv.org/abs/2510.21698","arxiv_id":"2510.21698","title":"Advanced Cutting-Plane Algorithms for ACOPF","abstract":"We propose a disciplined, numerically stable, and scalable approach to SDP relaxations of the ACOPF problem based on linear cutting-planes. Our method can be warm-started and, owing to its linear nature, enables the computation of tight and accurate bounds for large-scale multi-period relaxations -- well beyond what nonlinear convex solvers can achieve. Preliminary experiments show promising results when benchmarked against state-of-the-art bounds on PGLIB instances.","short_abstract":"We propose a disciplined, numerically stable, and scalable approach to SDP relaxations of the ACOPF problem based on linear cutting-planes. Our method can be warm-started and, owing to its linear nature, enables the computation of tight and accurate bounds for large-scale multi-period relaxations -- well beyond what no...","url_abs":"https://arxiv.org/abs/2510.21698","url_pdf":"https://arxiv.org/pdf/2510.21698v1","authors":"[\"Daniel Bienstock\",\"Matias Villagra\"]","published":"2025-10-24T17:57:58Z","proceeding":"math.OC","tasks":"[\"math.OC\"]","methods":"[]","has_code":false}