{"title":"A distributed algorithm for fast optimal power flow regulation in Smart Grids","authors":"T. Erseghe","doi":"10.1109/SmartGridComm.2014.7007618","DOIUrl":null,"url":null,"abstract":"This paper deals with the solution of the optimal power flow (OPF) problem under voltage regulation by means of a distributed algorithm. Taking inspiration from the recent literature on distributed-OPF, the approach is developed via the alternating direction method of multipliers (ADMM), and provides a fully decentralized, scalable, very fast, and robust method, whose performance is shown in meaningful scenarios. Unlike most of the literature, no semidefinite programming (SDP) relaxations of the OPF problem is used, but local subproblems are addressed via efficient interior point methods (IPMs) to guarantee limited local processing efforts.","PeriodicalId":6499,"journal":{"name":"2014 IEEE International Conference on Smart Grid Communications (SmartGridComm)","volume":"514 1","pages":"31-36"},"PeriodicalIF":0.0000,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 IEEE International Conference on Smart Grid Communications (SmartGridComm)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SmartGridComm.2014.7007618","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5
Abstract
This paper deals with the solution of the optimal power flow (OPF) problem under voltage regulation by means of a distributed algorithm. Taking inspiration from the recent literature on distributed-OPF, the approach is developed via the alternating direction method of multipliers (ADMM), and provides a fully decentralized, scalable, very fast, and robust method, whose performance is shown in meaningful scenarios. Unlike most of the literature, no semidefinite programming (SDP) relaxations of the OPF problem is used, but local subproblems are addressed via efficient interior point methods (IPMs) to guarantee limited local processing efforts.