A survey on conic relaxations of optimal power flow problem

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
Implementation of interior point methods for mixed semidefinite and second order cone optimization problems
PENNON: A code for convex nonlinear and semidefinite programming
Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
Solving semidefinite-quadratic-linear programs using SDPT3
Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
A dual algorithm for the solution of nonlinear variational problems via finite element approximation
Conic optimization via operator splitting and homogeneous self-dual embedding
On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
A new polynomial-time algorithm for linear programming
On the \(O(1/n)\) convergence rate of the Douglas-Rachford alternating direction method
A Newton-CG Augmented Lagrangian Method for Semidefinite Programming
Regularization Methods for Semidefinite Programming
Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
Parallel iterative methods for sparse linear systems
A unified approach to interior point algorithms for linear complementarity problems: A summary
Global optimization with polynomials and the problem of moments
A Globally Convergent Augmented Lagrangian Algorithm for Optimization with General Constraints and Simple Bounds
Breaking the Hierarchy: Distributed Control and Economic Optimality in Microgrids
The \(K\)-moment problem for compact semi-algebraic sets
Semidefinite programming relaxations for semialgebraic problems
A Nullstellensatz and a Positivstellensatz in semialgebraic geometry
On the Implementation and Usage of SDPT3 – A Matlab Software Package for Semidefinite-Quadratic-Linear Programming, Version 4.0
A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
Cones of Matrices and Set-Functions and 0–1 Optimization
An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm
Self-Scaled Barriers and Interior-Point Methods for Convex Programming
An Interior-Point Method for Semidefinite Programming
Exploiting Symmetries in SDP-Relaxations for Polynomial Optimization
Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
Alternating direction augmented Lagrangian methods for semidefinite programming
DSOS and SDSOS Optimization: More Tractable Alternatives to Sum of Squares and Semidefinite Optimization
A boundary point method to solve semidefinite programs
Problems of distance geometry and convex properties of quadratic maps
Complementarity and nondegeneracy in semidefinite programming
Exploiting sparsity in semidefinite programming via matrix completion. I: General framework
On the rank of extreme matrices in semidefinite programs and the multiplicity of optimal eigenvalues
Optimality conditions and finite convergence of Lasserre's hierarchy
Exploiting sparsity in linear and nonlinear matrix inequalities via positive semidefinite matrix completion
Representations of Non-Negative Polynomials, Degree Bounds and Applications to Optimization
Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
Primal-Dual Interior-Point Methods for Self-Scaled Cones
Smoothing technique and its applications in semidefinite optimization
Solving some large scale semidefinite programs via the conjugate residual method
Lagrangian duality and branch-and-bound algorithms for optimal power flow
A Linear-Programming Approximation of AC Power Flows
Low-Rank Optimization on the Cone of Positive Semidefinite Matrices
Determinant Maximization with Linear Matrix Inequality Constraints
Representations of non-negative polynomials having finitely many zeros
Optimisation globale et théorie des moments
A primal-dual potential reduction method for problems involving matrix inequalities
Exactness of Semidefinite Relaxations for Nonlinear Optimization Problems with Underlying Graph Structure
Strong duality in lasserre's hierarchy for polynomial optimization
Exploiting sparsity in semidefinite programming via matrix completion. II: Implementation and numerical results
Lasserre Hierarchy for Large Scale Polynomial Optimization in Real and Complex Variables
Convexification of Power Flow Equations in the Presence of Noisy Measurements
Strong SOCP Relaxations for the Optimal Power Flow Problem
A Low-Complexity Parallelizable Numerical Algorithm for Sparse Semidefinite Programming
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
A low-rank coordinate-descent algorithm for semidefinite programming relaxations of optimal power flow
Exact Convex Relaxation of Optimal Power Flow in Radial Networks
An Exact Convex Formulation of the Optimal Power Flow in Radial Distribution Networks Including Transverse Components
Quadratically Constrained Quadratic Programs on Acyclic Graphs With Application to Power Flow
Strong NP-hardness of AC power flows feasibility
Convex Restriction of Power Flow Feasibility Sets
Matrix minor reformulation and SOCP-based spatial branch-and-cut method for the AC optimal power flow problem
The principal minor test for semidefinite matrices
Decomposition in Conic Optimization with Partially Separable Structure
Conic Relaxations for Power System State Estimation With Line Measurements
New Dependencies of Hierarchies in Polynomial Optimization

Cited In (7)

Asymptotically tight conic approximations for chance-constrained AC optimal power flow
Operations research in optimal power flow: a guide to recent and emerging methodologies and applications
Robust approximation of chance constrained DC optimal power flow under decision-dependent uncertainty
A tight compact quadratically constrained convex relaxation of the optimal power flow problem
Sequencing paths of optimal control adjustments determined by the optimal reactive dispatch via Lagrange multiplier sensitivity analysis
Convex Relaxation of Optimal Power Flow—Part I: Formulations and Equivalence
A complementarity model for electric power transmission-distribution coordination under uncertainty

Uses Software

SeDuMi
SDPT3
PENNON
Mosek
SDPLR
SCS
SPOTless

This page was built for publication: A survey on conic relaxations of optimal power flow problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2023908)