Interpolation for completely positive maps: numerical solutions
arXiv:1401.82396 citationsh-index: 12
Originality Synthesis-oriented
AI Analysis
Provides numerical methods for a specific problem in matrix algebra, but the contribution is incremental and domain-specific.
The paper presents semidefinite programming and convex minimization techniques for finding completely positive maps that interpolate prescribed values on given data, supported by a numerical example.
We present certain techniques to find completely positive maps between matrix algebras that take prescribed values on given data. To this aim we describe a semidefinite programming approach and another convex minimization method supported by a numerical example.