Alternative LP and SOCP Hierarchies for ACOPF Problems
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
The alternating current optimal power flow (ACOPF) problem optimizes the generation and the distribution of electric energy taking into account the active and the reactive power generation limits, demand requirements, bus voltage limits, and network flow limits. The ACOPF problem can be formulated as a nonconvex polynomial program that is generally difficult to solve due to the nonlinear power flow constraints. A recently proposed approach to globally solve the ACOPF problem is through the formulation of a hierarchy of semidefinite programs that are computationally challenging to solve for large-scale problems. In this paper, we explore a solution approach that alleviates this computational burden by using hierarchies of linear and second order cone programs and by exploiting the network structure of the transmission grid. Furthermore, we show that the first level of the second order cone hierarchy is equivalent to solving the conic dual of the approximation that was recently proposed in the literature, which provides the optimal solution of the ACOPF problem for special network topologies.
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.000 | 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.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| 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