Christensen-Sinclair factorization via semidefinite programming

Escudero Gutiérrez, Francisco

doi:10.1016/j.laa.2025.03.007

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.

Additional Metadata
Keywords	Christensen-Sinclair factorization, Semidefinite programming, Operator spaces, Tensors
Persistent URL	doi.org/10.1016/j.laa.2025.03.007
Journal	Linear Algebra and its Applications
Project	Networks , Marie Skłodowska-Curie
Grant	This work was funded by the The Netherlands Organisation for Scientific Research (NWO); grant id nwo/024.002.003 - Networks
Citation APA Style AAA Style APA Style Cell Style Chicago Style Harvard Style IEEE Style MLA Style Nature Style Vancouver Style American-Institute-of-Physics Style Council-of-Science-Editors Style BibTex Format Endnote Format RIS Format CSL Format DOIs only Format	Escudero Gutiérrez, F. (2025). Christensen-Sinclair factorization via semidefinite programming. Linear Algebra and its Applications, 714, 28–44. doi:10.1016/j.laa.2025.03.007

View at Publisher

Free Full Text ( Final Version , 432kb )

See Also
techReport Understanding Christensen-Sinclair factorization via semidefinite programming F. Escudero Gutiérrez (Francisco)

Christensen-Sinclair factorization via semidefinite programming

Publication

Publication

techReport
Understanding Christensen-Sinclair factorization via semidefinite programming

Address

CWI researchers

Questions or comments?

Christensen-Sinclair factorization via semidefinite programming

Publication

Publication

techReport Understanding Christensen-Sinclair factorization via semidefinite programming

Workflow

Workflow

Add Content

techReport
Understanding Christensen-Sinclair factorization via semidefinite programming