8 citations · 15 across the 8 of their papers we have counts for
10 papers
Semi-algebraic description of the closure of the image of a semi-algebraic set under a polynomial
Ngoc Hoang Anh Mai
Given a polynomial and a semi-algebraic set , we provide a symbolic algorithm to find the equations and inequalities defining a semi-algebraic set which is identical to…
Tractable semidefinite bounds of positive maximal singular values
Victor Magron, Ngoc Hoang Anh Mai, Yoshio Ebihara +1
We focus on computing certified upper bounds for the positive maximal singular value (PMSV) of a given matrix. The PMSV problem boils down to maximizing a quadratic polynomial on t…
Stability Analysis of Recurrent Neural Networks by IQC with Copositive Mutipliers
Yoshio Ebihara, Hayato Waki, Victor Magron +3
This paper is concerned with the stability analysis of the recurrent neural networks (RNNs) by means of the integral quadratic constraint (IQC) framework. The rectified linear unit…
On the complexity of Putinar-Vasilescu's Positivstellensatz
Ngoc Hoang Anh Mai, Victor Magron
We provide a new degree bound on the weighted sum-of-squares (SOS) polynomials for Putinar-Vasilescu's Positivstellensatz. This leads to another Positivstellensatz saying that if $…
The Constant Trace Property in Noncommutative Optimization
Ngoc Hoang Anh Mai, Abhishek Bhardwaj, Victor Magron
In this article, we show that each semidefinite relaxation of a ball-constrained noncommutative polynomial optimization problem can be cast as a semidefinite program with a constan…
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…