6 citations · 6 across the 3 of their papers we have counts for
Showing math.OCShow all
2 papers · 1 filter
math.OC2024
Sparse Polynomial Optimization with Unbounded Sets
Lei Huang, Shucheng Kang, Jie Wang +1
This paper considers sparse polynomial optimization with unbounded sets. When the problem possesses correlative sparsity, we propose a sparse homogenized Moment-SOS hierarchy with…
math.OC2022★ 6 cited
Sparse Polynomial Optimization: Theory and Practice
Victor Magron, Jie Wang
The problem of minimizing a polynomial over a set of polynomial inequalities is an NP-hard non-convex problem. Thanks to powerful results from real algebraic geometry, one can conv…