84 citations · 342 across the 90 of their papers we have counts for
5 papers · 1 filter
Positivity certificates and polynomial optimization on non-compact semialgebraic sets
Ngoc Hoang Anh Mai, Jean-Bernard Lasserre, Victor Magron
In a first contribution, we revisit two certificates of positivity on (possibly non-compact) basic semialgebraic sets due to Putinar and Vasilescu [Comptes Rendus de l'Académie des…
TSSOS: A Moment-SOS hierarchy that exploits term sparsity
Jie Wang, Victor Magron, 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 s…
Sparse Noncommutative Polynomial Optimization
Igor Klep, Victor Magron, Janez Povh
This article focuses on optimization of polynomials in noncommuting variables, while taking into account sparsity in the input data. A converging hierarchy of semidefinite relaxati…
A second order cone characterization for sums of nonnegative circuits
Jie Wang, Victor Magron
The second-order cone 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 a…
Exact Optimization via Sums of Nonnegative Circuits and Sums of AM/GM Exponentials
Victor Magron, Henning Seidler, Timo de Wolff
We provide two hybrid numeric-symbolic optimization algorithms, computing exact sums of nonnegative circuits (SONC) and sums of arithmetic-geometric-exponentials (SAGE) decompositi…