Christensen-Sinclair factorization via semidefinite programming

DOI10.1016/J.LAA.2025.03.007MaRDI QIDQ6998250zbMATH OpenFDO

Authors Francisco Gutierrez

Publication date 11 April 2025

Published in Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.LAA.2025.03.007

zbMATH Keywords

Christensen-Sinclair factorisationoperator spacessemidefinite programmingtensors

Mathematics Subject Classification ID

Operator spaces and completely bounded maps (46L07) Forms (bilinear, sesquilinear, multilinear) (47A07) Semidefinite programming (90C22)

Review text

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.

Cites work

• Efficient rounding for the noncommutative Grothendieck inequality
• Elementary proofs of Grothendieck theorems for completely bounded norms
• Multilinear maps and tensor norms on operator systems
• Quantum query algorithms are completely bounded forms
• Quantum XOR games
• Representations of completely bounded multilinear operators
• Semidefinite programming and integer programming
• Semidefinite programs for completely bounded norms
• Tensor products of operator spaces

This page was built for publication: Christensen-Sinclair factorization via semidefinite programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6998250)