Toric difference variety. - Xiao-Shan Gao; Zhang Huang; Jie Wang 037; Chun-Ming Yuan (J. Syst. Sci. Complex., 2017)

Difference indices of quasi-prime difference algebraic systems. - Jie Wang 037 (J. Symb. Comput., 2018)

A New Sparse SOS Decomposition Algorithm Based on Term Sparsity. - Jie Wang 037; Haokun Li; Bican Xia (ISSAC, 2019)

A second order cone characterization for sums of nonnegative circuits. - Jie Wang 037; Victor Magron (ISSAC, 2020)

SparseJSR: A Fast Algorithm to Compute Joint Spectral Radius via Sparse SOS Decompositions. - Jie Wang 037; Martina Maggio; Victor Magron (ACC, 2021)

Exploiting term sparsity in noncommutative polynomial optimization. - Jie Wang 037; Victor Magron (Comput. Optim. Appl., 2021)

TSSOS: a Julia library to exploit sparsity for large-scale polynomial optimization. - Victor Magron; Jie Wang 037 (CoRR, 2021)

TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity. - Jie Wang 037; Victor Magron; Jean-Bernard Lasserre (SIAM J. Optim., 2021)

Chordal-TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity with Chordal Extension. - Jie Wang 037; Victor Magron; Jean-Bernard Lasserre (SIAM J. Optim., 2021)

On Radically Expanding the Landscape of Potential Applications for Automated-Proof Methods. - Jeffrey Uhlmann; Jie Wang 037 (SN Comput. Sci., 2021)

Sparse Polynomial Optimization: Theory and Practice. - Victor Magron; Jie Wang 037 (CoRR, 2022)

Stability of Linear Systems Under Extended Weakly-Hard Constraints. - Nils Vreman; Paolo Pazzaglia; Victor Magron; Jie Wang 037; Martina Maggio (IEEE Control. Syst. Lett., 2022)

Exploiting Sparsity in Complex Polynomial Optimization. - Jie Wang 037; Victor Magron (J. Optim. Theory Appl., 2022)

Exploiting Constant Trace Property in Large-scale Polynomial Optimization. - Ngoc Hoang Anh Mai; Jean B. Lasserre; Victor Magron; Jie Wang 037 (ACM Trans. Math. Softw., 2022)

CS-TSSOS: Correlative and Term Sparsity for Large-Scale Polynomial Optimization. - Jie Wang 037; Victor Magron; Jean B. Lasserre; Ngoc Hoang Anh Mai (ACM Trans. Math. Softw., 2022)

Sparse Polynomial Optimization - Theory and Practice - Victor Magron; Jie Wang 037 (Sparse Polynomial Optimization, 2023)

Generalizing SDP-Based Barrier Certificate Synthesis to Unbounded Domains by Dropping Archimedean Condition. - Hao Wu 085; Shenghua Feng; Ting Gan; Jie Wang 037; Bican Xia; Naijun Zhan (CoRR, 2023)

SONC optimization and exact nonnegativity certificates via second-order cone programming. - Victor Magron; Jie Wang 037 (J. Symb. Comput., 2023)

Exploiting Term Sparsity in Moment-SOS Hierarchy for Dynamical Systems. - Jie Wang 037; Corbinian Schlosser; Milan Korda; Victor Magron (IEEE Trans. Autom. Control., 2023)

On Completeness of SDP-Based Barrier Certificate Synthesis over Unbounded Domains. - Hao Wu 085; Shenghua Feng; Ting Gan; Jie Wang 037; Bican Xia; Naijun Zhan (FM (2), 2024)

Nonlinear Craig Interpolant Generation Over Unbounded Domains by Separating Semialgebraic Sets. - Hao Wu 085; Jie Wang 037; Bican Xia; Xiakun Li; Naijun Zhan; Ting Gan (FM (1), 2024)

Weighted Geometric Mean, Minimum Mediated Set, and Optimal Simple Second-Order Cone Representation. - Jie Wang 037 (SIAM J. Optim., 2024)

State polynomials: positivity, optimization and nonlinear Bell inequalities. - Igor Klep; Victor Magron; Jurij Volcic; Jie Wang 037 (Math. Program., 2024)

A Moment-Sum-of-Squares Hierarchy for Robust Polynomial Matrix Inequality Optimization with Sum-of-Squares Convexity. - Feng Guo; Jie Wang 037 (Math. Oper. Res., 2025)

Sparse Polynomial Optimization with Unbounded Sets. - Lei Huang; Shucheng Kang; Jie Wang 037; Heng Yang (SIAM J. Optim., 2025)

A real moment-HSOS hierarchy for complex polynomial optimization with real coefficients. - Jie Wang 037; Victor Magron (Comput. Optim. Appl., 2025)

Solving Low-Rank Semidefinite Programs via Manifold Optimization. - Jie Wang 037; Liangbing Hu (J. Sci. Comput., 2025)