Jie Wang

Orcid: 0000-0002-9681-1451

Affiliations:

LAAS-CNRS, Toulouse, France
Peking University, School of Mathematical Sciences, Beijing, China
Chinese Academy of Sciences, Academy of Mathematics and Systems Science, Beijing, China (PhD 2017)

According to our database¹, Jie Wang authored at least 22 papers between 2017 and 2024.

Collaborative distances:

Dijkstra number² of four.
Erdős number³ of four.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Bibliography

2024

State polynomials: positivity, optimization and nonlinear Bell inequalities.

[BibT_eX]

[DOI]

Math. Program., September, 2024

Weighted Geometric Mean, Minimum Mediated Set, and Optimal Simple Second-Order Cone Representation.

[BibT_eX]

[DOI]

Jie Wang

SIAM J. Optim., 2024

Nonlinear Craig Interpolant Generation Over Unbounded Domains by Separating Semialgebraic Sets.

[BibT_eX]

[DOI]

Proceedings of the Formal Methods - 26th International Symposium, 2024

On Completeness of SDP-Based Barrier Certificate Synthesis over Unbounded Domains.

[BibT_eX]

[DOI]

Proceedings of the Formal Methods - 26th International Symposium, 2024

2023

Exploiting Term Sparsity in Moment-SOS Hierarchy for Dynamical Systems.

[BibT_eX]

[DOI]

IEEE Trans. Autom. Control., December, 2023

SONC optimization and exact nonnegativity certificates via second-order cone programming.

[BibT_eX]

[DOI]

Victor Magron

Jie Wang

J. Symb. Comput., 2023

Generalizing SDP-Based Barrier Certificate Synthesis to Unbounded Domains by Dropping Archimedean Condition.

[BibT_eX]

[DOI]

CoRR, 2023

Sparse Polynomial Optimization - Theory and Practice

[BibT_eX]

[DOI]

Victor Magron

Jie Wang

Series on Optimization and its Applications 5, WorldScientific, ISBN: 9781800612969, 2023

2022

CS-TSSOS: Correlative and Term Sparsity for Large-Scale Polynomial Optimization.

[BibT_eX]

[DOI]

ACM Trans. Math. Softw., December, 2022

Exploiting Constant Trace Property in Large-scale Polynomial Optimization.

[BibT_eX]

[DOI]

ACM Trans. Math. Softw., December, 2022

Exploiting Sparsity in Complex Polynomial Optimization.

[BibT_eX]

[DOI]

Jie Wang

Victor Magron

J. Optim. Theory Appl., 2022

Stability of Linear Systems Under Extended Weakly-Hard Constraints.

[BibT_eX]

[DOI]

IEEE Control. Syst. Lett., 2022

2021

On Radically Expanding the Landscape of Potential Applications for Automated-Proof Methods.

[BibT_eX]

[DOI]

Jeffrey Uhlmann

Jie Wang

SN Comput. Sci., 2021

Chordal-TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity with Chordal Extension.

[BibT_eX]

[DOI]

Jie Wang

Victor Magron

Jean-Bernard Lasserre

SIAM J. Optim., 2021

TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity.

[BibT_eX]

[DOI]

Jie Wang

Victor Magron

Jean-Bernard Lasserre

SIAM J. Optim., 2021

TSSOS: a Julia library to exploit sparsity for large-scale polynomial optimization.

[BibT_eX]

[DOI]

Victor Magron

Jie Wang

CoRR, 2021

Exploiting term sparsity in noncommutative polynomial optimization.

[BibT_eX]

[DOI]

Jie Wang

Victor Magron

Comput. Optim. Appl., 2021

SparseJSR: A Fast Algorithm to Compute Joint Spectral Radius via Sparse SOS Decompositions.

[BibT_eX]

[DOI]

Jie Wang

Martina Maggio

Victor Magron

Proceedings of the 2021 American Control Conference, 2021

2020

A second order cone characterization for sums of nonnegative circuits.

[BibT_eX]

[DOI]

Jie Wang

Victor Magron

Proceedings of the ISSAC '20: International Symposium on Symbolic and Algebraic Computation, 2020

2019

A New Sparse SOS Decomposition Algorithm Based on Term Sparsity.

[BibT_eX]

[DOI]

Jie Wang

Haokun Li

Bican Xia

Proceedings of the 2019 on International Symposium on Symbolic and Algebraic Computation, 2019

2018

Difference indices of quasi-prime difference algebraic systems.

[BibT_eX]

[DOI]

Jie Wang

J. Symb. Comput., 2018

2017

Toric difference variety.

[BibT_eX]

[DOI]

J. Syst. Sci. Complex., 2017

Jie Wang

Timeline

Legend:

Links

Online presence:

On csauthors.net:

Bibliography

Loading...