Finding low-rank solutions of sparse linear matrix inequalities using convex optimization (Q5737726)
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: Finding low-rank solutions of sparse linear matrix inequalities using convex optimization |
scientific article; zbMATH DE number 6724128
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding low-rank solutions of sparse linear matrix inequalities using convex optimization |
scientific article; zbMATH DE number 6724128 |
Statements
Finding Low-rank Solutions of Sparse Linear Matrix Inequalities using Convex Optimization (English)
0 references
30 May 2017
0 references
low-rank optimization
0 references
linear matrix inequality
0 references
semidefinite programming
0 references
tree decomposition
0 references
polynomial optimization
0 references
matrix completion
0 references
optimal power flow
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8148912787437439
0 references
0.776785135269165
0 references
0.7590976357460022
0 references
0.7438713312149048
0 references
