An overview of semidefinite relaxations for optimal power flow problem
From MaRDI portal
Recommendations
- A low-rank coordinate-descent algorithm for semidefinite programming relaxations of optimal power flow
- Strong SOCP relaxations for the optimal power flow problem
- On the robustness and scalability of semidefinite relaxation for optimal power flow problems
- 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
Cites work
- 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
- Equivalent Relaxations of Optimal Power Flow
- Exact Convex Relaxation of Optimal Power Flow in Radial Networks
- Exploiting sparsity in semidefinite programming via matrix completion. I: General framework
- Global optimization with polynomials and the problem of moments
- Minimal rank completions for block matrices
- Moments, positive polynomials and their applications
- Positive definite completions of partial Hermitian matrices
- Semidefinite Programming
Cited in
(21)- Global optimization for optimal power flow over transmission networks
- Convex quadratic relaxations for mixed-integer nonlinear programs in power systems
- Matrix minor reformulation and SOCP-based spatial branch-and-cut method for the AC optimal power flow problem
- 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
- On the r-uniform linear hypertrees with extremal Estrada indices
- A fast algorithm for the semi-definite relaxation of the state estimation problem in power grids
- A semismooth Newton method for solving optimal power flow
- Strengthened SDP relaxation for an extended trust region subproblem with an application to optimal power flow
- Strong SOCP relaxations for the optimal power flow problem
- scientific article; zbMATH DE number 6985727 (Why is no real title available?)
- A low-rank coordinate-descent algorithm for semidefinite programming relaxations of optimal power flow
- Convexity/nonconvexity certificates for power flow analysis
- Exactness of semidefinite relaxations for nonlinear optimization problems with underlying graph structure
- Convex Relaxation of Optimal Power Flow—Part I: Formulations and Equivalence
- 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 the determination of the region border prior to the limit steady modes of electric power systems by the analysis method of the tropical geometry of the power balance equations
- On the robustness and scalability of semidefinite relaxation for optimal power flow problems
This page was built for publication: An overview of semidefinite relaxations for optimal power flow problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2320274)
