Solving a class of linearly constrained indefinite quadratic problems by DC algorithms (Q1368737): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: GQTPAR / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1023/a:1008288411710 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1589133845 / rank | |||
Normal rank | |||
Latest revision as of 09:11, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solving a class of linearly constrained indefinite quadratic problems by DC algorithms |
scientific article |
Statements
Solving a class of linearly constrained indefinite quadratic problems by DC algorithms (English)
0 references
2 February 1999
0 references
Linearly constrained indefinite quadratic problems play an important role in global optimization. In this paper, the authors study DC theory and its local approach to such problems. The new algorithm, CDA, efficiently produces local optima and, sometimes, global optima. Moreover, the authors propose a decomposition branch-and-bound method for globally solving these problems. Finally, many numerical simulations are reported.
0 references
DC optimization
0 references
linearly constrained indefinite quadratic problems
0 references
global optimization
0 references
DC theory
0 references
decomposition branch-and-bound method
0 references
