A sensitive-eigenvector based global algorithm for quadratically constrained quadratic programming (Q2633541)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7052834
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A sensitive-eigenvector based global algorithm for quadratically constrained quadratic programming |
scientific article; zbMATH DE number 7052834 |
Statements
A sensitive-eigenvector based global algorithm for quadratically constrained quadratic programming (English)
0 references
9 May 2019
0 references
quadratically constrained quadratic programming
0 references
semidefinite relaxation
0 references
branch-and-bound algorithm
0 references
global optimization
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 references
0.8677275776863098
0 references
0.8291099667549133
0 references
0.8043226599693298
0 references
