Advanced Cutting-Plane Algorithms for ACOPF
Optimization and Control
2025-10-27 v1
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.
Cite
@article{arxiv.2510.21698,
title = {Advanced Cutting-Plane Algorithms for ACOPF},
author = {Daniel Bienstock and Matias Villagra},
journal= {arXiv preprint arXiv:2510.21698},
year = {2025}
}