Dual Conic Proxies for AC Optimal Power Flow

Fuente: arXiv
Guardado en:
Detalles Bibliográficos
Autores principales: Qiu, Guancheng, Tanneau, Mathieu, Van Hentenryck, Pascal
Formato: Preprint
Publicado: 2023
Materias:
Acceso en línea:
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
_version_ 1866917622371581952
author Qiu, Guancheng
Tanneau, Mathieu
Van Hentenryck, Pascal
author_facet Qiu, Guancheng
Tanneau, Mathieu
Van Hentenryck, Pascal
contents In recent years, there has been significant interest in the development of machine learning-based optimization proxies for AC Optimal Power Flow (AC-OPF). Although significant progress has been achieved in predicting high-quality primal solutions, no existing learning-based approach can provide valid dual bounds for AC-OPF. This paper addresses this gap by training optimization proxies for a convex relaxation of AC-OPF. Namely, the paper considers a second-order cone (SOC) relaxation of AC-OPF, and proposes \revision{a novel architecture} that embeds a fast, differentiable (dual) feasibility recovery, thus providing valid dual bounds. The paper combines this new architecture with a self-supervised learning scheme, which alleviates the need for costly training data generation. Extensive numerical experiments on medium- and large-scale power grids demonstrate the efficiency and scalability of the proposed methodology.
format Preprint
id arxiv_https___arxiv_org_abs_2310_02969
institution arXiv
publishDate 2023
record_format arxiv
spellingShingle Dual Conic Proxies for AC Optimal Power Flow
Qiu, Guancheng
Tanneau, Mathieu
Van Hentenryck, Pascal
Machine Learning
Optimization and Control
In recent years, there has been significant interest in the development of machine learning-based optimization proxies for AC Optimal Power Flow (AC-OPF). Although significant progress has been achieved in predicting high-quality primal solutions, no existing learning-based approach can provide valid dual bounds for AC-OPF. This paper addresses this gap by training optimization proxies for a convex relaxation of AC-OPF. Namely, the paper considers a second-order cone (SOC) relaxation of AC-OPF, and proposes \revision{a novel architecture} that embeds a fast, differentiable (dual) feasibility recovery, thus providing valid dual bounds. The paper combines this new architecture with a self-supervised learning scheme, which alleviates the need for costly training data generation. Extensive numerical experiments on medium- and large-scale power grids demonstrate the efficiency and scalability of the proposed methodology.
title Dual Conic Proxies for AC Optimal Power Flow
topic Machine Learning
Optimization and Control
url https://arxiv.org/abs/2310.02969