8 citations · 17 across the 17 of their papers we have counts for
5 papers · 1 filter
Exploiting constant trace property in large-scale polynomial optimization
Ngoc Hoang Anh Mai, Jean-Bernard Lasserre, Victor Magron +1
We prove that every semidefinite moment relaxation of a polynomial optimization problem (POP) with a ball constraint can be reformulated as a semidefinite program involving a matri…
Induced Norm Analysis of Discrete-Time LTI Systems for Nonnegative Input Signals and Its Application to Stability Analysis of Recurrent Neural Networks
Yoshio Ebihara, Hayato Waki, Victor Magron +3
In this paper, we focus on the "positive" induced norm of discrete-time linear time-invariant systems where the input signals are restricted to be nonnegative. To cope with t…
A hierarchy of spectral relaxations for polynomial optimization
Ngoc Hoang Anh Mai, Victor Magron, Jean-Bernard Lasserre
We show that (i) any constrained polynomial optimization problem (POP) has an equivalent formulation on a variety contained in an Euclidean sphere and (ii) the resulting semidefini…
CS-TSSOS: Correlative and term sparsity for large-scale polynomial optimization
Jie Wang, Victor Magron, Jean B. Lasserre +1
This work proposes a new moment-SOS hierarchy, called CS-TSSOS, for solving large-scale sparse polynomial optimization problems. Its novelty is to exploit simultaneously correlativ…
A sparse version of Reznick's Positivstellensatz
Ngoc Hoang Anh Mai, Victor Magron, Jean-Bernard Lasserre
If is a positive definite form, Reznick's Positivstellensatz [Mathematische Zeitschrift. 220 (1995), pp. 75--97] states that there exists such that ${\| x \|^{…