DC decomposition based branch-and-bound algorithms for box-constrained quadratic programs (Q723488)
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: DC decomposition based branch-and-bound algorithms for box-constrained quadratic programs |
scientific article; zbMATH DE number 6911933
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | DC decomposition based branch-and-bound algorithms for box-constrained quadratic programs |
scientific article; zbMATH DE number 6911933 |
Statements
DC decomposition based branch-and-bound algorithms for box-constrained quadratic programs (English)
0 references
31 July 2018
0 references
quadratic program
0 references
difference-of-convex
0 references
branch-and-bound algorithm
0 references
global optimization
0 references
convex relaxation
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8519220352172852
0 references
0.8399848341941833
0 references
0.8392317891120911
0 references
