Pages that link to "Item:Q2073057"

The following pages link to Exploiting sparsity in complex polynomial optimization (Q2073057):

Displaying 10 items.

• Sparse-BSOS: a bounded degree SOS hierarchy for large scale polynomial optimization with sparsity (Q1646680) (← links)
• Exploiting term sparsity in noncommutative polynomial optimization (Q2231045) (← links)
• Finding sparse solutions of systems of polynomial equations via group-sparsity optimization (Q2349523) (← links)
• Synthesis for Polynomial Lasso Programs (Q2938082) (← links)
• Lasserre Hierarchy for Large Scale Polynomial Optimization in Real and Complex Variables (Q4637505) (← links)
• A new global algorithm for max-cut problem with chordal sparsity (Q6103705) (← links)
• Complexity of sparse polynomial solving 2: renormalization (Q6171578) (← 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)