Exploiting aggregate sparsity in second-order cone relaxations for quadratic constrained quadratic programming problems (Q5038440)
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: Exploiting aggregate sparsity in second-order cone relaxations for quadratic constrained quadratic programming problems |
scientific article; zbMATH DE number 7595260
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Exploiting aggregate sparsity in second-order cone relaxations for quadratic constrained quadratic programming problems |
scientific article; zbMATH DE number 7595260 |
Statements
Exploiting aggregate sparsity in second-order cone relaxations for quadratic constrained quadratic programming problems (English)
0 references
30 September 2022
0 references
quadratic constrained quadratic programming
0 references
semidefinite programming
0 references
second-order cone programming
0 references
aggregate sparsity
0 references
chordal sparsity
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8034881353378296
0 references
0.7978610992431641
0 references
0.7974259257316589
0 references
0.7829477787017822
0 references
