A combined d.c. optimization--ellipsoidal branch-and-bound algorithm for solving nonconvex quadratic programming problems (Q1386483)
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 combined d.c. optimization--ellipsoidal branch-and-bound algorithm for solving nonconvex quadratic programming problems |
scientific article; zbMATH DE number 1154640
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A combined d.c. optimization--ellipsoidal branch-and-bound algorithm for solving nonconvex quadratic programming problems |
scientific article; zbMATH DE number 1154640 |
Statements
A combined d.c. optimization--ellipsoidal branch-and-bound algorithm for solving nonconvex quadratic programming problems (English)
0 references
10 August 1998
0 references
ellipsoid methods
0 references
d.c. optimization
0 references
ball constrained quadratic problem
0 references
branch-and-bound algorithm
0 references
ellipsoidal partition
0 references
indefinite quadratic function
0 references
nonconvex quadratic program
0 references
0.9170135855674744
0 references
0.8246198892593384
0 references
0.8195778727531433
0 references
