Christensen-Sinclair factorization via semidefinite programming (Q6998250)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 8026247
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Christensen-Sinclair factorization via semidefinite programming |
scientific article; zbMATH DE number 8026247 |
Statements
Christensen-Sinclair factorization via semidefinite programming (English)
0 references
11 April 2025
0 references
This note is devoted to revealling that the Christensen-Sinclair factorization theorem can be revovered from strong duality in semidefinite programming when the underlying Hilbert spaces are finitely dimensional. Additionally, an efficient algorithm for computing the Christensen-Sinclair factorization is provided, too.
0 references
Christensen-Sinclair factorisation
0 references
semidefinite programming
0 references
operator spaces
0 references
tensors
0 references
