Ncpol2sdpa

swMATH17564MaRDI QIDQ29421FDOQ29421

Author name not available (Why is that?)

Described by source

• Algorithm 950: Ncpol2sdpa -- sparse semidefinite programming relaxations for polynomial optimization problems of noncommuting variables

Cited In (4)

• A Single Entangled System Is an Unbounded Source of Nonlocal Correlations and of Certified Random Numbers
• A robust unscented transformation for uncertain moments
• A geometric branch and bound method for robust maximization of convex functions
• Sparse noncommutative polynomial optimization

This page was built for software: Ncpol2sdpa