Globally solving quadratic programs with convex objective and complementarity constraints via completely positive programming (Q1716972)
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: Globally solving quadratic programs with convex objective and complementarity constraints via completely positive programming |
scientific article; zbMATH DE number 7012494
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Globally solving quadratic programs with convex objective and complementarity constraints via completely positive programming |
scientific article; zbMATH DE number 7012494 |
Statements
Globally solving quadratic programs with convex objective and complementarity constraints via completely positive programming (English)
0 references
5 February 2019
0 references
quadratic programs with complementarity constraints
0 references
augmented Lagrangian method
0 references
branch and bound
0 references
doubly nonnegative relaxation
0 references
semidefinite programming
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8395718336105347
0 references
0.8226326107978821
0 references
0.8180220723152161
0 references
0.8140053153038025
0 references
0.7967220544815063
0 references
