A new bound-and-reduce approach of nonconvex quadratic programming problems (Q902837)
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: A new bound-and-reduce approach of nonconvex quadratic programming problems |
scientific article; zbMATH DE number 6525904
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new bound-and-reduce approach of nonconvex quadratic programming problems |
scientific article; zbMATH DE number 6525904 |
Statements
A new bound-and-reduce approach of nonconvex quadratic programming problems (English)
0 references
4 January 2016
0 references
nonconvex quadratic programming
0 references
global optimization
0 references
branch-and-bound
0 references
relaxation technique
0 references
hyper-rectangle reducing
0 references
0 references
0 references
0 references
0.8864283561706543
0 references
0.8811978697776794
0 references
0.8358199596405029
0 references
0.8311684131622314
0 references
