Advanced Cutting-Plane Algorithms for ACOPF
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866909868349194240 |
|---|---|
| author | Bienstock, Daniel Villagra, Matias |
| author_facet | Bienstock, Daniel Villagra, Matias |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2510_21698 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Advanced Cutting-Plane Algorithms for ACOPF Bienstock, Daniel Villagra, Matias Optimization and Control 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. |
| title | Advanced Cutting-Plane Algorithms for ACOPF |
| topic | Optimization and Control |
| url | https://arxiv.org/abs/2510.21698 |