Pages that link to "Item:Q2073057"
From MaRDI portal
The following pages link to Exploiting sparsity in complex polynomial optimization (Q2073057):
Displaying 4 items.
- A new global algorithm for max-cut problem with chordal sparsity (Q6103705) (← links)
- On symmetry adapted bases in trigonometric optimization (Q6615410) (← links)
- Computing sparse Fourier sum of squares on finite abelian groups in quasi-linear time (Q6657418) (← links)
- A real moment-HSOS hierarchy for complex polynomial optimization with real coefficients (Q6667691) (← links)
