A low-rank coordinate-descent algorithm for semidefinite programming relaxations of optimal power flow. (4th July 2017)

• Record Type: Journal Article
• Authors: Mareček, Jakub; Takáč, Martin
• Is Part Of: Optimization methods and software. Volume 32:Number 4(2017)
• Page Start: 849
• Page End: 871
• Publication Date: 2017-07-04
• Subjects: Optimization -- semidefinite programming -- power system analysis; Mathematical optimization -- Periodicals; Algorithms -- Periodicals; 519.7
• DOI: 10.1080/10556788.2017.1288729
• Languages: English
• ISSNs: 1055-6788

Abstract

Abstract : The alternating-current optimal power flow (ACOPF) is one of the best known non-convex nonlinear optimization problems. We present a novel re-formulation of ACOPF, which is based on lifting the rectangular power-voltage rank-constrained formulation, and makes it possible to derive alternative semidefinite programming relaxations. For those, we develop a first-order method based on the parallel coordinate descent with a novel closed-form step based on roots of cubic polynomials.