Certified and accurate SDP bounds for the ACOPF problem - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2022

Certified and accurate SDP bounds for the ACOPF problem

Résumé

We propose a new method for improving the bound tightness of the popular semidefinite programming (SDP) relaxation for the ACOPF introduced in [1], [2]. First, we reformulate the ACOPF Lagrangian dual as an unconstrained concave maximization problem with a clique decomposition induced sparse structure. We prove that this new formulation has the same optimal value as the SDP relaxation. We then use the solution of the SDP relaxation as a starting point for a tailored structure-aware bundle method. This post-processing technique significantly improves the tightness of the SDP bounds computed by the state-of-the-art solver MOSEK, as shown by our computational experiments on large-scale instances from PGLib-OPF v21.07. For ten of the tested instances, our post-processing decreases by more than 50% the optimality gap obtained with MOSEK.
Fichier principal
Vignette du fichier
certifiedSDPbound_ACOPF_oustryEtal_2022.pdf (429.72 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03613385 , version 1 (18-03-2022)

Identifiants

  • HAL Id : hal-03613385 , version 1

Citer

Antoine Oustry, Claudia d'Ambrosio, Leo Liberti, Manuel Ruiz. Certified and accurate SDP bounds for the ACOPF problem. 2022. ⟨hal-03613385⟩
89 Consultations
178 Téléchargements

Partager

Gmail Facebook X LinkedIn More