Pages that link to "Item:Q2910876"
From MaRDI portal
The following pages link to Constrained polynomial optimization problems with noncommuting variables (Q2910876):
Displaying 17 items.
- Polynomial optimization and a Jacobi-Davidson type method for commuting matrices (Q279038) (← links)
- The convex Positivstellensatz in a free algebra (Q436182) (← links)
- Simplification of symbolic polynomials on non-commutative variables (Q445834) (← links)
- A method for computing lowest eigenvalues of symmetric polynomial differential operators by semidefinite programming (Q984697) (← links)
- The tracial moment problem and trace-optimization of polynomials (Q1942272) (← links)
- Optimization over trace polynomials (Q2068367) (← links)
- Sparse noncommutative polynomial optimization (Q2144551) (← links)
- Exploiting term sparsity in noncommutative polynomial optimization (Q2231045) (← links)
- Sums of Hermitian squares decomposition of non-commutative polynomials in non-symmetric variables using NCSOStools (Q2418156) (← links)
- Optimization of Polynomials in Non-Commuting Variables (Q2803374) (← links)
- Polynomial vector variational inequalities under polynomial constraints and applications (Q2804210) (← links)
- NCSOStools: a computer algebra system for symbolic and numerical computation with noncommutative polynomials (Q3093048) (← links)
- Conic Approach to Quantum Graph Parameters Using Linear Optimization Over the Completely Positive Semidefinite Cone (Q3457190) (← links)
- Minimizer Extraction in Polynomial Optimization Is Robust (Q4561225) (← links)
- Noncommutative Christoffel-Darboux kernels (Q5047921) (← links)
- Constrained trace-optimization of polynomials in freely noncommuting variables (Q5964245) (← links)
- Certifying optimality of Bell inequality violations: noncommutative polynomial optimization through semidefinite programming and local optimization (Q6490315) (← links)
