Fast SDP Relaxation of the Optimal Power Flow Using the Line-Wise Model for Representing Meshed Transmission Networks
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
In this paper, we propose a novel Semidefinite Programming (SDP) relaxation of the Optimal Power Flow (OPF) problem. The proposed formulation utilizes the Line-Wise Model (LWM) to represent meshed transmission networks. This allows the constraints of the proposed formulation to mostly depend on diagonal elements of the voltages' Hermitian <inline-formula><tex-math notation="LaTeX">${\bm{W}}$</tex-math></inline-formula> matrix in contrast to the Bus Injection Model (BIM) where constraints heavily utilize its off-diagonal elements. Test cases with bus sizes of 3 to 9241 were considered and chordal sparsity was exploited for them. Obtained results show that the proposed SDP-LW OPF formulation manages to provide solutions of similar or better quality for most test cases that belong to the Typical and Congested (TYP and API) Operating conditions. Furthermore, the proposed SDP-LW OPF formulation manages to reduce the solver's computational time for most of large-scale test cases with reductions up to 80.298%. Results analysis shows that reductions in the solver's computational time upon using the proposed SDP-LW OPF formulation are affected by its ability to significantly reduce constraints with off-diagonal elements of the <inline-formula><tex-math notation="LaTeX">${\bm{W}}$</tex-math></inline-formula> matrix without drastically increasing constraints with diagonal elements of the <inline-formula><tex-math notation="LaTeX">${\bm{W}}$</tex-math></inline-formula> matrix. Furthermore, the percentage of large sized cliques is found to affect the obtained reductions through its influence over the number of needed linking constraints for relating the elements of the <inline-formula><tex-math notation="LaTeX">${\bm{W}}$</tex-math></inline-formula> matrices of decomposed cliques.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it