Victor Magron
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Victor Magron has a total of 73 co-authors. Here are the top co-authors by number of shared publications:
- Jean Bernard Lasserre
LAAS-CNRS, Toulouse, France
19 shared publications - Jie Wang
State Key Laboratory of Mathematical Sciences, Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing, China
13 shared publications - Igor Klep
Faculty of Mathematics and Physics, University of Ljubljana, Ljubljana, Slovenia
10 shared publications - Jurij Volčič
University of Auckland
9 shared publications - Milan Korda
LAAS-CNRS Université de Toulouse CNRS 7 avenue du colonel Roche F-31400 Toulouse France
6 shared publications - Didier Henrion
CNRS; LAAS; Université de Toulouse, 7 avenue du colonel Roche, F-31400 Toulouse, France
5 shared publications
Latest Publications
- 28 August 2026
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Optimization
- Vol. 36 (3) , 1867-1886
Convergence Rates for Polynomial Optimization on Set Products
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 hierarchies of semidefinite programming relaxations, based on classical sums of squares certificates due to Putinar and Schmüdgen. When the feasible set is the bisphere, i.e., the Cartesian product of two unit spheres, we show that the hierarchies based on the Schmüdgen/Putinar-type certificates converge to the global minimum of the objective polynomial at a rate in [Formula: see text], where [Formula: see text] is the relaxation order. Our proof is based on the polynomial kernel method. We extend this result to arbitrary sphere products and give a general recipe to obtain convergence rates for polynomial optimization over products of distinct sets. Eventually, we rely on our results for the bisphere to analyze the speed of convergence of a semidefinite programming hierarchy approximating the order 2 quantum Wasserstein distance.
- 28 August 2026
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Optimization
- Vol. 36 (3) , 1867-1886
Convergence Rates for Polynomial Optimization on Set Products
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 hierarchies of semidefinite programming relaxations, based on classical sums of squares certificates due to Putinar and Schmüdgen. When the feasible set is the bisphere, i.e., the Cartesian product of two unit spheres, we show that the hierarchies based on the Schmüdgen/Putinar-type certificates converge to the global minimum of the objective polynomial at a rate in [Formula: see text], where [Formula: see text] is the relaxation order. Our proof is based on the polynomial kernel method. We extend this result to arbitrary sphere products and give a general recipe to obtain convergence rates for polynomial optimization over products of distinct sets. Eventually, we rely on our results for the bisphere to analyze the speed of convergence of a semidefinite programming hierarchy approximating the order 2 quantum Wasserstein distance.
- 11 August 2026
- Published by Springer Nature
- p. 2773-2802
Positivity of State, Trace, and Moment Polynomials and Applications in Quantum Information
- 11 August 2026
- Published by Springer Nature
- p. 2773-2802
Positivity of State, Trace, and Moment Polynomials and Applications in Quantum Information
- 13 May 2026
- Published by Elsevier in Journal of Mathematical Analysis and Applications
- Vol. 563 (1)
Complete upper bound hierarchies for spectral minimum in noncommutative polynomial optimization
- 13 May 2026
- Published by Elsevier in Journal of Mathematical Analysis and Applications
- Vol. 563 (1)
Complete upper bound hierarchies for spectral minimum in noncommutative polynomial optimization
- 20 February 2026
- Published by Springer Nature in Optimization Letters
- Vol. 20 (6) , 1121-1136
Approximating the order 2 quantum Wasserstein distance using the moment-SOS hierarchy
- 20 February 2026
- Published by Springer Nature in Optimization Letters
- Vol. 20 (6) , 1121-1136
Approximating the order 2 quantum Wasserstein distance using the moment-SOS hierarchy
- Open Access
Inclusion constants for free spectrahedra with applications to quantum incompatibility
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 a relaxation is quantified by the inclusion constant associated with each free spectrahedron. While optimal values of inclusion constants were known in certain highly symmetric cases, no general method for computing them was available. In this work, we show that inclusion constants for Cartesian products of free simplices can be computed using methods from non-commutative polynomial optimization, together with a detailed analysis of the extreme points of the associated free spectrahedra. This analysis also yields new closed-form analytic expressions for these constants. As an application to quantum information theory, we prove new bounds on the amount of white noise that incompatible measurements can tolerate before they become compatible. In particular, we study the case of one dichotomic and one $k$-outcome measurement, as well as the case of four dichotomic qubit measurements.
Open AccessInclusion constants for free spectrahedra with applications to quantum incompatibility
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 a relaxation is quantified by the inclusion constant associated with each free spectrahedron. While optimal values of inclusion constants were known in certain highly symmetric cases, no general method for computing them was available. In this work, we show that inclusion constants for Cartesian products of free simplices can be computed using methods from non-commutative polynomial optimization, together with a detailed analysis of the extreme points of the associated free spectrahedra. This analysis also yields new closed-form analytic expressions for these constants. As an application to quantum information theory, we prove new bounds on the amount of white noise that incompatible measurements can tolerate before they become compatible. In particular, we study the case of one dichotomic and one $k$-outcome measurement, as well as the case of four dichotomic qubit measurements.
- Open Access
Exploiting Term Sparsity in Symmetry-Adapted Basis for Polynomial Optimization
Polynomial optimization problems are infinite-dimensional, nonconvex, NP-hard, and are often handled in practice with the moment-sums of squares hierarchy of semidefinite programming bounds. We consider problems where the objective function and constraint polynomials are invariant under the action of a finite group. The present paper simultaneously exploits group symmetry and term sparsity in order to reduce the computational cost of the hierarchy. We first exploit symmetry by writing the semidefinite matrices in a symmetry-adapted basis according to an isotypic decomposition. The matrices in such a basis are block diagonal. Secondly, we exploit term sparsity on each block to further reduce the optimization matrix variables. This is a non-trivial extension of the term sparsity-based hierarchy related to sign symmetry that was introduced by two of the authors. Our method is compared with existing techniques via benchmarks on quartics with dihedral, cyclic and symmetric group symmetry.
Open AccessExploiting Term Sparsity in Symmetry-Adapted Basis for Polynomial Optimization
Polynomial optimization problems are infinite-dimensional, nonconvex, NP-hard, and are often handled in practice with the moment-sums of squares hierarchy of semidefinite programming bounds. We consider problems where the objective function and constraint polynomials are invariant under the action of a finite group. The present paper simultaneously exploits group symmetry and term sparsity in order to reduce the computational cost of the hierarchy. We first exploit symmetry by writing the semidefinite matrices in a symmetry-adapted basis according to an isotypic decomposition. The matrices in such a basis are block diagonal. Secondly, we exploit term sparsity on each block to further reduce the optimization matrix variables. This is a non-trivial extension of the term sparsity-based hierarchy related to sign symmetry that was introduced by two of the authors. Our method is compared with existing techniques via benchmarks on quartics with dihedral, cyclic and symmetric group symmetry.
- Open Access
Mixtures Closest to a Given Measure: A Semidefinite Programming Approach
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 settings, is to determine the mixture order and estimate the mixture parameters. We study the problem of approximating a target measure, available only through finitely many of its moments, by a mixture of distributions from a parametric family (e.g., Gaussian, exponential, Poisson), with approximation quality measured by the 2-Wasserstein or the total variation distance. Unlike many existing approaches, the parameter set is not assumed to be finite; it is modeled as a compact basic semi-algebraic set. We introduce a hierarchy of semidefinite relaxations with asymptotic convergence to the desired optimal value. In addition, when a certain rank condition is satisfied, the convergence is even finite and recovery of an optimal mixing measure is obtained. We also present an application to clustering, where our framework serves either as a stand-alone method or as a preprocessing step that yields both the number of clusters and strong initial parameter estimates, thereby accelerating convergence of standard (local) clustering algorithms.
Open AccessMixtures Closest to a Given Measure: A Semidefinite Programming Approach
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 settings, is to determine the mixture order and estimate the mixture parameters. We study the problem of approximating a target measure, available only through finitely many of its moments, by a mixture of distributions from a parametric family (e.g., Gaussian, exponential, Poisson), with approximation quality measured by the 2-Wasserstein or the total variation distance. Unlike many existing approaches, the parameter set is not assumed to be finite; it is modeled as a compact basic semi-algebraic set. We introduce a hierarchy of semidefinite relaxations with asymptotic convergence to the desired optimal value. In addition, when a certain rank condition is satisfied, the convergence is even finite and recovery of an optimal mixing measure is obtained. We also present an application to clustering, where our framework serves either as a stand-alone method or as a preprocessing step that yields both the number of clusters and strong initial parameter estimates, thereby accelerating convergence of standard (local) clustering algorithms.
- Open Access
Moment-SOS hierarchies for arrow-type polynomial matrix inequalities with applications to structural optimization
The Arrow Decomposition (AD) technique, initially introduced in [Mathematical Programming 190(1-2) (2021), pp 105-134], demonstrated superior scalability over the classical chordal decomposition in the context of Linear Matrix Inequalities (LMIs) if the matrix in question satisfied suitable assumptions. The primary objective of this paper is to extend the AD method to address Polynomial Optimization Problems (POPs) involving large-scale Polynomial Matrix Inequalities (PMIs), with the solution framework relying on moment-sum of square (mSOS) hierarchies. As a first step, we revisit the LMI case and weaken the conditions necessary for the key AD theorem presented in [Mathematical Programming 190(1-2) (2021), pp 105-134]. This modification allows the method to be applied to a broader range of problems. Next, we propose a practical procedure that reduces the number of additional variables, drawing on physical interpretations often found in structural optimization applications. For the PMI case, we explore two distinct approaches to combine the AD technique with mSOS hierarchies. One approach involves applying AD to the original POP before implementing the mSOS relaxation. The other approach applies AD directly to the mSOS relaxations of the POP. We establish convergence guarantees for both approaches and prove that theoretical properties extend to the polynomial case. Finally, we illustrate the significant computational advantages offered by the application of AD, particularly in the context of structural optimization problems.
Open AccessMoment-SOS hierarchies for arrow-type polynomial matrix inequalities with applications to structural optimization
The Arrow Decomposition (AD) technique, initially introduced in [Mathematical Programming 190(1-2) (2021), pp 105-134], demonstrated superior scalability over the classical chordal decomposition in the context of Linear Matrix Inequalities (LMIs) if the matrix in question satisfied suitable assumptions. The primary objective of this paper is to extend the AD method to address Polynomial Optimization Problems (POPs) involving large-scale Polynomial Matrix Inequalities (PMIs), with the solution framework relying on moment-sum of square (mSOS) hierarchies. As a first step, we revisit the LMI case and weaken the conditions necessary for the key AD theorem presented in [Mathematical Programming 190(1-2) (2021), pp 105-134]. This modification allows the method to be applied to a broader range of problems. Next, we propose a practical procedure that reduces the number of additional variables, drawing on physical interpretations often found in structural optimization applications. For the PMI case, we explore two distinct approaches to combine the AD technique with mSOS hierarchies. One approach involves applying AD to the original POP before implementing the mSOS relaxation. The other approach applies AD directly to the mSOS relaxations of the POP. We establish convergence guarantees for both approaches and prove that theoretical properties extend to the polynomial case. Finally, we illustrate the significant computational advantages offered by the application of AD, particularly in the context of structural optimization problems.
- 12 March 2025
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Applied Algebra and Geometry
- Vol. 9 (1) , 261-278
Slow Convergence of the Moment-SOS Hierarchy for an Elementary Polynomial Optimization Problem
We describe a parametric univariate quadratic optimization problem for which the moment-SOS hierarchy has finite but increasingly slow convergence when the parameter tends to its limit value. We estimate the order of finite convergence as a function of the parameter.
- 12 March 2025
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Applied Algebra and Geometry
- Vol. 9 (1) , 261-278
Slow Convergence of the Moment-SOS Hierarchy for an Elementary Polynomial Optimization Problem
We describe a parametric univariate quadratic optimization problem for which the moment-SOS hierarchy has finite but increasingly slow convergence when the parameter tends to its limit value. We estimate the order of finite convergence as a function of the parameter.