Strong SOCP relaxations for the optimal power flow problem
From MaRDI portal
Abstract: This paper proposes three strong second order cone programming (SOCP) relaxations for the AC optimal power flow (OPF) problem. These three relaxations are incomparable to each other and two of them are incomparable to the standard SDP relaxation of OPF. Extensive computational experiments show that these relaxations have numerous advantages over existing convex relaxations in the literature: (i) their solution quality is extremely close to that of the SDP relaxations (the best one is within 99.96% of the SDP relaxation on average for all the IEEE test cases) and consistently outperforms previously proposed convex quadratic relaxations of the OPF problem, (ii) the solutions from the strong SOCP relaxations can be directly used as a warm start in a local solver such as IPOPT to obtain a high quality feasible OPF solution, and (iii) in terms of computation times, the strong SOCP relaxations can be solved an order of magnitude faster than standard SDP relaxations. For example, one of the proposed SOCP relaxations together with IPOPT produces a feasible solution for the largest instance in the IEEE test cases (the 3375-bus system) and also certifies that this solution is within 0.13% of global optimality, all this computed within 157.20 seconds on a modest personal computer. Overall, the proposed strong SOCP relaxations provide a practical approach to obtain feasible OPF solutions with extremely good quality within a time framework that is compatible with the real-time operation in the current industry practice.
Recommendations
- An overview of semidefinite relaxations for optimal power flow problem
- On the r-uniform linear hypertrees with extremal Estrada indices
- Matrix minor reformulation and SOCP-based spatial branch-and-cut method for the AC optimal power flow problem
- A low-rank coordinate-descent algorithm for semidefinite programming relaxations of optimal power flow
- AC optimal power flow: a conic programming relaxation and an iterative MILP scheme for global optimization
Cites work
- A cycle-based formulation and valid inequalities for DC power transmission problems with switching
- A linear-programming approximation of AC power flows
- A polyhedral branch-and-cut approach to global optimization
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Convex quadratic relaxations for mixed-integer nonlinear programs in power systems
- Convex Relaxation of Optimal Power Flow—Part I: Formulations and Equivalence
- Convex Relaxation of Optimal Power Flow—Part II: Exactness
- Exploiting sparsity in semidefinite programming via matrix completion. I: General framework
- Exploiting sparsity in semidefinite programming via matrix completion. II: Implementation and numerical results
- Global optimization with polynomials and the problem of moments
- NESTA
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Semidefinite programming relaxations for semialgebraic problems
Cited in
(46)- Mathematical programming methods for microgrid design and operations: a survey on deterministic and stochastic approaches
- Global optimal power flow over large-scale power transmission networks
- Global optimization for optimal power flow over transmission networks
- Convex quadratic relaxations for mixed-integer nonlinear programs in power systems
- Multi-objective mean-variance-skewness model for nonconvex and stochastic optimal power flow considering wind power and load uncertainties
- Convexification of generalized network flow problem
- Matrix minor reformulation and SOCP-based spatial branch-and-cut method for the AC optimal power flow problem
- A game-theoretic analysis of transmission-distribution system operator coordination
- A survey on conic relaxations of optimal power flow problem
- AC optimal power flow: a conic programming relaxation and an iterative MILP scheme for global optimization
- Operations research in optimal power flow: a guide to recent and emerging methodologies and applications
- Sparse PSD approximation of the PSD cone
- On the r-uniform linear hypertrees with extremal Estrada indices
- An adaptive, multivariate partitioning algorithm for global optimization of nonconvex programs
- Strong NP-hardness of AC power flows feasibility
- A geometric way to build strong mixed-integer programming formulations
- On polyhedral and second-order cone decompositions of semidefinite optimization problems
- An overview of semidefinite relaxations for optimal power flow problem
- A simultaneous diagonalization based SOCP relaxation for convex quadratic programs with linear complementarity constraints
- Strengthened SDP relaxation for an extended trust region subproblem with an application to optimal power flow
- A two-level distributed algorithm for nonconvex constrained optimization
- Convex relaxations for quadratic on/off constraints and applications to optimal transmission switching
- scientific article; zbMATH DE number 6985727 (Why is no real title available?)
- Convexity/nonconvexity certificates for power flow analysis
- Robust Optimization for Electricity Generation
- Convexification of queueing formulas by mixed-integer second-order cone programming: an application to a discrete location problem with congestion
- Mixed-Projection Conic Optimization: A New Paradigm for Modeling Rank Constraints
- Hyperbolic Relaxation of $k$-Locally Positive Semidefinite Matrices
- The convex hull of a quadratic constraint over a polytope
- scientific article; zbMATH DE number 7663613 (Why is no real title available?)
- Mathematical programming formulations for the alternating current optimal power flow problem
- Mathematical programming formulations for the alternating current optimal power flow problem
- A SDP relaxation of an optimal power flow problem for distribution networks
- On eigenvalues of symmetric matrices with PSD principal submatrices
- Moving from linear to conic markets for electricity
- Robust feasibility of systems of quadratic equations using topological degree theory
- Subset Selection and the Cone of Factor-Width-k Matrices
- A tight compact quadratically constrained convex relaxation of the optimal power flow problem
- Fifty years of power systems optimization
- Discretization algorithms for generalized semi-infinite programs with coupling equality constraints under local solution stability
- Rank-one convexification for sparse regression
- A two-timescale neurodynamic algorithm for optimal power flow problem of radial networks
- Efficient bounds tightening based on SOCP relaxations for AC optimal power flow
- Accurate linear cutting-plane relaxations for ACOPF
- On the robustness and scalability of semidefinite relaxation for optimal power flow problems
- Unified value-based feedback, optimization and risk management in complex electric energy systems
This page was built for publication: Strong SOCP relaxations for the optimal power flow problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2957450)
