Christensen-Sinclair factorization via semidefinite programming
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.
Authors
- Francisco Escudero (ORCID: https://orcid.org/0000-0001-5982-1127)
Institutions
- Centrum Wiskunde & Informatica (NL)
- QuSoft (NL)
Publication Details
- Journal
- Linear Algebra and its Applications
- Published
- 2025-03-15
- DOI
- https://doi.org/10.1016/j.laa.2025.03.007
- Primary Topic
- Advanced Optimization Algorithms Research
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- Nederlandse Organisatie voor Wetenschappelijk Onderzoek
- Horizon 2020
- H2020 Marie Skłodowska-Curie Actions
- HORIZON EUROPE Marie Sklodowska-Curie Actions