A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs (Q1780950)
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 simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs |
scientific article; zbMATH DE number 2175963
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs |
scientific article; zbMATH DE number 2175963 |
Statements
A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs (English)
0 references
14 June 2005
0 references
Nonconvex quadratic programming
0 references
Global optimization
0 references
Convex envelope
0 references
Branch-and-bound
0 references
0 references
0 references
0 references
0 references
0 references
0.8845297694206238
0 references
0.8477956652641296
0 references
0.846716046333313
0 references
