Pith. sign in

REVIEW 3 major objections 5 minor 30 references

The paper claims that every dual rotated-second-order-cone constraint in the Jabr relaxation of AC optimal power flow must be tight (active) at optimality, which lets the conic dual be rewritten as a non-conic problem with only non-negativi

Reviewed by Pith at T0; open to challenge. T0 means a machine referee read the full paper against a public rubric. the ladder, T0–T4 →

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

T0 review · deepseek-v4-flash

2026-08-02 17:46 UTC pith:L7T4ANQP

load-bearing objection Solid and useful reformulation with strong numerics, but Lemma 2's proof has a real gap that must be closed before the equivalence claim is rigorous. the 3 major comments →

arxiv 2603.20411 v2 pith:L7T4ANQP submitted 2026-03-20 eess.SY cs.SYmath.OC

Activate the Dual Cones: A Tight Reformulation of Conic ACOPF Constraints

Saba Rafiei , Samuel Chevalier This is my paper
classification eess.SY cs.SYmath.OC MSC 90C2590C4690C90
keywords ACOPFJabr relaxationrotated second-order conedual tightnesscertified lower boundsconic optimizationfirst-order methods
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper tries to establish that, in the dual of the Jabr second-order-cone relaxation of AC optimal power flow, every rotated second-order cone inequality is tight (active) at an optimal solution. Given that, the dual can be rewritten with the conic constraints replaced by equalities, eliminating the cone entirely and leaving only non-negativity constraints. If correct, this yields a simpler dual that interior-point solvers handle faster on large networks, and a cheap post-processing projection turns any near-feasible solution into a certified lower bound on the ACOPF cost. The authors verify numerically that their tight dual matches a mature conic solver on PGLib cases up to 1354 buses.

Core claim

The central claim is that at any optimal solution of the dual of the Jabr RSOC relaxation, the inequalities 2d1*d2 >= ||d||^2 hold with equality for every dual RSOC tuple (voltage relaxation, line flow limits, and generator cost epigraph). Lemmas 1 and 2 show this for the line-flow and cost-epigraph cones by arguing that any slack would allow decreasing a dual variable with a strictly negative objective coefficient, and that the optimal cost-cone scalar d_t2 equals 1. Lemma 3 shows it for the voltage cone via KKT complementarity, since a strictly interior dual cone would force the primal variables to zero, contradicting feasibility. Together they justify the 'All Tight Dual' model (Model 4),

What carries the argument

The rotated second-order cone (RSOC) and its dual cone; the paper uses self-duality of RSOC and the fact that dual variables sit in the dual cone. The load-bearing identity is 2 d1 d2 = ||d_vec||^2 (tightness), which allows eliminating d1 as a function of the others. The epsilon-stabilized replacement function r(z, eps) = ||z_vec||^2 / (2 z2 + eps) for the eliminated variable, plus a post-processing projection onto the cone boundary, converts a slightly infeasible dual solution into a certified lower bound (Eq. 37).

Load-bearing premise

Lemma 2 assumes the primal upper bound t_bar on the epigraph variable is large enough to dominate the squared norm of the dual cost-cone vector at optimality, but no argument connects the primal bound to the dual variable's size; if ||d_t|| can be large, the maximum of the reduced objective need not occur at d_t2 = 1.

What would settle it

Find any PGLib instance (or constructed network) where the optimal dual RSOC constraint for the generator cost epigraph is not tight — i.e., where the ATD objective strictly exceeds the conic dual objective, or where an interior-point solution to the conic dual has 2 d_t1 d_t2 > ||d_t||^2. Alternatively, compute the certified lower bound (Eq. 37) on a large set of instances and check whether it ever exceeds the primal RSOC optimal value.

Watch this falsifier. Get emailed when new claim-graph text bears on it.

