惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

Stack Overflow Blog
Stack Overflow Blog
云风的 BLOG
云风的 BLOG
Cyber Security Advisories - MS-ISAC
Cyber Security Advisories - MS-ISAC
Recent Announcements
Recent Announcements
Microsoft Security Blog
Microsoft Security Blog
Microsoft Azure Blog
Microsoft Azure Blog
J
Java Code Geeks
D
DataBreaches.Net
U
Unit 42
P
Proofpoint News Feed
I
InfoQ
Apple Machine Learning Research
Apple Machine Learning Research
Google DeepMind News
Google DeepMind News
博客园 - Franky
博客园_首页
IT之家
IT之家
博客园 - 叶小钗
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More
酷 壳 – CoolShell
酷 壳 – CoolShell
博客园 - 【当耐特】
Hugging Face - Blog
Hugging Face - Blog
OSCHINA 社区最新新闻
OSCHINA 社区最新新闻
让小产品的独立变现更简单 - ezindie.com
让小产品的独立变现更简单 - ezindie.com
阮一峰的网络日志
阮一峰的网络日志

math updates on arXiv.org

Coupling-Robust Accuracy in Multiphysics Physics Informed Neural Networks via Kronecker-Preconditioned Optimization Non-normal spectral signatures of instability in neural network training dynamics Optimization of randomized neural networks for transfer operator approximation Selective Ambulance Dispatch Under Contextual Travel-Time Uncertainty LLAMA LIMA: A Living Meta-Analysis on the Effects of Generative AI on Learning Mathematics Neural Flow Operators can Approximate any Operator: Abstract Frameworks and Universal Approximations LLMs as Noisy Channels: A Shannon Perspective on Model Capacity and Scaling Laws On the Stability of Spherical Hellinger-Kantorovich Flows and Their Implications for Differential Privacy Training-Free Looped Transformers Move on Muon : A Hamiltonian probability gradient flow perspective of Muon optimizer Entrywise Error Bounds for Spectral Ranking with Semi-Random Adversaries Asymmetric Scaling Laws from Sparse Features Is Dimensionality a Barrier for Retrieval Models? RA-DCA: A Randomized Active-Set DCA for Directional Stationarity in Max-Structured DC Programs Commutator-Induced Uncertainty in VAEs Weisfeiler-Leman Is Incomplete on Simple Spectrum Graphs, so Canonicalize Them Sparse In-Network Learning via Shortest-Path Backpropagation and Finite-Rate Gating Instance-Optimal Estimation with Multiple LLM Judges on a Budget Entropy Equivalence Testing Expand More, Shrink Less: Shaping Effective-Rank Dynamics for Dense Scaling in Recommendation Any-Dimensional Invariant Universality Operationalizing Individual Fairness via Gradient Descent and Bradley-Terry Models Anytime Training with Schedule-Free Spectral Optimization Diffusion-based Denoising Beats Vanilla Score Matching in Parameter Estimation: A Theoretical Explanation Resilience Characterization of AI-Native Wireless Receivers via Persistent Homology The General Theory of Localization Methods Group-Algebraic Tensors: Provably-optimal Equivariant Learning and Physical Symmetry Discovery General Lower Bounds for Differentially Private Federated Learning with Arbitrary Public-Transcript Interactions PilotWiMAE: Pilot-Native Representation Learning for Wireless Channels Proximal basin hopping: global optimization with guarantees
A Bilevel Optimization Model for Bottom-Up Coordination o...
[Submitted on 16 Jun 2026] · 2026-06-17 · via math updates on arXiv.org

View PDF HTML (experimental)

Abstract:The increasing penetration of distributed energy resources (DERs) is transforming low-voltage (LV) networks into active systems, including energy communities, whose generation, storage, and energy exchange activities require enhanced coordination with upstream medium-voltage (MV) networks. In the proposed Stackelberg structure, a local market operator aggregates multiple LV communities and acts as a single leader, determining DER operations and boundary energy exchanges, while the MV network serves as the follower, ensuring efficient system feasibility through an economic dispatch that includes both conventional and utility-scale PV generation. The proposed bottom-up coordination scheme concentrates discrete DER scheduling at the LV level while the MV level retains a convex continuous formulation, enabling an exact single-level reformulation via the Karush-Kuhn-Tucker (KKT) conditions. In addition, a distributed coordination algorithm that combines Lagrangian Dual Decomposition (LDD) with the Alternating Direction Method of Multipliers (ADMM) is developed to coordinate LV communities in parallel while preserving data confidentiality. The framework is validated using the IEEE 33-bus system at the MV level and six European 206-bus LV test feeders. Results indicate that the LDD-ADMM algorithm closely matches the exact reformulation, with an average relative deviation of 1.7e-4, with deviations confined to periods of scarcity for the cheap resource. Furthermore, leaders' decisions can induce operating conditions that increase followers' costs relative to their independently optimal dispatch, a pattern reinforced by comparison with a feasibility-based single-level relaxation that satisfies the required energy exchanges but fails to achieve a cost-efficient allocation of MV resources.

Submission history

From: Fernando García Muñoz [view email]
[v1] Tue, 16 Jun 2026 10:36:14 UTC (1,800 KB)