A branch and bound method via d. c. optimization algorithms and ellipsoidal technique for box constrained nonconvex quadratic problems (Q1273054)
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 branch and bound method via d. c. optimization algorithms and ellipsoidal technique for box constrained nonconvex quadratic problems |
scientific article; zbMATH DE number 1228824
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A branch and bound method via d. c. optimization algorithms and ellipsoidal technique for box constrained nonconvex quadratic problems |
scientific article; zbMATH DE number 1228824 |
Statements
A branch and bound method via d. c. optimization algorithms and ellipsoidal technique for box constrained nonconvex quadratic problems (English)
0 references
25 May 1999
0 references
d.c. optimization
0 references
DCA
0 references
ball constrained quadratic problem
0 references
difference of convex functions
0 references
box constrained quadratic problem
0 references
branch-and-bound
0 references
ellipsoidal technique
0 references
