.png){kind=icon}
返回
Dynamic Sharing Through the ADMM
.png){kind=icon}
OA
AI
DOI：10.1109/TAC.2019.2940317.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, we study a dynamic version of the sharing problem, in which a dynamic system cost function composed of time-variant local costs of subsystems and a shared time-variant cost of the whole system is minimized. A dynamic alternating direction method of multipliers (ADMM) is proposed to track the varying optimal points of the dynamic optimization problem in an online manner. We analyze the convergence properties of the dynamic ADMM and show that, under several standard technical assumptions, the iterations of the dynamic ADMM converge linearly to some neighborhoods of the time-varying optimal points. The sizes of these neighborhoods depend on the drifts of the dynamic objective functions: the more drastically the dynamic objective function evolves across time, the larger the sizes of these neighborhoods. We also upper bound the limiting optimality gaps of the dynamic ADMM explicitly, and analyze its regret and constraint violation. Finally, two numerical examples are presented to corroborate the effectiveness of the proposed dynamic ADMM.
Keyword:
Power system dynamics
Heuristic algorithms
Cost function
Convergence
Signal processing algorithms
Convex functions
Alternating direction method of multipliers (ADMM)
dynamic optimization
the sharing problem
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7
论文数:
1.3W
被引数:
6.7W
机构
引用论文
Linear Convergence and Metric Selection for Douglas-Rachford Splitting and ADMMDouglas-Rachford分裂和ADMM的线性收敛和度量选择OAAI
OAAI分享收藏Disentangling in vivo the effects of iron content and atrophy on the ageing human brain.png)
NeuroImageOAAI
NeuroImageIF0
OAAI分享收藏IS IT POSSIBLE TO PREDICT THE MINIMUM SIZE OF THE ACQUIRED IMMUNODEFICIENCY SYNDROME (AIDS) EPIDEMIC IN THE UNITED KINGDOM?The Lancet
The LancetIF0
PREAI
分享收藏
查看更多内容