A multigrid approach to SDP relaxations of sparse polynomial optimization problems (Q4600837)
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: A multigrid approach to SDP relaxations of sparse polynomial optimization problems |
scientific article; zbMATH DE number 6826861
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A multigrid approach to SDP relaxations of sparse polynomial optimization problems |
scientific article; zbMATH DE number 6826861 |
Statements
A Multigrid Approach to SDP Relaxations of Sparse Polynomial Optimization Problems (English)
0 references
17 January 2018
0 references
multigrid
0 references
semidefinite programming
0 references
sparse polynomial optimization
0 references
differential equations
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.7954062819480896
0 references
0.7894958257675171
0 references
0.7829656004905701
0 references
0.7767484784126282
0 references
0.7592469453811646
0 references
