Semidefinite relaxation algorithm for solving tensor split feasibility problem (Q3306557)
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: Semidefinite relaxation algorithm for solving tensor split feasibility problem |
scientific article; zbMATH DE number 7233859
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Semidefinite relaxation algorithm for solving tensor split feasibility problem |
scientific article; zbMATH DE number 7233859 |
Statements
12 August 2020
0 references
split feasibility problem
0 references
semidefinite relaxation
0 references
semidefinite programming
0 references
0.8063606023788452
0 references
0.7904707789421082
0 references
0.7740786075592041
0 references
0.7642304301261902
0 references
0.7615218758583069
0 references