Certified and accurate SDP bounds for the ACOPF problem

We propose a new method for improving the bound tightness of the popular semidefinite programming (SDP) relaxation for the ACOPF introduced in Lavaei and Low (2012), Molzahn and Hiskens (2019). First, we reformulate the ACOPF Lagrangian dual as an unconstrained concave maximization problem with a cl...

Celý popis

Podrobná bibliografia

Vydané v:	Electric power systems research Ročník 212; s. 108278
Hlavní autori:	Oustry, Antoine, D’Ambrosio, Claudia, Liberti, Leo, Ruiz, Manuel
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 01.11.2022
Predmet:	AC optimal power flow Complex semidefinite programming Nonsmooth optimization Complex semidefinite programming AC optimal power flow Nonsmooth optimization
ISSN:	0378-7796, 1873-2046
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!