A spatial branch-and-cut method for nonconvex QCQP with bounded complex variables
From MaRDI portal
Abstract: We develop a spatial branch-and-cut approach for nonconvex Quadratically Constrained Quadratic Programs with bounded complex variables (CQCQP). Linear valid inequalities are added at each node of the search tree to strengthen semidefinite programming relaxations of CQCQP. These valid inequalities are derived from the convex hull description of a nonconvex set of positive semidefinite Hermitian matrices subject to a rank-one constraint. We propose branching rules based on an alternative to the rank-one constraint that allows for local measurement of constraint violation. Closed-form bound tightening procedures are used to reduce the domain of the problem. We apply the algorithm to solve the Alternating Current Optimal Power Flow problem with complex variables as well as the Box-constrained Quadratic Programming problem with real variables.
The authors develop a spatial branch-and-cut approach for nonconvex quadratically constrained quadratic programs with bounded complex variables. Linear valid inequalities are added at each node of the search tree to strengthen semidefinite programming relaxations. The authors apply the algorithm to solve the alternating current optimal power flow problem with complex variables as well as the box-constrained quadratic programming problem with real variables. Computational results are given.
Recommendations
- Global solution of non-convex quadratically constrained quadratic programs
- A branch-and-cut algorithm using polar cuts for solving nonconvex quadratic programming problems
- A branch and cut algorithm for nonconvex quadratically constrained quadratic programming
- A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs
- A new branch-and-cut algorithm for non-convex quadratic programming via alternative direction method and semidefinite relaxation
Cites work
- A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique
- A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs
- A simplicial branch-and-bound method for solving nonconvex all-quadratic programs
- Approximation methods for complex polynomial optimization
- BARON: A general purpose global optimization software package
- Branching and bounds tighteningtechniques for non-convex MINLP
- Branching rules revisited
- Complex Matrix Decomposition and Quadratic Programming
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Computable representations for convex hulls of low-dimensional quadratic forms
- Cones of Matrices and Set-Functions and 0–1 Optimization
- Design of Optimized Radar Codes With a Peak to Average Power Ratio Constraint
- Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2
- Electrical transmission system cascades and vulnerability. An operations research viewpoint
- Exploiting sparsity in semidefinite programming via matrix completion. I: General framework
- Extended Matrix Cube Theorems with Applications to μ-Theory in Control
- Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-bound
- Globally solving nonconvex quadratic programming problems via completely positive programming
- GLOMIQO: global mixed-integer quadratic optimizer
- scientific article; zbMATH DE number 4070633 (Why is no real title available?)
- scientific article; zbMATH DE number 554762 (Why is no real title available?)
- scientific article; zbMATH DE number 1489799 (Why is no real title available?)
- scientific article; zbMATH DE number 2087803 (Why is no real title available?)
- scientific article; zbMATH DE number 6026126 (Why is no real title available?)
- Lagrangian duality and branch-and-bound algorithms for optimal power flow
- Lasserre hierarchy for large scale polynomial optimization in real and complex variables
- Mixed-integer nonlinear optimization
- Multiterm polyhedral relaxations for nonconvex, quadratically constrained quadratic programs
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Optimizing a polyhedral-semidefinite relaxation of completely positive programs
- Phase recovery, MaxCut and complex semidefinite programming
- Positive definite completions of partial Hermitian matrices
- Randomized Algorithms for Optimal Solutions of Double-Sided QCQP With Applications in Signal Processing
- Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
- Strong Duality in Nonconvex Quadratic Optimization with Two Quadratic Constraints
Cited in
(22)- Mathematical programming methods for microgrid design and operations: a survey on deterministic and stochastic approaches
- Matrix minor reformulation and SOCP-based spatial branch-and-cut method for the AC optimal power flow problem
- Penalized semidefinite programming for quadratically-constrained quadratic optimization
- A geometric branch and bound method for robust maximization of convex functions
- AC optimal power flow: a conic programming relaxation and an iterative MILP scheme for global optimization
- Optimization hierarchy for fair statistical decision problems
- Operations research in optimal power flow: a guide to recent and emerging methodologies and applications
- Strong NP-hardness of AC power flows feasibility
- Strengthened SDP relaxation for an extended trust region subproblem with an application to optimal power flow
- Convex relaxations for quadratic on/off constraints and applications to optimal transmission switching
- A bilevel approach for identifying the worst contingencies for nonconvex alternating current power systems
- New semidefinite relaxations for a class of complex quadratic programming problems
- A graphic structure based branch-and-bound algorithm for complex quadratic optimization and applications to magnitude least-square problem
- A tight compact quadratically constrained convex relaxation of the optimal power flow problem
- Enabling research through the SCIP Optimization Suite 8.0
- Solving a class of two-stage stochastic nonlinear integer programs using value functions
- Argument division based branch-and-bound algorithm for unit-modulus constrained complex quadratic programming
- A second-order cone relaxation-based branch-and-bound algorithm for complex quadratic programs on acyclic graphs
- New notions of simultaneous diagonalizability of quadratic forms with applications to QCQPs
- A slightly lifted convex relaxation for nonconvex quadratic programming with ball constraints
- Efficient bounds tightening based on SOCP relaxations for AC optimal power flow
- Extreme strong branching for QCQPs
Describes a project that uses
Uses Software
This page was built for publication: A spatial branch-and-cut method for nonconvex QCQP with bounded complex variables
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1675255)
