-
Widening a grid repair's trust box once per point stops the repeats, then a two-round cycle takes over
Allowing the trust-box widening once per base point removed all 68 repeated QPs, but a rejected-then-accepted two-round cycle still lost two cases.
-
What makes a grid repair's QP infeasible? The trust box, not the safety margins, on PGLib-OPF
On 58 of 58 rounds where a grid repair's QP had no solution, removing the trust box made it solvable. The margins fixed only 13 of them.
-
Widening a grid repair's trust box fixes its empty QP, then makes it repeat the step it just rejected
Re-solving an empty repair QP at the smallest workable trust box fixed all 94 empty QPs, but 68 of them were the QP just rejected. Net: fewer finishers.
-
Should a grid repair accept a step on total overload or the worst line? A pre-registered test on PGLib-OPF
Scoring an AC-feasibility repair on summed overload instead of the worst line changed 5 decisions in 34 cases, and held out it cost two finishers.
-
Halving the safety margins finishes the grid repair that never finished, and costs nothing elsewhere
A rule that halves an AC repair's margins only when the margin-shifted OPF has no solution finishes PGLib case73 API and loses none of 31 finishers.
-
The grid repair that never finished was aiming at an empty set: safety margins on an AC power flow
On PGLib-OPF case73 API, pulling thermal and voltage limits in by a small margin leaves no AC solution on PIPS or IPOPT, which is why the repair stalls.
-
Two stalls of the grid repair, two different causes: a local infeasibility and a mismatched merit
Logging the elastic QP penalty on two PGLib-OPF cases: one stall is a local infeasibility of the controls, the other a merit at odds with the QP.
-
What a convergence proof can and cannot say about the AC repair of a DC dispatch
A step-based convergence statement for the AC repair of a DC dispatch, checked on 31 PGLib-OPF traces: halvings stay logarithmic, accepted steps are unbounded.
-
Four of the five DC OPFs with no solution had one: a solver check on PGLib-OPF
On 4 of 5 PGLib-OPF cases where PYPOWER's DC OPF had no solution, a second solver finds one. Zero-reactance bus ties and solver failures, not the networks.
-
One protocol on every held-out case: 10 of 24, and nothing lost
With one slack rule and IPOPT as reference, the frozen DC-to-AC repair is fully feasible on 10 of 24 held-out PGLib cases, 12 with a voltage stage. DC alone: 0.
-
The voltage collapse was the slack bus
On five PGLib-OPF RTE networks the DC dispatch looked past a voltage-collapse fold. The cause was a 30 MW slack unit. Moving it gives all five a power flow.
-
The DC dispatch sits past a voltage-collapse fold
On six PGLib cases the power-flow Jacobian goes singular where load continuation stalls. Repairing at the fold and stepping up in load rescues one case of six.
-
The DC dispatch that no power flow can reach
On six PGLib cases the AC power flow at the DC OPF dispatch never converges. From DC angles Newton solves the networks, but load runs out at 48 to 85 %.
-
Exact derivatives didn't speed up the grid repair. The QP takes the time
Jacobian sensitivities match finite differences to 1e-5 and keep the repair at 29 of 34 PGLib cases, but run time falls only 1.1x: the QP takes 98-99 %.
-
A linear power flow with voltages in it still gave no feasible dispatch on 34 grid cases
LPAC-C, run once and checked with an AC power flow, is fully feasible on 0 of 34 PGLib cases and has no solution on 9. The repair gets 21.
-
The grid repair's 21 of 34 held up when every bus's load moved by up to 10 %
On 244 load-perturbed copies of 34 PGLib cases, the AC repair of a DC dispatch is feasible on 66 % (95 % interval 52 to 79 %), 91 % with a voltage stage.
-
The grid repair needed more rounds, not a better model: 31 of 34 PGLib cases with a 20-round budget
With 20 rounds instead of 10, the AC repair of a DC dispatch is feasible on 31 of 34 PGLib cases; misses are curvature, and our convergence bound fails.
-
On grids of 500 to 2,000 buses the AC repair never finished in 10 rounds: 0 of 12, then 6 of 12 with 20
A held-out test on PGLib's 500 to 2,000-bus cases: the frozen AC repair of a DC dispatch is feasible on 0 of 12 within 10 rounds, 6 of 12 within 20.
-
When the QP solver says infeasible: auditing 347 optimal power flow repair steps against a second solver
Every QP of an AC OPF repair on 34 PGLib-OPF cases re-solved with Clarabel: PIPS was right when it answered, but failed on 26 solvable QPs.
-
A grid dispatch repair rule, tested on cases it never saw
Rules tuned on 11 congested PGLib grids repair 7 of 11 held-out angle-limited grids once angle limits are linearised. Blind to angles, they repair 3.
-
A grid repair that moves generator voltages makes 28 of 34 PGLib cases AC-feasible
Moving voltage setpoints with P repairs the DC dispatch on 5 of 34 PGLib cases as planned; with a margin inside every limit, 28 of 34 at 0.17 to 0.34 % cost.
-
Our linear OPF repair was leaning on the AC optimum's voltages
At PGLib's flat 1.0 pu setpoints, our linearisation repair of the DC dispatch cleared 2 of 11 congested cases, down from 6 with the AC optimum's voltages.