Ncpol2sdpa

MaRDI QIDQ29421swMATHFDO

Official website http://dl.acm.org/citation.cfm?doid=2786970.2699464

Described by source

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

Cited in

(8)

• A robust unscented transformation for uncertain moments
• pyipopt
• PICOS
• NCSOStools
• QETLAB
• A geometric branch and bound method for robust maximization of convex functions
• Sparse noncommutative polynomial optimization
• A single entangled system is an unbounded source of nonlocal correlations and of certified random numbers

This page was built for software: Ncpol2sdpa