A simplicial branch-and-bound method for solving nonconvex all-quadratic programs (Q1281481)
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 method for solving nonconvex all-quadratic programs |
scientific article; zbMATH DE number 1267901
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A simplicial branch-and-bound method for solving nonconvex all-quadratic programs |
scientific article; zbMATH DE number 1267901 |
Statements
A simplicial branch-and-bound method for solving nonconvex all-quadratic programs (English)
0 references
21 July 1999
0 references
global optimization
0 references
indefinite quadratic optimization under indefinite quadratic constraints
0 references
nonconvex quadratically constrained quadratic programs
0 references
branch-and-bound
0 references
\(\varepsilon\)-approximate optimal solution
0 references