If this is right

  • The dual of the Jabr ACOPF relaxation can be solved as a non-conic problem with only box/non-negativity constraints, enabling projected-gradient and other first-order methods without conic projections.
  • A certified lower bound on the relaxed ACOPF cost can be computed from any near-feasible dual point via the projection formula, independent of the stabilization parameter.
  • On large PGLib cases, the simplified dual solves faster and more reliably with interior-point solvers than the original conic dual.
  • Eliminating conic constraints shrinks the KKT system, reducing the bottleneck in IPM-based approaches.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • If the tightness claim holds, it implies that the dual optimal face of the Jabr relaxation is entirely contained in the boundary of the dual RSOC cones, which is a kind of strict-complementarity-like behavior; one could test whether similar tightness holds for other RSOC-based relaxations (e.g., those with added cycle constraints or tighter cuts).
  • The proof of Lemma 2 relies on t being bounded, but t is a primal variable; a rigorous chain linking the dual norm to that bound is missing. A natural extension is to check whether the result can be proven without that assumption, perhaps via complementary slackness on the cost epigraph.
  • The epsilon-stabilized dual could be used as a warm-start for the exact conic dual, or as a Lagrangian dual for first-order methods; the paper's certified lower bound postprocessing already makes it safe for bounding.
  • A testable extension is to apply the same elimination to the SDP relaxation of ACOPF — if dual SDP constraints also tend to be tight, the same argument could simplify the dual SDP.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit.

Referee Report

3 major / 5 minor

Summary. The paper proposes an "All Tight Dual" (ATD) reformulation of the conic dual of the Jabr second-order cone relaxation of AC optimal power flow. The central claim is that all dual rotated second-order cone (RSOC) constraints are tight at optimality (Section III, Lemmas 1-3), so the dual cone inequalities can be replaced by equalities and the corresponding dual variables eliminated, yielding a non-conic maximization problem (Model 4). The authors also propose an epsilon-stabilized variant with a postprocessing projection step that produces a certified lower bound (Eq. (37)). Numerical experiments on PGLib cases from 3 to 1354 buses compare the ATD formulation against the standard conic dual solved with Ipopt/Knitro and against MOSEK.

Significance. If the tightness claim is correct, the ATD formulation is a genuinely useful structural simplification: it removes the dual RSOC constraints, reduces the size of the KKT system, and is a natural target for first-order/GPU-accelerated methods. The certified-lower-bound postprocessing is also valuable. The paper is mostly constructive, with machine-checkable algebraic derivations for the elimination step and a clear numerical demonstration on standard benchmarks. The main risk is that the proof of the key elimination formula rests on an unproven bound, so the central equivalence is not yet established with the required rigor.

major comments (3)
  1. [Section III, Lemma 2 and Eq. (27)] The proof that d_t2 = 1 at optimality depends on the condition t̄ ≥ ||d_t||^2/4, but t̄ is a bound on the primal epigraph variable t, not on the dual vector d_t. No chain of inequalities links t̄ to the dual variables. The footnote claiming t̄ can be set arbitrarily large is not responsive: t̄ enters the dual objective h(d_t2) through the term -t̄|1-d_t2|, so increasing t̄ changes the maximizer. This is load-bearing because the replacement d_t1 = ||d_t||^2/2 in Eq. (29) and Model 4 is justified only by Lemma 2. Please supply a bound on ||d_t|| in terms of problem data (e.g., via stationarity (18b) and cone geometry) or replace the argument with a complementary-slackness proof using the positive constant term in the cost cone.
  2. [Section III, Lemma 1 and Eq. (18b)-(22)] The proof of Lemma 1 argues that decreasing a dual scalar s strictly improves the objective if the RSOC constraint is slack. This ignores that s also appears in the stationarity equality (18b) through F^T d̃, so decreasing s may violate stationarity unless other variables are adjusted, and the objective also depends on λ. The claimed result is likely true by the standard complementary slackness argument for conic programs (if a dual cone variable is interior, the corresponding primal cone component must be zero; for the flow and cost cones this component includes a positive constant such as Smax or 1/2, contradicting primal feasibility). The proof should be replaced by this rigorous argument.
  3. [Section II.C-II.D and Appendix B, Eqs. (13e)-(13g), (22)] The dualization convention for the line-flow and cost-epigraph RSOC constraints is inconsistent as written. Model 2 writes constraints in terms of variables t_s and t, while Appendix B and Eq. (22) treat the corresponding cone components as the constants S_max and 1/2. This ambiguity determines which dual variables enter stationarity (18b) and therefore affects Lemma 1 and the derivation of Eq. (22). Please clarify whether t_s and t are eliminated through the linear equality block or remain cone variables, and make the F and g definitions consistent throughout.
