A branch and bound method via d. c. optimization algorithms and ellipsoidal technique for box constrained nonconvex quadratic problems (Q1273054): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1023/a:1008240227198 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1530146942 / rank | |||
Normal rank | |||
Latest revision as of 09:11, 30 July 2024
scientific article
| 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 |
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
