The following pages link to Sparse Polynomial Optimization (Q5088205):
Displayed 3 items.
- Semidefinite Relaxation Methods for Tensor Absolute Value Equations (Q6066099) (← links)
- Exploiting ideal-sparsity in the generalized moment problem with application to matrix factorization ranks (Q6126663) (← links)
- A Correlatively Sparse Lagrange Multiplier Expression Relaxation for Polynomial Optimization (Q6136658) (← links)