A simplicial branch-and-bound method for solving nonconvex all-quadratic programs (Q1281481): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 11:07, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A simplicial branch-and-bound method for solving nonconvex all-quadratic programs |
scientific article |
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
