A new algorithm for concave quadratic programming (Q2010088)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7139378
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new algorithm for concave quadratic programming |
scientific article; zbMATH DE number 7139378 |
Statements
A new algorithm for concave quadratic programming (English)
0 references
3 December 2019
0 references
non-convex quadratic programming
0 references
duality
0 references
semi-definite relaxation
0 references
bound
0 references
branch and cut method
0 references
concave quadratic programming
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8334829211235046
0 references
0.804711639881134
0 references
0.802649199962616
0 references
0.793895959854126
0 references
