84 citations · 342 across the 90 of their papers we have counts for
11 papers · 1 filter
Certified bounds on optimization problems in quantum theory
Younes Naceur, Jie Wang, Victor Magron +1
Semidefinite relaxations of polynomial optimization have become a central tool for addressing the non-convex optimization problems over non-commutative operators that are ubiquitou…
Inclusion constants for free spectrahedra with applications to quantum incompatibility
Andreas Bluhm, Eric Evert, Igor Klep +2
Building on the matrix cube problem, inclusions of free spectrahedra have been used successfully to obtain relaxations of hard spectrahedral inclusion problems. The quality of such…
Finite Convergence of the Moment-SOS Hierarchy on the Product of Spheres
Sami Halaseh, Victor Magron, Mateusz Skomra
We study the polynomial optimization problem of minimizing a multihomogeneous polynomial over the product of spheres. This polynomial optimization problem models the tensor optimiz…
Exploiting Term Sparsity in Symmetry-Adapted Basis for Polynomial Optimization
Igor Klep, Victor Magron, Tobias Metzlaff +1
Polynomial optimization problems are infinite-dimensional, nonconvex, NP-hard, and are often handled in practice with the moment-sums of squares hierarchy of semidefinite programmi…
Moment-SOS hierarchies for arrow-type polynomial matrix inequalities with applications to structural optimization
Marouan Handa, Marek Tyburec, Giovanni Fantuzzi +2
The Arrow Decomposition (AD) technique, initially introduced in [Mathematical Programming 190(1-2) (2021), pp 105-134], demonstrated superior scalability over the classical chordal…
Mixtures Closest to a Given Measure: A Semidefinite Programming Approach
Srećko Đurašinović, Jean-Bernard Lasserre, Victor Magron
Mixture models, such as Gaussian mixture models, are widely used in machine learning to represent complex data distributions. A key challenge, especially in high-dimensional settin…
Approximating the order 2 quantum Wasserstein distance using the moment-SOS hierarchy
Saroj Prasad Chhatoi, Victor Magron
Optimal transport theory has recently been extended to quantum settings, where the density matrices generalize the probability measures. In this paper, we study the computational a…
Convergence rates for polynomial optimization on set products
Victor Magron
We consider polynomial optimization problems on Cartesian products of basic compact semialgebraic sets. The solution of such problems can be approximated as closely as desired by h…
Detecting Destabilizing Nonlinearities in Absolute Stability Analysis of Discrete-Time Feedback Systems
Hibiki Gyotoku, Tsuyoshi Yuno, Yoshio Ebihara +3
This paper is concerned with the absolute stability analysis of discrete-time feedback systems with slope-restricted nonlinearities. By employing static O'Shea-Zames-Falb multiplie…
Leveraging Christoffel-Darboux Kernels to Strengthen Moment-SOS Relaxations
Srećko Ðurašinović, Perla Azzi, Jean-Bernard Lasserre +3
The classical Moment-SOS hierarchy allows one to approximate the global minimum of a polynomial optimization problem through semidefinite relaxations of increasing accuracy. For ma…
On the Complexity of p-Order Cone Programs
Víctor Blanco, Victor Magron, Miguel Martínez-Antón
This manuscript explores novel complexity results for the feasibility problem over -order cones, extending the foundational work of Porkolab and Khachiyan. By leveraging the int…