minor comments (5)
  1. [Section III, Lemma 2, Eq. (24)] The primal box is stated as 0 ≤ t ≤ t̄, but Eq. (24) and the surrounding text use |t| ≤ t̄, and Lemma 2 asserts ω_1 = 0 without explanation. The correct term for 0 ≤ t ≤ t̄ is -t̄ max(0, d_t2-1). Please reconcile the box convention.
  2. [Abstract and Section I] The abstract says the tightness is 'observed' and then the paper proves it; consider rephrasing to 'established' to avoid implying an empirical observation is the basis.
  3. [Section IV, Tables I-II] Table II reports all gaps as 0.00 while the text notes an average gap of 2.31e-3%; clarify significant digits or report more precisely. In Table I, the Ipopt 'Primal RSOC' objective of -88723153.12 for the 500-bus case appears to be a solver failure; label it as such.
  4. [Throughout] Minor typos: 'prposed' in Section I, 'coice' in Section V, and 'Preformance' in Table heading. Also, the reference [21] is a prior DCOPF result by the same authors; in Lemma 2 please state explicitly which part of the result is new for ACOPF.
  5. [Section III.B, Eq. (37)] After projecting the dual variables, the paper does not explicitly restore stationarity (18b); since Eq. (20) is a Lagrangian dual over the box, dual-cone feasibility may suffice for a lower bound, but this should be stated clearly so readers do not assume the projected point is feasible for Model 3.

Circularity Check

0 steps flagged

No circularity: dual RSOC tightness is derived from optimality/KKT, not assumed; the only self-citation is non-load-bearing. Lemma 2's missing bound is a correctness gap, not a circular step.

full rationale

The derivation chain is a standard Lagrangian/conic-duality argument. Model 3 is the textbook dual of Model 2; Lemmas 1-3 attempt to prove tightness of the dual RSOC constraints from optimality (Lemma 1: a slack negative-coefficient scalar can be decreased to improve the objective) and from KKT complementarity plus feasibility (Lemma 3: strict interiority of the dual would force the primal cone point to zero, contradicting positive voltage lower bounds). The replacement function r(.) in (29) and Model 4 are introduced only after these lemmas, so the equivalence claim is not an input to the tightness proof. The only self-citation, [21], is explicitly a prior DCOPF analog and is not used to establish the ACOPF result ('A similar result was first reported in [21] ... but here we extend this to the ACOPF case and we offer a more complete proof'), so it is not load-bearing. Numerical comparisons are against external MOSEK/PowerModels benchmarks, so the ATD objective is not fitted to the reference values. The proof does contain a genuine rigor gap: Lemma 2 asserts t_bar >= ||d_t||^2/4 at optimality via Footnote 1 ('Since t_bar is just an upper bound, it can be set arbitrarily large...'), but t_bar is a bound on the primal variable t and no chain links it to the dual variable d_t; this is a correctness issue, not a circularity, because the claim is supposed to be derived and is not assumed. Hence no circular step is identified; the score 2 reflects only the minor, non-load-bearing self-citation.

Axiom & Free-Parameter Ledger

3 free parameters · 4 axioms · 0 invented entities

The reformulation introduces no new physical entities. It does introduce algorithmic parameters (ε, δ) and relies on a bound t̄ whose adequacy is unproven. The main theoretical axioms are standard conic duality plus problem-specific feasibility and relaxation assumptions.

free parameters (3)
  • t̄ (upper bound on quadratic cost variable t)
    Chosen 'sufficiently large' in Lemma 2; the proof's condition t̄ >= ||d_t||^2/4 is not verified, so the value matters for the proof but is not fitted to data.
  • ε (stabilization parameter in r(z,ε))
    Numerical stability term; swept in Fig. 1 and set to a moderate value; the certified bound removes its effect via projection.
  • δ (projection threshold)
    Threshold below which dual components are set to zero in the postprocessing projection (34)-(35); affects which feasible dual point is produced.
