Pages that link to "Item:Q984697"
From MaRDI portal
The following pages link to A method for computing lowest eigenvalues of symmetric polynomial differential operators by semidefinite programming (Q984697):
Displaying 11 items.
- Polynomial optimization and a Jacobi-Davidson type method for commuting matrices (Q279038) (← links)
- The tracial moment problem and trace-optimization of polynomials (Q1942272) (← links)
- Minimizing trigonometric matrix polynomials over semi-algebraic sets (Q2342782) (← links)
- Sums of Hermitian squares decomposition of non-commutative polynomials in non-symmetric variables using NCSOStools (Q2418156) (← links)
- Invariant Semidefinite Programs (Q2802527) (← links)
- SDP Relaxations for Non-Commutative Polynomial Optimization (Q2802540) (← links)
- Algorithm 950: Ncpol2sdpa -- sparse semidefinite programming relaxations for polynomial optimization problems of noncommuting variables (Q2828144) (← links)
- On \(q\)-normal operators and the quantum complex plane (Q2862127) (← links)
- Minimizer Extraction in Polynomial Optimization Is Robust (Q4561225) (← links)
- A paradox in bosonic energy computations via semidefinite programming relaxations (Q5141427) (← links)
- Constrained trace-optimization of polynomials in freely noncommuting variables (Q5964245) (← links)
