Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2407.13716 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866916329675554816 |
|---|---|
| author | Escudero-Gutiérrez, Francisco |
| author_facet | Escudero-Gutiérrez, Francisco |
| contents | We show that the Christensen-Sinclair factorization theorem, when the underlying Hilbert spaces are finite dimensional, is an instance of strong duality of semidefinite programming. This gives an elementary proof of the result and also provides an efficient algorithm to compute the Christensen-Sinclair factorization. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2407_13716 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Understanding Christensen-Sinclair factorization via semidefinite programming Escudero-Gutiérrez, Francisco Operator Algebras Functional Analysis Optimization and Control We show that the Christensen-Sinclair factorization theorem, when the underlying Hilbert spaces are finite dimensional, is an instance of strong duality of semidefinite programming. This gives an elementary proof of the result and also provides an efficient algorithm to compute the Christensen-Sinclair factorization. |
| title | Understanding Christensen-Sinclair factorization via semidefinite programming |
| topic | Operator Algebras Functional Analysis Optimization and Control |
| url | https://arxiv.org/abs/2407.13716 |