DC decomposition based branch-and-bound algorithms for box-constrained quadratic programs (Q723488): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: SeDuMi / rank | |||
Normal rank | |||
Revision as of 01:07, 28 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | DC decomposition based branch-and-bound algorithms for box-constrained quadratic programs |
scientific article |
Statements
DC decomposition based branch-and-bound algorithms for box-constrained quadratic programs (English)
0 references
31 July 2018
0 references
quadratic program
0 references
difference-of-convex
0 references
branch-and-bound algorithm
0 references
global optimization
0 references
convex relaxation
0 references
