Jie Wang

Jie Wang

Auto-generated profile, based on publicly available information

Jie Wang

CNRS LAAS 7 avenue du colonel Roche 31400 Toulouse France

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
27 July 2021 in Computational Optimization and Applications
Verified
Journal Article
Closed access
PDF file
JWJie Wang
Jie Wang
VMVictor Magron
Victor Magron

1 January 2021 in Discrete and Continuous Dynamical Systems-Series B
Verified
Journal Article
Closed access
PDF file
XTXiaoxian Tang
Xiaoxian Tang
JWJie Wang
Jie Wang
We solve a conjecture on multiple nondegenerate steady states, and prove bistability for sequestration networks. More specifically, we prove that for any odd number of species, and for any production factor, the fully open extension of a sequestration network admits three nondegenerate positive steady states, two of which are locally asymptotically stable. In addition, we provide a non-empty open set in the parameter space where a sequestration network admits bistability, and we present a procedure for computing a witness for bistability.

13 May 2020 in arXiv
Verified
Preprint
Open access
PDF file
JWJie Wang
Jie Wang
VMVictor Magron
Victor Magron
JLJean Bernard LASSERRE
Jean Bernard LASSERRE
This paper is concerned with polynomial optimization problems. We show how to exploit term (or monomial) sparsity of the input polynomials to obtain a new converging hierarchy of semidefinite programming relaxations. The novelty (and distinguishing feature) of such relaxations is to involve block-diagonal matrices obtained in an iterative procedure performing completion of the connected components of certain adjacency graphs. The graphs are related to the terms arising in the original data and not to the links between variables. Our theoretical framework is then applied to compute lower bounds for polynomial optimization problems either randomly generated or coming from the networked systems literature.

5 April 2021 in arXiv
Verified
Preprint
Open access
PDF file
JWJie Wang
Jie Wang
The concept of sums of nonnegative circuit polynomials (SONC) was recently introduced as a new certificate of nonnegativity especially for sparse polynomials. In this paper, we explore the relationship between nonnegative polynomials and SONC polynomials. As a first result, we provide sufficient conditions for nonnegative polynomials with general Newton polytopes to be SONC polynomials, which generalizes the previous result on nonnegative polynomials with simplex Newton polytopes. Secondly, we prove that every SONC polynomial admits a SONC decomposition without cancellation. In other words, SONC decompositions can exactly preserve the sparsity of nonnegative polynomials, which is dramatically different from the classical sum of squares (SOS) decompositions and is a key property to design efficient algorithms for sparse polynomial optimization based on SONC decompositions.

24 August 2021 in arXiv
Verified
Preprint
Open access
PDF file
VMVictor Magron
Victor Magron
JWJie Wang
Jie Wang
The second-order cone (SOC) is a class of simple convex cones and optimizing over them can be done more efficiently than with semidefinite programming. It is interesting both in theory and in practice to investigate which convex cones admit a representation using SOCs, given that they have a strong expressive ability. In this paper, we prove constructively that the cone of sums of nonnegative circuits (SONC) admits a SOC representation. Based on this, we give a new algorithm for unconstrained polynomial optimization via SOC programming. We also provide a hybrid numeric-symbolic scheme which combines the numerical procedure with a rounding-projection algorithm to obtain exact nonnegativity certificates. Numerical experiments demonstrate the efficiency of our algorithm for polynomials with fairly large degree and number of variables.