Matrix minor reformulation and SOCP-based spatial branch-and-cut method for the AC optimal power flow problem

DOI10.1007/S12532-018-0150-9zbMath1411.90249arXiv1703.03050OpenAlexW3101679863WikidataQ129150056 ScholiaQ129150056MaRDI QIDQ1741115

Santanu S. Dey, Burak Kocuk, X. Andy Sun

Publication date: 3 May 2019

Published in: Mathematical Programming Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1703.03050

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26) Quadratic programming (90C20)

Related Items (12)

Hyperbolic Relaxation of $k$-Locally Positive Semidefinite Matrices ⋮ Convexifications of rank-one-based substructures in QCQPs and applications to the pooling problem ⋮ Adaptive Bundle Methods for Nonlinear Robust Optimization ⋮ Outer-product-free sets for polynomial optimization and oracle-based cuts ⋮ The Convex Hull of a Quadratic Constraint over a Polytope ⋮ 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 ⋮ Strong NP-hardness of AC power flows feasibility ⋮ New SOCP relaxation and branching rule for bipartite bilinear programs ⋮ 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

Uses Software

• SDPT3
• Mosek
• MATPOWER
• APOGEE
• OPF
• NESTA
• Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• NESTA
• Relaxations and discretizations for the pooling problem
• Linear programs with an additional reverse convex constraint
• Exploiting sparsity in semidefinite programming via matrix completion. II: Implementation and numerical results
• A spatial branch-and-cut method for nonconvex QCQP with bounded complex variables
• Convex quadratic relaxations for mixed-integer nonlinear programs in power systems
• A polyhedral branch-and-cut approach to global optimization
• Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
• Outer-product-free sets for polynomial optimization and oracle-based cuts
• Exploiting Sparsity in Semidefinite Programming via Matrix Completion I: General Framework
• Linear Programming Relaxations of Quadratically Constrained Quadratic Programs
• 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
• Analysis of MILP Techniques for the Pooling Problem
• Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
• Quadratically Constrained Quadratic Programs on Acyclic Graphs With Application to Power Flow

This page was built for publication: Matrix minor reformulation and SOCP-based spatial branch-and-cut method for the AC optimal power flow problem