A survey on conic relaxations of optimal power flow problem
From MaRDI portal
Publication:2023908
DOI10.1016/j.ejor.2020.01.034zbMath1487.90520OpenAlexW3003958345MaRDI QIDQ2023908
Ramtin Madani, Fariba Zohrizadeh, Ming Jin, Cédric Josz, Javad Lavaei, Somayeh Sojoudi
Publication date: 3 May 2021
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2020.01.034
Related Items
Robust approximation of chance constrained DC optimal power flow under decision-dependent uncertainty, Sequencing paths of optimal control adjustments determined by the optimal reactive dispatch via Lagrange multiplier sensitivity analysis, A complementarity model for electric power transmission-distribution coordination under uncertainty, 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
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- Solving semidefinite-quadratic-linear programs using SDPT3
- Conic optimization via operator splitting and homogeneous self-dual embedding
- Optimality conditions and finite convergence of Lasserre's hierarchy
- Alternating direction augmented Lagrangian methods for semidefinite programming
- Exploiting sparsity in linear and nonlinear matrix inequalities via positive semidefinite matrix completion
- A new polynomial-time algorithm for linear programming
- A boundary point method to solve semidefinite programs
- Smoothing technique and its applications in semidefinite optimization
- The \(K\)-moment problem for compact semi-algebraic sets
- A unified approach to interior point algorithms for linear complementarity problems: A summary
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- Problems of distance geometry and convex properties of quadratic maps
- Complementarity and nondegeneracy in semidefinite programming
- Exploiting sparsity in semidefinite programming via matrix completion. II: Implementation and numerical results
- A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
- Semidefinite programming relaxations for semialgebraic problems
- Matrix minor reformulation and SOCP-based spatial branch-and-cut method for the AC optimal power flow problem
- A primal-dual potential reduction method for problems involving matrix inequalities
- Strong NP-hardness of AC power flows feasibility
- Representations of non-negative polynomials having finitely many zeros
- A Nullstellensatz and a Positivstellensatz in semialgebraic geometry
- Exploiting Sparsity in Semidefinite Programming via Matrix Completion I: General Framework
- Global Optimization with Polynomials and the Problem of Moments
- Lectures on Modern Convex Optimization
- On the Rank of Extreme Matrices in Semidefinite Programs and the Multiplicity of Optimal Eigenvalues
- Solving Some Large Scale Semidefinite Programs via the Conjugate Residual Method
- On the Implementation and Usage of SDPT3 – A Matlab Software Package for Semidefinite-Quadratic-Linear Programming, Version 4.0
- On the $O(1/n)$ Convergence Rate of the Douglas–Rachford Alternating Direction Method
- Lagrangian Duality and Branch-and-Bound Algorithms for Optimal Power Flow
- A Linear-Programming Approximation of AC Power Flows
- Strong SOCP Relaxations for the Optimal Power Flow Problem
- Equivalent Relaxations of Optimal Power Flow
- Exact Convex Relaxation of Optimal Power Flow in Radial Networks
- A Newton-CG Augmented Lagrangian Method for Semidefinite Programming
- Low-Rank Optimization on the Cone of Positive Semidefinite Matrices
- Decomposition in Conic Optimization with Partially Separable Structure
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- A Globally Convergent Augmented Lagrangian Algorithm for Optimization with General Constraints and Simple Bounds
- On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
- Representations of Non-Negative Polynomials, Degree Bounds and Applications to Optimization
- The principal minor test for semidefinite matrices
- 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
- Determinant Maximization with Linear Matrix Inequality Constraints
- Primal-Dual Interior-Point Methods for Self-Scaled Cones
- 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
- An Exact Convex Formulation of the Optimal Power Flow in Radial Distribution Networks Including Transverse Components
- A low-rank coordinate-descent algorithm for semidefinite programming relaxations of optimal power flow
- Conic Relaxations for Power System State Estimation With Line Measurements
- A Low-Complexity Parallelizable Numerical Algorithm for Sparse Semidefinite Programming
- Lasserre Hierarchy for Large Scale Polynomial Optimization in Real and Complex Variables
- Optimisation globale et théorie des moments
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
- An Interior-Point Method for Semidefinite Programming
- New Dependencies of Hierarchies in Polynomial Optimization
- Exploiting Symmetries in SDP-Relaxations for Polynomial Optimization
- Regularization Methods for Semidefinite Programming
- Convex Restriction of Power Flow Feasibility Sets
- Convexification of Power Flow Equations in the Presence of Noisy Measurements
- Exactness of Semidefinite Relaxations for Nonlinear Optimization Problems with Underlying Graph Structure
- Convex Relaxation of Optimal Power Flow—Part I: Formulations and Equivalence
- Convex Relaxation of Optimal Power Flow—Part II: Exactness
- Quadratically Constrained Quadratic Programs on Acyclic Graphs With Application to Power Flow
- Breaking the Hierarchy: Distributed Control and Economic Optimality in Microgrids
- DSOS and SDSOS Optimization: More Tractable Alternatives to Sum of Squares and Semidefinite Optimization
- Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
- Strong duality in lasserre's hierarchy for polynomial optimization