axioms (4)
  • domain assumption Jabr RSOC relaxation has a feasible point with strictly positive voltage magnitudes
    Used in Lemma 3 Case I to rule out w_i = w_j = 0; required for KKT complementarity to force the dual on the boundary.
  • standard math Standard conic duality and strong duality hold for the RSOC relaxation (e.g., Slater's condition)
    The derivation of the dual (18) and the certified lower bound rely on weak duality; the equality of primal and dual optima is used implicitly in Remark 1.
  • domain assumption The cycle constraint (6) can be dropped without affecting the dual lower bound argument
    Section II-B: 'In this paper, we drop the cycle constraint entirely.' This is a relaxation of the physical power flow, so the resulting bound is for the relaxed problem, not the ACOPF itself.
  • ad hoc to paper The box bound t <= t̄ is inactive at the primal optimum, so its dual variable is zero
    Required for Lemma 2's conclusion d_t2 = 1 via stationarity at the t-coordinate; the paper instead proves it through the h(d_t2) function, which depends on the unproven bound on ||d_t||.

pith-pipeline@v1.3.0-alltime-deepseek · 13666 in / 26084 out tokens · 228438 ms · 2026-08-02T17:46:40.416615+00:00 · methodology

0 comments
read the original abstract

By exploiting the observed tightness of dual rotated second-order cone (RSOC) constraints, this paper transforms the dual of a conic ACOPF relaxation into an equivalent, non-conic problem where dual constraints are implicitly enforced through eliminated dual RSOC variables. To accomplish this, we apply the RSOC-based Jabr relaxation of ACOPF, pose its dual, and then show that all dual RSOC constraints must be tight (i.e., active) at optimality. We then construct a reduced dual maximization problem with only non-negativity constraints, avoiding the explicit RSOC inequality constraints. Numerical experiments confirm that the tight formulation recovers the same dual objective values as a mature conic solver (e.g., MOSEK via PowerModels) on various PGLib benchmark test systems (ranging from 3- to 1354-buses). The proposed formulation has useful performance benefits, compared with its conic counterpart, and it allows us to define a bounding function which provides a guaranteed lower bound on system cost. While this paper focuses on demonstrating the correctness and validity of the proposed structural simplification, it lays the groundwork for future GPU-accelerated first-order optimization methods which can exploit the unconstrained nature of the proposed formulation.

Figures

Figures reproduced from arXiv: 2603.20411 by Saba Rafiei, Samuel Chevalier.

Figure 1
Figure 1. Figure 1: Change of dual objective as a function of [PITH_FULL_IMAGE:figures/full_fig_p005_1.png] view at source ↗

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

30 extracted references · 2 linked inside Pith

  1. [1]

    Zero duality gap in optimal power flow problem,

    J. Lavaei and S. H. Low, “Zero duality gap in optimal power flow problem,”IEEE Transactions on Power Systems, vol. 27, no. 1, pp. 92–107, 2012

    2012

  2. [2]

    A survey of relaxations and approximations of the power flow equations,

    D. Molzahn and I. Hiskens, “A survey of relaxations and approximations of the power flow equations,”Foundations and Trends® in Electric Energy Systems, vol. 4, pp. 1–221, 01 2019

    2019

  3. [3]

    Radial distribution load flow using conic programming,

    R. Jabr, “Radial distribution load flow using conic programming,”IEEE Transactions on Power Systems, vol. 21, no. 3, pp. 1458–1459, 2006

    2006

  4. [4]

    A survey on conic relaxations of optimal power flow problem,

    F. Zohrizadeh, C. Josz, M. Jin, R. Madani, J. Lavaei, and S. Sojoudi, “A survey on conic relaxations of optimal power flow problem,” European Journal of Operational Research, vol. 287, no. 2, pp. 391–409, 2020. [Online]. Available: https://www.sciencedirect.com/ science/article/pii/S0377221720300552

    2020

  5. [5]

    Inexact convex relaxations for ac optimal power flow: Towards ac feasibility,

    A. Venzke, S. Chatzivasileiadis, and D. K. Molzahn, “Inexact convex relaxations for ac optimal power flow: Towards ac feasibility,”Electric Power Systems Research, vol. 187, p. 106480, 2020. [Online]. Available: https://www.sciencedirect.com/science/article/pii/S0378779620302832

    2020

  6. [6]

    On the tightness of the lagrangian dual bound for alternating current optimal power flow,

    W. Zhang, K. Kim, and V . M. Zavala, “On the tightness of the lagrangian dual bound for alternating current optimal power flow,” in2022 IEEE Power & Energy Society General Meeting (PESGM), 2022, pp. 1–5

    2022

  7. [7]

    Strong socp relaxations for the optimal power flow problem,

    B. Kocuk, S. Dey, and X. Sun, “Strong socp relaxations for the optimal power flow problem,”Operations Research, vol. 64, 05 2016

    2016

  8. [8]

    Tight lp approximations for the optimal power flow problem,

    S. Mhanna, G. Verbi ˇc, and A. C. Chapman, “Tight lp approximations for the optimal power flow problem,” in2016 Power Systems Computation Conference (PSCC), 2016, pp. 1–7

    2016

  9. [9]

    Alternating direction augmented lagrangian methods for semidefinite programming,

    Z. Wen, D. Goldfarb, and W. Yin, “Alternating direction augmented lagrangian methods for semidefinite programming,”Mathematical Pro- gramming Computation, vol. 2, pp. 203–230, 12 2010

    2010

  10. [10]

    Adaptive admm for dis- tributed ac optimal power flow,

    S. Mhanna, G. Verbi ˇc, and A. C. Chapman, “Adaptive admm for dis- tributed ac optimal power flow,”IEEE Transactions on Power Systems, vol. 34, no. 3, pp. 2025–2035, 2019

    2025

  11. [11]

    Pdlp: A practical first-order method for large-scale linear programming,

    D. Applegate, M. D ´ıaz, O. Hinder, H. Lu, M. Lubin, B. O’Donoghue, and W. Schudy, “Pdlp: A practical first-order method for large-scale linear programming,”arXiv preprint arXiv:2501.07018, 2025

    arXiv 2025

  12. [12]

    Gpu-accelerated primal heuristics for mixed integer programming,

    A. C ¸¨ord¨uk, P. Sielski, A. Boucher, and K. Aatish, “Gpu-accelerated primal heuristics for mixed integer programming,”arXiv preprint arXiv:2510.20499, 2025

    arXiv 2025

  13. [13]

    Concurrent crossover for pdhg,

    E. Rothberg, “Concurrent crossover for pdhg,”arXiv preprint arXiv:2510.24429, 2025

    arXiv 2025

  14. [14]

    Dual conic proxies for ac optimal power flow,

    G. Qiu, M. Tanneau, and P. Van Hentenryck, “Dual conic proxies for ac optimal power flow,”Electric Power Systems Research, vol. 236, p. 110661, 2024. [Online]. Available: https://www.sciencedirect.com/ science/article/pii/S0378779624005479

    2024

  15. [15]

    Dual lagrangian learning for conic optimization,

    M. Tanneau and P. Van Hentenryck, “Dual lagrangian learning for conic optimization,”Advances in Neural Information Processing Systems, vol. 37, pp. 55 538–55 561, 2024

    2024

  16. [16]

    Conic optimization via operator splitting and homogeneous self-dual embedding,

    B. O’Donoghue, E. Chu, N. Parikh, and S. Boyd, “Conic optimization via operator splitting and homogeneous self-dual embedding,”Journal of Optimization Theory and Applications, vol. 169, no. 3, pp. 1042–1068, 2016

    2016

  17. [17]

    Proportional–integral projected gradient method for conic optimization,

    Y . Yu, P. Elango, U. Topcu, and B. Ac ¸ıkmes ¸e, “Proportional–integral projected gradient method for conic optimization,”Automatica, vol. 142, p. 110359, 2022. [Online]. Available: https://www.sciencedirect. com/science/article/pii/S0005109822002096

    2022

  18. [18]

    Leveraging gpu batching for scalable nonlinear programming through massive lagrangian decomposition,

    Y . Kim, F. Pacaud, M. Schanen, K. Kim, and M. Anitescu, “Leveraging gpu batching for scalable nonlinear programming through massive lagrangian decomposition,”SIAM Journal on Scientific Computing, vol. 47, no. 5, pp. B1133–B1157, 2025. [Online]. Available: https://doi.org/10.1137/21M1450112

    doi:10.1137/21m1450112 2025

  19. [19]

    Accelerated computation and tracking of ac optimal power flow solutions using gpus,

    Y . Kim and K. Kim, “Accelerated computation and tracking of ac optimal power flow solutions using gpus,” inWorkshop Proceedings of the 51st International Conference on Parallel Processing, ser. ICPP Workshops ’22. New York, NY , USA: Association for Computing Machinery, 2023. [Online]. Available: https://doi.org/10.1145/3547276.3548631

    arXiv 2023

  20. [20]

    Gpu-accelerated sequential quadratic programming algorithm for solving acopf,

    B. Li and K. Kim, “Gpu-accelerated sequential quadratic programming algorithm for solving acopf,” in2024 IEEE 63rd Conference on Decision and Control (CDC), 2024, pp. 5016–5023

    2024

  21. [21]

    Gpu-accelerated dcopf using gradient- based optimization,

    S. S. Rafiei and S. Chevalier, “Gpu-accelerated dcopf using gradient- based optimization,” inProceedings of the Hawaii International Conference on System Sciences (HICSS), 2024. [Online]. Available: https://arxiv.org/abs/2406.13191

    Pith/arXiv arXiv 2024

  22. [22]

    Accurate and warm-startable linear cutting-plane relaxations for acopf,

    D. Bienstock and M. Villagra, “Accurate and warm-startable linear cutting-plane relaxations for acopf,” in2024 IEEE 63rd Conference on Decision and Control (CDC), 2024, pp. 5024–5031

    2024

  23. [23]

    Strong socp relaxations for the optimal power flow problem,

    B. Kocuk, S. S. Dey, and X. A. Sun, “Strong socp relaxations for the optimal power flow problem,”Operations Research, vol. 64, no. 6, p. 1177–1196, Dec. 2016. [Online]. Available: http://dx.doi.org/10.1287/ opre.2016.1489

    arXiv 2016

  24. [24]

    Mosek modeling cookbook,

    M. ApS, “Mosek modeling cookbook,” 2020

    2020

  25. [25]

    The power grid library for benchmarking ac optimal power flow algorithms,

    S. Babaeinejadsarookolaee, A. Birchfield, R. D. Christie, C. Coffrin, C. DeMarco, R. Diao, M. Ferris, S. Fliscounakis, S. Greene, R. Huang et al., “The power grid library for benchmarking ac optimal power flow algorithms,”arXiv preprint arXiv:1908.02788, 2019

    Pith/arXiv arXiv 1908

  26. [26]

    Powermodels.jl: An open-source framework for exploring power flow formulations,

    C. Coffrin, R. Bent, K. Sundar, Y . Ng, and M. Lubin, “Powermodels.jl: An open-source framework for exploring power flow formulations,” in 2018 Power Systems Computation Conference (PSCC), June 2018, pp. 1–8

    2018

  27. [27]

    Jump: A mod- eling language for mathematical optimization,

    M. Lubin, I. Dunning, J. Huchette, M. Lubinet al., “Jump: A mod- eling language for mathematical optimization,”INFORMS Journal on Computing, vol. 27, no. 2, pp. 238–248, 2015

    2015

  28. [28]

    Knitro: An integrated package for nonlinear optimization,

    R. H. Byrd, J. Nocedal, and R. A. Waltz, “Knitro: An integrated package for nonlinear optimization,” inLarge-Scale Nonlinear Optimization, G. Di Pillo and M. Roma, Eds. Springer, 2006, pp. 35–59

    2006

  29. [29]

    Mosek optimization software,

    MOSEK ApS, “Mosek optimization software,” https://www.mosek.com, 2026, version 11.0

    2026

  30. [30]

    On the implementation of an interior- point filter line-search algorithm for large-scale nonlinear programming,

    A. W ¨achter and L. T. Biegler, “On the implementation of an interior- point filter line-search algorithm for large-scale nonlinear programming,” Mathematical Programming, vol. 106, no. 1, pp. 25–57, 2006. APPENDIX A. AI Usage Disclosure The authors acknowledge the limited use of artificial in- telligence tools for minor editorial assistance, including te...

    2006