1 citations · 1 across the 3 of their papers we have counts for
4 papers
Advanced Cutting-Plane Algorithms for ACOPF
Daniel Bienstock, Matias Villagra
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, owin…
A Linear and Scalable Cutting-Plane Algorithm for Electricity Pricing
Matías Romero, Felipe Verástegui, Matías Villagra
We propose a linear cutting-plane pricing algorithm tailored for large-scale electricity markets, addressing nonconvexities arising from the Alternating Current Optimal Power Flow…
Accurate and Warm-Startable Linear Cutting-Plane Relaxations for ACOPF
Daniel Bienstock, Matias Villagra
We present a linear cutting-plane relaxation approach that rapidly proves tight lower bounds for the Alternating Current Optimal Power Flow Problem (ACOPF). Our method leverages ou…
Accurate Linear Cutting-Plane Relaxations for ACOPF
Daniel Bienstock, Matias Villagra
We present a pure linear cutting-plane relaxation approach for rapidly proving tight and accurate lower bounds for the Alternating Current Optimal Power Flow Problem (ACOPF) and it…