文章基本信息

标题：On fully distributed dual first order methods for convex network optimization
本地全文：下载
作者：Ion Necoara ; Valentin Nedelcu ; Dragos Clipici 等
期刊名称：IFAC PapersOnLine
印刷版ISSN：2405-8963
出版年度：2017
卷号：50
期号：1
页码：2788-2793
DOI：10.1016/j.ifacol.2017.08.628
语种：English
出版社：Elsevier
摘要：AbstractThis paper provides distributed optimization methods to carry out fully distributed computations in convex network optimization problems. The network constraints are moved into the cost using the Lagrange multipliers. For solving the dual problem we propose a fully distributed dual fast gradient algorithm having sublinear rate of convergence in terms of dual suboptimality but also in terms of primal suboptimality and feasibility violation for the last generated primal iterate. The convergence analysis combines the Lipschitz property of dual function with fast gradient schemes. The main application we consider is the DC optimal power flow problem from an electric energy system. Our approach allows to carry out an optimal dispatch for each bus to be done independently and in parallel while still achieving the global economical optimum of the whole electric system. The newly developed algorithms can be run distributively, as we show on several numerical simulations using classical IEEE bus test cases.
关键词：KeywordsConvex network optimizationdual first order methodsfully distributed computationsconvergence rate analysisoptimal power flow problemIEEE bus test cases