Optimal Power Flow as a Polynomial Optimization Problem

Abstract

Formulating the alternating current optimal power flow (ACOPF) as a polynomial optimization problem makes it possible to solve large instances in practice and to guarantee asymptotic convergence in theory.

A more concise version, which also fixes a number of minor issues

References in corpus (1)

• Convex Relaxation of Optimal Power Flow, Part I: Formulations and Equivalence

Cited by in corpus (24)

• The Power Grid Library for Benchmarking AC Optimal Power Flow Algorithms
• Inexactness of SDP Relaxation and Valid Inequalities for Optimal Power Flow
• Convex Relaxations of Optimal Power Flow Problems: An Illustrative Example
• Recent Advances in Computational Methods for the Power Flow Equations
• Least Square Estimation-Based SDP Cuts for SOCP Relaxation of AC OPF
• Moment/Sum-of-Squares Hierarchy for Complex Polynomial Optimization
• Solution of Optimal Power Flow Problems using Moment Relaxations Augmented with Objective Function Penalization
• Mathematical Programming formulations for the Alternating Current Optimal Power Flow problem
• Lipschitz constant estimation of Neural Networks via sparse polynomial optimization
• A Low-Rank Coordinate-Descent Algorithm for Semidefinite Programming Relaxations of Optimal Power Flow
• MINLP in Transmission Expansion Planning
• Conic Optimization Theory: Convexification Techniques and Numerical Algorithms
• Hybrid Methods in Solving Alternating-Current Optimal Power Flows
• Completely positive and completely positive semidefinite tensor relaxations for polynomial optimization
• Alternative SDP and SOCP Approximations for Polynomial Optimization
• Entropy Penalized Semidefinite Programming
• Three Formulations of the Kuramoto Model as a System of Polynomial Equations
• A Polynomial-Time Method for Testing Admissibility of Uncertain Power Injections in Microgrids
• Computational Analysis of Sparsity-Exploiting Moment Relaxations of the OPF Problem
• A Fine-Grained Variant of the Hierarchy of Lasserre
• A Laplacian-Based Approach for Finding Near Globally Optimal Solutions to OPF Problems
• Moment Relaxations of Optimal Power Flow Problems: Beyond the Convex Hull
• Sparsity-Exploiting Moment-Based Relaxations of the Optimal Power Flow Problem
• Formulations and Approximations of the Branch Flow Model for Mesh Power Networks