Pages that link to "Item:Q2144551"
From MaRDI portal
The following pages link to Sparse noncommutative polynomial optimization (Q2144551):
Displaying 10 items.
- A sublevel moment-SOS hierarchy for polynomial optimization (Q2070330) (← links)
- Dimension-free entanglement detection in multipartite Werner states (Q2099794) (← links)
- Exploiting term sparsity in noncommutative polynomial optimization (Q2231045) (← links)
- SONC optimization and exact nonnegativity certificates via second-order cone programming (Q2674014) (← links)
- Chordal-TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity with Chordal Extension (Q5148406) (← links)
- Bilinear matrix inequalities and polynomials in several freely noncommuting variables (Q6155830) (← links)
- Certifying optimality of Bell inequality violations: noncommutative polynomial optimization through semidefinite programming and local optimization (Q6490315) (← links)
- Semi-definite programming and quantum information (Q6561827) (← links)
- Exploiting constant trace property in large-scale polynomial optimization (Q6599981) (← links)
- State polynomials: positivity, optimization and nonlinear Bell inequalities (Q6608047) (← links)
