A spatial branch-and-cut method for nonconvex QCQP with bounded complex variables (Q1675255)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A spatial branch-and-cut method for nonconvex QCQP with bounded complex variables |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A spatial branch-and-cut method for nonconvex QCQP with bounded complex variables |
scientific article |
Statements
A spatial branch-and-cut method for nonconvex QCQP with bounded complex variables (English)
0 references
27 October 2017
0 references
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.
0 references
quadratic programming problems
0 references
numerical examples
0 references
branch-and-cut approach
0 references
nonconvex
0 references
semidefinite programming
0 references
algorithm
0 references
optimal power flow problem
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8061366081237793
0 references
0.8009619116783142
0 references
0.8008084893226624
0 references
0.7970353960990906
0 references
