A new algorithm for finding global solution of indefinite quadratic programming problems (Q5320224)
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 5584615
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new algorithm for finding global solution of indefinite quadratic programming problems |
scientific article; zbMATH DE number 5584615 |
Statements
22 July 2009
0 references
global optimization
0 references
indefinite quadratic programming
0 references
branch-and-bound method
0 references
convex relaxation
0 references
Lagrangian relaxation
0 references
0.9247270226478576
0 references
0.9105797410011292
0 references
0.8594593405723572
0 references
0.8562014698982239
0 references
0.8485476970672607
0 references
