Argument division based branch-and-bound algorithm for unit-modulus constrained complex quadratic programming (Q683728): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: SeDuMi / rank | |||
Normal rank | |||
Revision as of 15:56, 28 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Argument division based branch-and-bound algorithm for unit-modulus constrained complex quadratic programming |
scientific article |
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
