Pages that link to "Item:Q2329041"

The following pages link to Lower bounds on matrix factorization ranks via noncommutative polynomial optimization (Q2329041):

Displaying 8 items.

• Optimization over trace polynomials (Q2068367) (← links)
• Bounding the separable rank via polynomial optimization (Q2144234) (← links)
• Sparse noncommutative polynomial optimization (Q2144551) (← links)
• Exploiting term sparsity in noncommutative polynomial optimization (Q2231045) (← links)
• Mixed states in one spatial dimension: Decompositions and correspondence with nonnegative matrices (Q3298903) (← links)
• Globally trace-positive noncommutative polynomials and the unbounded tracial moment problem (Q6084200) (← links)
• Exploiting ideal-sparsity in the generalized moment problem with application to matrix factorization ranks (Q6126663) (← links)
• Certifying optimality of Bell inequality violations: noncommutative polynomial optimization through semidefinite programming and local optimization (Q6490315) (← links)