activity
20232026
most citedAccurate and Warm-Startable Linear Cutting-Plane Relaxations for ACOPF

1 citations · 1 across the 6 of their papers we have counts for

collaborators
Showing 2024Show all

2 papers · 1 filter

math.OC2024

Solving convex QPs with structured sparsity under indicator conditions

Daniel Bienstock, Tongtong Chen

We study convex optimization problems where disjoint blocks of variables are controlled by binary indicator variables that are also subject to conditions, e.g., cardinality. Severa…

math.OC2024★ 1 cited

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…