Pages that link to "Item:Q2329041"
From MaRDI portal
The following pages link to Lower bounds on matrix factorization ranks via noncommutative polynomial optimization (Q2329041):
Displaying 13 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)
- Lifting for Simplicity: Concise Descriptions of Convex Sets (Q5044992) (← 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)
- Further \(\exists{\mathbb{R}} \)-complete problems with PSD matrix factorizations (Q6592116) (← links)
- State polynomials: positivity, optimization and nonlinear Bell inequalities (Q6608047) (← links)
- Matrix extreme points and free extreme points of free spectrahedra (Q6661111) (← links)
- Free extreme points span generalized free spectrahedra given by compact coefficients (Q6671664) (← links)
