no code implementations • 13 Sep 2022 • Ngoc Hoang Anh Mai, Victor Magron, Jean-Bernard Lasserre, Kim-Chuan Toh
We consider polynomial optimization problems (POP) on a semialgebraic set contained in the nonnegative orthant (every POP on a compact set can be put in this format by a simple translation of the origin).
no code implementations • 9 Feb 2022 • Yoshio Ebihara, Hayato Waki, Victor Magron, Ngoc Hoang Anh Mai, Dimitri Peaucelle, Sophie Tarbouriech
To get around this difficulty, we loosen the standard positive semidefinite cone to the copositive cone, and employ copositive multipliers to capture the nonnegativity properties.
no code implementations • 3 Feb 2021 • 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 constant trace matrix variable.
Optimization and Control
1 code implementation • 4 Jan 2021 • Thi Lan Dinh, Ngoc Hoang Anh Mai
We consider the problem of minimizing a convex, nonsmooth function subject to a closed convex constraint domain.
2 code implementations • 26 Nov 2019 • Ngoc Hoang Anh Mai, Jean-Bernard Lasserre, Victor Magron
As a consequence, it allows one to define a hierarchy of semidefinite relaxations for a general polynomial optimization problem.
Optimization and Control
