Understanding Christensen-Sinclair factorization via semidefinite programming
Operator Algebras
2024-07-19 v1 Functional Analysis
Optimization and Control
Abstract
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.
Cite
@article{arxiv.2407.13716,
title = {Understanding Christensen-Sinclair factorization via semidefinite programming},
author = {Francisco Escudero-Gutiérrez},
journal= {arXiv preprint arXiv:2407.13716},
year = {2024}
}
Comments
13 pages