Strong SOCP Relaxations for the Optimal Power Flow Problem
From MaRDI portal
Publication:2957450
DOI10.1287/opre.2016.1489zbMath1354.90154arXiv1504.06770OpenAlexW3106117336MaRDI QIDQ2957450
X. Andy Sun, Burak Kocuk, Santanu S. Dey
Publication date: 26 January 2017
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1504.06770
Related Items (27)
Mathematical programming methods for microgrid design and operations: a survey on deterministic and stochastic approaches ⋮ 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 ⋮ On eigenvalues of symmetric matrices with PSD principal submatrices ⋮ Moving from linear to conic markets for electricity ⋮ Multi-objective mean-variance-skewness model for nonconvex and stochastic optimal power flow considering wind power and load uncertainties ⋮ Robust feasibility of systems of quadratic equations using topological degree theory ⋮ Subset Selection and the Cone of Factor-Width-k Matrices ⋮ A two-level distributed algorithm for nonconvex constrained optimization ⋮ Convexification of generalized network flow problem ⋮ The Convex Hull of a Quadratic Constraint over a Polytope ⋮ 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 ⋮ An adaptive, multivariate partitioning algorithm for global optimization of nonconvex programs ⋮ A survey on conic relaxations of optimal power flow problem ⋮ Mathematical programming formulations for the alternating current optimal power flow problem ⋮ Mathematical programming formulations for the alternating current optimal power flow problem ⋮ A geometric way to build strong mixed-integer programming formulations ⋮ On polyhedral and second-order cone decompositions of semidefinite optimization problems ⋮ Robust Optimization for Electricity Generation ⋮ 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 ⋮ A simultaneous diagonalization based SOCP relaxation for convex quadratic programs with linear complementarity constraints ⋮ 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
Uses Software
Cites Work
- NESTA
- Exploiting sparsity in semidefinite programming via matrix completion. II: Implementation and numerical results
- Semidefinite programming relaxations for semialgebraic problems
- Convex quadratic relaxations for mixed-integer nonlinear programs in power systems
- A polyhedral branch-and-cut approach to global optimization
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Exploiting Sparsity in Semidefinite Programming via Matrix Completion I: General Framework
- Global Optimization with Polynomials and the Problem of Moments
- A Cycle-Based Formulation and Valid Inequalities for DC Power Transmission Problems with Switching
- A Linear-Programming Approximation of AC Power Flows
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Convex Relaxation of Optimal Power Flow—Part I: Formulations and Equivalence
- Convex Relaxation of Optimal Power Flow—Part II: Exactness
This page was built for publication: Strong SOCP Relaxations for the Optimal Power Flow Problem
