摘要
就时变网络拓扑图下智能电网中基于优化算法的分布式调度响应问题进行了研究.利用原对偶方法将带有约束的智能电网优化问题转化为一个无约束的优化问题同时提出相应的求解算法.该算法允许不同发电机之间采用异构常数步长进行更新,同时给出了算法的收敛速度.理论推导表明文中所提出的算法能以线性收敛的速度达到该问题的最优解.
In this paper,distributed dispatch response problems are investigated based on optimization algorithms in the smart grid over time-varying network topologies.The corresponding mathematical preliminaries are firstly given,then the constrained optimization problem in the smart grid is transformed into an unconstrained optimization problem with the primal dual method and,correspondingly,an algorithm for solving the problem is proposed.The algorithm allows different generators to adopt uncoordinated constant step-sizes to update the values,and its convergence speed is also given.A theoretical derivation indicates that the proposed algorithm can achieve the optimal solution at the linear convergence rate.
作者
张豪
韩易言
吕庆国
郑李逢
张亚南
ZHANG Hao;HAN Yi-yan;LU Qing-guo;ZHENG Li-feng;ZHANG Ya-nan(School of Electronic and Information Engineering,Southwest University,Chongqing 400715,China)
出处
《西南大学学报(自然科学版)》
CAS
CSCD
北大核心
2018年第7期177-180,共4页
Journal of Southwest University(Natural Science Edition)
基金
国家自然科学基金项目(61403314)
关键词
时变网络
智能电网
优化算法
原对偶算法
分布式调度响应
time-varying network
smart grid
optimization algorithm
primal dual algorithm
distributed dispatch response