Argument division based branch-and-bound algorithm for unit-modulus constrained complex quadratic programming (Q683728)
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: Argument division based branch-and-bound algorithm for unit-modulus constrained complex quadratic programming |
scientific article; zbMATH DE number 6836557
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Argument division based branch-and-bound algorithm for unit-modulus constrained complex quadratic programming |
scientific article; zbMATH DE number 6836557 |
Statements
Argument division based branch-and-bound algorithm for unit-modulus constrained complex quadratic programming (English)
0 references
9 February 2018
0 references
quadratic programming
0 references
semidefinite relaxation
0 references
branch-and-bound
0 references
global optimization
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.7588909864425659
0 references
0.7447312474250793
0 references
0.7404137849807739
0 references
