{"id":"0c828304-dcd5-4986-8d5e-791358968342","arxiv_id":"1908.02319","paper_version":1,"verdict":"CONDITIONAL","confidence":"HIGH","novelty_score":6.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"Proposes the tight-and-cheap conic relaxation (TCR) for ACOPF, stronger than SOCR, nearly as tight as SDR on many cases, and significantly faster than the chordal SDP relaxation.","lead":"A new conic relaxation for the AC optimal power flow problem sits between second-order cone and semidefinite relaxations, with near-SDP tightness at much lower solver cost. It offers a practical trade-off for computing bounds on large power networks.","discovery_kind":"new_method","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Speedup claim rests on a non-specialized chordal baseline; verify with a chordal-exploiting solver.","rationale":"I read the paper in good faith and checked the mathematical core. Proposition 2 (nSDR = SDR) is valid: the construction v = V e1 / sqrt(V11) and the Schur complement argument establish equivalence without hidden assumptions, given positive voltage bounds. Proposition 3 (STCR >= TCR) and Proposition 4 (STCR = SDR on graphs where removing the reference bus leaves a forest) also check out: the chordal graph argument is standard and the clique structure is correctly identified. The hierarchy SOCR <= TCR <= STCR <= SDR is therefore sound. The reported numerical gaps are qualitatively consistent with the theory. The weak point is the computational comparison. The paper's own text admits CHR time excludes chordal extension construction, and CVX is used uniformly. CVX's handling of multiple PSD blocks is not a chordal solver; it does not exploit the completion theorem that underlies the chordal relaxation. Since the abstract's main selling point is speed, this baseline choice is load-bearing. The reader flagged exactly this as the weakest assumption and I agree. I would not change the conditional verdict: the theoretical contribution is solid, but the practical speed claim needs a fairer head-to-head against a specialized chordal implementation. The proposed concrete test would settle whether the speed advantage is real.","tokens_in":16037,"tokens_out":8506,"duration_ms":90291,"concrete_test":"Re-run Tables I and II with a chordal-sparsity-exploiting SDP solver (e.g., SparseCoLO combined with MOSEK, or the OPF solver of [27]) on the same MATPOWER cases, collecting end-to-end wall time including chordal extension and clique identification. Compare against TCR under identical hardware, tolerance, and objective functions. If CHR times drop to within a factor of 2-3 of TCR on the large-scale cases (current ratio is around 30x), the 'order of magnitude' speedup claim is materially weakened.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The central applied claim is that TCR is up to an order of magnitude faster than the chordal relaxation (Abstract; Section V). The comparison uses CVX 2.1 with MOSEK for every relaxation, including CHR. CVX passes each PSD block to the solver as a generic constraint and does not exploit the clique-tree structure that makes chordal SDPs scalable. The paper cites specialized chordal implementations [25]-[27] but does not benchmark against them, so the reported CHR times likely overstate the cost of a properly implemented chordal relaxation. The exclusion of chordal-extension construction time is actually a concession to CHR, so that detail is not the problem; the problem is the generic-solver baseline. The theoretical results (Propositions 2-4) appear sound, isolating the vulnerability to the computational speed claim. If a state-of-the-art chordal solver closes the gap, the abstract's 'one order of magnitude' speedup may not survive.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper proposes a new convex relaxation for the AC optimal power flow problem, obtained by combining semidefinite constraints with reformulation-linearization inequalities on voltage magnitudes. The authors first introduce nSDR, a reformulation of the standard SDP relaxation with additional voltage variables and an RLT constraint at the reference bus, and prove in Proposition 2 that nSDR is equivalent to SDR. They then drop the global positive-semidefinite constraint to local 3-by-3 blocks, obtaining the tight-and-cheap relaxation (TCR), and a further strengthened variant (STCR) using 3-by-3 principal submatrices anchored at the reference bus. Propositions 3 and 4 establish that STCR is stronger than TCR and, for networks whose graph becomes acyclic after removing the reference bus, equivalent to SDR. Computational experiments on MATPOWER instances up to 6515 buses compare TCR and STCR with SOCR, CHR, and SDR in terms of optimality gap and solver time. The paper claims that TCR is stronger than SOCR, nearly as tight as SDR, and up to an order of magnitude faster than the chordal relaxation.","tokens_in":16144,"tokens_out":5492,"duration_ms":61820,"significance":"The theoretical hierarchy in the paper is clean and the proofs of Propositions 2-4 are self-contained and correct; the nSDR/TCR construction is a legitimate and potentially useful way to localize the semidefinite constraint in OPF relaxations. The empirical study is also carefully done in one respect: the authors use unmodified MATPOWER cases and report both cost and loss objectives, with no fitted parameters. However, two load-bearing applied claims are not fully supported by the evidence as presented. First, the abstract's 'nearly as tight as SDR' is contradicted by the paper's own tables on instances where the SDR bound is not already near-exact. Second, the speed comparison against the chordal relaxation is made with a generic CVX/MOSEK interface that does not exploit chordal structure, so the reported speedups may not represent a state-of-the-art chordal SDP solver. If these computational claims are hardened or appropriately qualified, the paper would be a solid contribution to the OPF relaxation literature.","major_comments":[{"comment":"The claim that TCR is 'nearly as tight as the standard semidefinite relaxation' is not supported on instances where SDR itself has a non-negligible gap. In Table I, case5 has a TCR optimality gap of 12.75% versus 5.22% for both SDR and CHR, and case_ACTIV_SG_500 has a TCR gap of 4.39% versus 2.11% for SDR/CHR. The paper acknowledges these discrepancies in Section V, bullet 3, but the abstract and conclusion state the tightness claim without qualification. The authors should either restrict the closeness claim to instances where the SDR bound is already tight, or add a quantitative statement about the worst-case or instance-dependent gap between TCR and SDR.","section":"Abstract and Section V, Tables I and II"},{"comment":"The central speed claim, that TCR is up to an order of magnitude faster than the chordal relaxation, is measured by solving every relaxation with CVX 2.1 and MOSEK 8.0.0.60 under default settings. CVX passes each positive-semidefinite block to the solver as a generic constraint and does not exploit the clique tree that makes chordal SDP relaxations scalable, while the paper cites specialized chordal implementations in [25]-[27]. The CHR times in Tables I and II are therefore likely not representative of a properly implemented chordal relaxation, and the abstract's speedup claim needs to be either benchmarked against a chordal-exploiting solver or explicitly limited to generic SDP solvers.","section":"Section V, first paragraphs and Tables I and II"}],"minor_comments":[{"comment":"The initialization line contains a doubled word: 'LG + I|N| ≻ 0, where LG is the Laplacian matrix of G and and I|N| is the identity matrix of size |N|.' Please fix the typo.","section":"Model 2"},{"comment":"The sentence 'Both objective functions of test cases from [36] are the same' is ambiguous. Please clarify that for the RTE/PEGASE cases the generation-cost coefficients already encode active loss, which explains why the large-scale rows of Tables I and II are identical.","section":"Section V, paragraph before Tables I and II"},{"comment":"It would help the reader to state explicitly that constraint (8) implies the usual 2-by-2 SOCR constraints by taking the leading 2-by-2 principal submatrix, rather than leaving the domination argument entirely to the phrase 'Clearly TCR dominates SOCR.'","section":"Section IV, Model 5"}],"recommendation":"major_revision","confidential_remarks":"The theoretical content appears sound and the paper is within the scope of the journal. My recommendation of major revision is driven by the two unsupported applied claims: the unqualified tightness claim and the comparison against a non-specialized chordal solver. Both are fixable either by additional experiments or by careful rewording of the abstract and conclusions. If the authors can benchmark against a specialized chordal SDP solver and show that the speedup substantially survives, I would support acceptance; if not, the claims should be narrowed accordingly."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Here's my take on 1908.02319. The useful new thing is the nSDR/TCR construction: adding an explicit voltage vector v with the 3x3 PSD constraints (8) gives a relaxation that provably sits between SOCR and SDR. Proposition 2 (nSDR equivalent to SDR) is neat and correct, and Proposition 4 gives a clean exactness condition when the network without the reference bus is a forest. The proofs are self-contained and I found no circularity.\n\nThe computational study is honest in several ways: unmodified MATPOWER data, both cost and loss objectives, and they visibly report STCR's stronger tightness. But the abstract's 'nearly as tight as SDR' is too strong. Their own Table I shows case5 with TCR gap 12.75% vs SDR 5.22%, and ACTIV_SG_500 with 4.39% vs 2.11%. Those are not 'nearly as tight' in any meaningful sense; the right statement is 'sometimes close, sometimes meaningfully looser.'\n\nThe bigger soft spot is the timing comparison. TCR is compared against CHR using CVX with MOSEK, which treats the chordal PSD blocks as generic constraints. The specialized chordal implementations cited in the paper (Molzahn et al., Andersen et al.) exploit the clique tree and are likely much faster than the CVX baseline. The claimed order-of-magnitude speedup may shrink substantially against a proper chordal solver. The exclusion of chordal extension construction time is actually a small concession to CHR, so that's not the problem. The problem is the generic baseline. I also would have liked a direct comparison with Kocuk et al.'s strong SOCP relaxations, which is the natural baseline for the tight-and-cheap trade-off.\n\nNone of this undermines the theoretical result. The relaxation is new, the proofs check out, and for practitioners using CVX/MOSEK it is indeed faster and tighter than SOCR on these instances. But the paper should be revised to soften the abstract, add the missing baseline, and ideally benchmark with a chordal solver.\n\nI'd send it to peer review. The math deserves referee time and the computational claims can be tested. I'd bring it to reading group and likely cite it.","headline":"Solid new conic relaxation for ACOPF with correct proofs, but the abstract overstates tightness and the speed claims rest on a generic CVX baseline for chordal SDPs.","tokens_in":16676,"tokens_out":1761,"would_cite":true,"duration_ms":17959,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["90C22","90C26"],"pacs":[],"model":"deepseek-v4-flash","headline":"This paper introduces a conic relaxation for AC optimal power flow that is stronger than the second-order cone relaxation, nearly as tight as the semidefinite relaxation, and much faster to solve than the chordal relaxation on large…","keywords":["AC optimal power flow","conic relaxation","semidefinite programming","second-order cone programming","reformulation-linearization technique","chordal relaxation","convex relaxation","power systems"],"falsifier":"Run a timing comparison on the 6515-bus test network using a semidefinite solver that exploits sparsity, including the time to construct the chordal extension; if the sparsity-exploiting relaxation then solves in time comparable to or less than TCR while giving the same bound, the paper's central speed claim is refuted.","tokens_in":15831,"feed_emoji":"⚡","tokens_out":11940,"duration_ms":115792,"temperature":0.7,"pith_summary":"The paper proposes a new convex relaxation, the tight-and-cheap relaxation (TCR), for the alternating-current optimal power flow problem, a nonconvex and NP-hard problem central to power-system operations. TCR is built by combining semidefinite constraints with reformulation-linearization (RLT) inequalities on voltage magnitudes, and it is shown to be stronger than the standard second-order cone relaxation and nearly as tight as the full semidefinite relaxation. The authors prove that a closely related formulation is exactly equivalent to the standard SDP relaxation, so TCR inherits a rigorous lower-bounding property. On standard test networks with up to 6515 buses, TCR's optimality gap is close to SDR's, and its solve time is about 30 times lower than the chordal relaxation on large instances and 55 times lower on the largest ones. A strengthened variant, STCR, is tighter still and coincides with SDR when the network minus the reference bus is acyclic.","feed_headline":"Fast conic relaxation nearly matches strongest power-flow bound","feed_subtitle":"On networks up to 6,515 buses it keeps optimality gaps near the strongest provable bound while solving far faster.","key_machinery":"The load-bearing object is the per-branch $3\\times3$ semidefinite block\n$$\n\\begin{bmatrix} 1 & v_k^* & v_m^* \\\\ v_k & V_{kk} & V_{km} \\\\ v_m & V_{km}^* & V_{mm} \\end{bmatrix} \\succeq 0,\n$$\nimposed for every branch $(k,m)$. This block simultaneously encodes the second-order cone relation $|V_{km}|^2 \\le V_{kk}V_{mm}$ and couples the complex voltage variables $v$ to $V$. The RLT ingredient is a secant lower bound on the concave square root: Lemma 1 gives $\\sqrt{y} \\ge (y + \\sqrt{\\ell u})/(\\sqrt{\\ell}+\\sqrt{u})$ on $\\ell \\le y \\le u$, applied to $V_{11}=|v_1|^2$ to yield the reference-bus inequality $\\mathrm{Re}(v_1) \\ge (V_{11}+\\underline{v}_1\\overline{v}_1)/(\\underline{v}_1+\\overline{v}_1)$. That inequality is what lets the proof recover $v$ from $V$, making the equivalence between nSDR and SDR go through.","core_discovery":"The central discovery is that the full positive semidefinite constraint $V \\succeq 0$ in the standard SDP relaxation can be replaced, without losing tightness, by the combination of $V \\succeq vv^H$ (where $v$ is the complex voltage vector) and a single RLT inequality at the reference bus. Proposition 2 constructs, for any feasible $V$, the vector $v = Ve_1/\\sqrt{V_{11}}$ and uses Schur-complement reasoning to show this pair satisfies the new constraints, so the new semidefinite relaxation nSDR is exactly equivalent to SDR. Replacing the global constraint $V \\succeq vv^H$ by per-branch $3\\times3$ semidefinite blocks on $(1, v_k, v_m)$ yields TCR, which dominates the second-order cone relaxation and is dominated by SDR. The strengthened STCR, which uses the $3\\times3$ principal submatrices on the reference bus together with each branch, is strictly stronger than TCR and is proven equivalent to SDR when the network graph with the reference bus removed has no cycles. On unmodified test cases up to 6515 buses, TCR's optimality gaps are close to SDR's while its solve times are about 30 times lower than the chordal relaxation on large instances.","pith_inferences":["The same construction could be applied at other buses: adding RLT cuts on more voltage magnitudes, or on branch current magnitudes, would likely tighten TCR further while preserving its local structure; the paper only uses the reference bus.","The equivalence strategy of Proposition 2 — global PSD replaced by $V \\succeq vv^H$ plus one scalar RLT cut at an anchor variable — may transfer to other complex quadratically constrained programs with bounded magnitudes, not just power flow.","The speed comparison uses a generic solver for the sparsity-exploiting relaxation and does not count the time to build its chordal structure; a purpose-built solver could narrow TCR's advantage, so the 'cheap' part should be revalidated in production-grade software."],"forward_implications":["On large networks, TCR gives a lower bound within a few hundredths of a percent of the SDP bound while solving roughly 30 times faster than the chordal relaxation, making SDP-quality bounds practical at scales where the full SDP was too slow.","Because TCR uses only per-branch $3\\times3$ semidefinite blocks, it avoids storing or factoring an $n\\times n$ positive semidefinite matrix, which is the main source of SDP's computational cost.","STCR is strictly tighter than TCR and is equivalent to SDR for networks whose graph minus the reference bus has no cycles, so SDP-quality bounds can be obtained cheaply on such topologies.","As a valid relaxation, TCR provides a certificate (lower bound) on the global optimum of ACOPF, so it can be used to bound the suboptimality of any local solution found by nonlinear solvers."],"supporting_citations":[{"why":"defines the standard second-order cone relaxation that TCR dominates.","marker":"[9]"},{"why":"defines the standard semidefinite relaxation that TCR approximates.","marker":"[10]"},{"why":"introduces the chordal sparsity-exploiting relaxation used as the computational baseline.","marker":"[11]"},{"why":"establishes the hierarchy among SDP, chordal, and SOCP relaxations and the radial-network equivalence.","marker":"[12]"},{"why":"provides the positive-definite completion result that makes chordal and block-PSD constraints equivalent to global PSD.","marker":"[22]"},{"why":"gives the RLT secant inequalities for bilinear products used to bound |V_km|.","marker":"[29]"},{"why":"shows that SDP combined with RLT can yield better bounds than either alone.","marker":"[30]"},{"why":"proves the SDP-plus-RLT representation of the convex hull of bounded rank-one matrices, motivating the constraint V ≽ vv^H with RLT cuts.","marker":"[31]"},{"why":"justifies relaxing in complex variables before converting to real variables.","marker":"[33]"},{"why":"the modeling environment used for all timing comparisons; changes to this environment could affect the measured speedups.","marker":"[37]"}],"fun_headline_variants":["Tighter than SOCP, faster than SDR: new AC-OPF conic relaxation","Near-SDR tightness at one-tenth the time: new conic relaxation","Conic relaxation for AC-OPF: 30x faster than chordal, near-SDP gap","Faster power-flow bounds: TCR beats SOCP, nearly matches SDR"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The speed advantage rests on comparing TCR against a sparsity-exploiting semidefinite relaxation that is solved with a generic solver and timed without counting the cost of building the sparsity structure; a purpose-built solver could shrink that advantage.","fun_headline_variants_meta":{"raw":{"variants":["Tighter than SOCP, faster than SDR: new AC-OPF conic relaxation","Near-SDR tightness at one-tenth the time: new conic relaxation","Conic relaxation for AC-OPF: 30x faster than chordal, near-SDP gap","Faster power-flow bounds: TCR beats SOCP, nearly matches SDR"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000573,"raw_usage":{"total_tokens":2728,"prompt_tokens":988,"completion_tokens":1740,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":604,"completion_tokens_details":{"reasoning_tokens":1646}},"tokens_in":604,"tokens_out":1740,"duration_ms":14860,"temperature":1.0,"reasoning_tokens":1646,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-14T14:47:46.131499+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Run a timing comparison on the 6515-bus test network using a semidefinite solver that exploits sparsity, including the time to construct the chordal extension; if the sparsity-exploiting relaxation then solves in time comparable to or less than TCR while giving the same bound, the paper's central speed claim is refuted.","supporting_citations":[{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"defines the standard second-order cone relaxation that TCR dominates."},{"cited_title":"Semidefinite programming for optimal power flow problems","cited_arxiv_id":null,"evidence_quote":"defines the standard semidefinite relaxation that TCR approximates."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"introduces the chordal sparsity-exploiting relaxation used as the computational baseline."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"establishes the hierarchy among SDP, chordal, and SOCP relaxations and the radial-network equivalence."},{"cited_title":"Johnson, Eduardo M","cited_arxiv_id":null,"evidence_quote":"provides the positive-definite completion result that makes chordal and block-PSD constraints equivalent to global PSD."},{"cited_title":"McCormick","cited_arxiv_id":null,"evidence_quote":"gives the RLT secant inequalities for bilinear products used to bound |V_km|."},{"cited_title":"Anstreicher","cited_arxiv_id":null,"evidence_quote":"shows that SDP combined with RLT can yield better bounds than either alone."},{"cited_title":"Anstreicher and Samuel Burer","cited_arxiv_id":null,"evidence_quote":"proves the SDP-plus-RLT representation of the convex hull of bounded rank-one matrices, motivating the constraint V ≽ vv^H with RLT cuts."},{"cited_title":"Moment/Sum-of-Squares Hierarchy for Complex Polynomial Optimization","cited_arxiv_id":"1508.02068","evidence_quote":"justifies relaxing in complex variables before converting to real variables."},{"cited_title":"CVX: MA TLAB software for discipline d convex programming, version 2.1","cited_arxiv_id":null,"evidence_quote":"the modeling environment used for all timing comparisons; changes to this environment could affect the measured speedups."}],"review_version":1}