A tight compact quadratically constrained convex relaxation of the optimal power flow problem

DOI10.1016/J.COR.2024.106626MaRDI QIDQ6568415zbMATH OpenFDO

Authors Amélie Lambert

Publication date 8 July 2024

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.COR.2024.106626

zbMATH Keywords

global optimizationoptimal power flowquadratic convex relaxationquadratically constrained quadratic programmingsemidefinite programming

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites work

• A data mining transmission switching heuristic for post-contingency AC power flow violation reduction in real-world, large-scale systems
• A decision model for reducing active power losses during electric power dispatching
• A deterministic method for the unit commitment problem in power systems
• A linear-programming approximation of AC power flows
• A spatial branch-and-cut method for nonconvex QCQP with bounded complex variables
• A survey on conic relaxations of optimal power flow problem
• An adaptive, multivariate partitioning algorithm for global optimization of nonconvex programs
• Benchmarking optimization software with performance profiles.
• Chance constrained unit commitment approximation under stochastic wind energy
• Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
• Convex quadratic relaxations for mixed-integer nonlinear programs in power systems
• Exact Convex Relaxation of Optimal Power Flow in Radial Networks
• Exact quadratic convex reformulations of mixed-integer quadratically constrained problems
• Extending the QCR method to general mixed-integer programs
• Global optimization with polynomials and the problem of moments
• Global solution of non-convex quadratically constrained quadratic programs
• scientific article; zbMATH DE number 3335677 (Why is no real title available?)
• Lagrangian duality and branch-and-bound algorithms for optimal power flow
• Matrix minor reformulation and SOCP-based spatial branch-and-cut method for the AC optimal power flow problem
• Mixed-integer nonlinear optimization
• On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
• Operations research in optimal power flow: a guide to recent and emerging methodologies and applications
• Optimal configuration of power distribution networks with variable renewable energy resources
• Solving nonsmooth and discontinuous optimal power flow problems via interior-point \(\ell_p\)-penalty approach
• Strong SOCP relaxations for the optimal power flow problem

This page was built for publication: A tight compact quadratically constrained convex relaxation of the optimal power flow problem

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