Certification of inequalities involving transcendental functions: Combining SDP and max-plus approximation. - Xavier Allamigeon; Stephane Gaubert; Victor Magron; Benjamin Werner (ECC, 2013)

Certification of Bounds of Non-linear Functions: The Templates Method. - Xavier Allamigeon; Stéphane Gaubert; Victor Magron; Benjamin Werner (MKM/Calculemus/DML, 2013)

Formal Proofs for Global Optimization - Templates and Sums of Squares. (Preuves formelles pour l'optimisation globale - Méthodes de gabarits et sommes de carrés). - Victor Magron (2013)

NLCertify: A Tool for Formal Nonlinear Optimization. - Victor Magron (ICMS, 2014)

Polynomial Template Generation using Sum-of-Squares Programming. - Assalé Adjé; Victor Magron (CoRR, 2014)

Approximating Pareto curves using semidefinite relaxations. - Victor Magron; Didier Henrion; Jean-Bernard Lasserre (Oper. Res. Lett., 2014)

Property-based Polynomial Invariant Generation Using Sums-of-Squares Optimization. - Assalé Adjé; Pierre-Loïc Garoche; Victor Magron (SAS, 2015)

A Sums-of-Squares Extension of Policy Iterations. - Assalé Adjé; Pierre-Loïc Garoche; Victor Magron (CoRR, 2015)

A formal proof of the Kepler conjecture. - Thomas C. Hales; Mark Adams; Gertrud Bauer; Dat Tat Dang; John Harrison 001; Truong Le Hoang; Cezary Kaliszyk; Victor Magron; Sean McLaughlin; Thang Tat Nguyen; Truong Quang Nguyen; Tobias Nipkow; et al. (CoRR, 2015)

Formal Proofs for Nonlinear Optimization. - Victor Magron; Xavier Allamigeon; Stéphane Gaubert; Benjamin Werner (J. Formaliz. Reason., 2015)

Certification of real inequalities: templates and sums of squares. - Victor Magron; Xavier Allamigeon; Stéphane Gaubert; Benjamin Werner (Math. Program., 2015)

Error bounds for polynomial optimization over the hypercube using putinar type representations. - Victor Magron (Optim. Lett., 2015)

Semidefinite Approximations of Projections and Polynomial Images of SemiAlgebraic Sets. - Victor Magron; Didier Henrion; Jean-Bernard Lasserre (SIAM J. Optim., 2015)

Certified Lower Bounds of Roundoff Errors using Semidefinite Programming. - Victor Magron; Mountassir Farid (CoRR, 2016)

Algorithms for Weighted Sums of Squares Decomposition of Non-negative Univariate Polynomials. - Victor Magron; Mohab Safey El Din; Markus Schweighofer (CoRR, 2017)

Occupation measure methods for modelling and analysis of biological hybrid automata. - Thao Dang 001; Eric Fanchon; Marcelo Forets; Victor Magron; Alexandre Rocca (CoRR, 2017)

Certified Roundoff Error Bounds Using Semidefinite Programming. - Victor Magron; George A. Constantinides; Alastair F. Donaldson (ACM Trans. Math. Softw., 2017)

Occupation measure methods for modelling and analysis of biological hybrid systems. - Alexandre Rocca; Marcelo Forets; Victor Magron; Eric Fanchon; Thao Dang 001 (ADHS, 2018)

On Exact Polya and Putinar's Representations. - Victor Magron; Mohab Safey El Din (ISSAC, 2018)

Realcertify: a maple package for certifying non-negativity. - Victor Magron; Mohab Safey El Din (ACM Commun. Comput. Algebra, 2018)

On Exact Polya, Hilbert-Artin and Putinar's Representations. - Victor Magron; Mohab Safey El Din (CoRR, 2018)

Optimal Data Fitting: A Moment Approach. - Jean-Bernard Lasserre; Victor Magron (SIAM J. Optim., 2018)

Interval Enclosures of Upper Bounds of Roundoff Errors Using Semidefinite Programming. - Victor Magron (ACM Trans. Math. Softw., 2018)

Exact Optimization via Sums of Nonnegative Circuits and Arithmetic-geometric-mean-exponentials. - Victor Magron; Henning Seidler; Timo de Wolff (ISSAC, 2019)

Exact Optimization via Sums of Nonnegative Circuits and Sums of AM/GM Exponentials. - Victor Magron; Henning Seidler; Timo de Wolff (CoRR, 2019)

Algorithms for weighted sum of squares decomposition of non-negative univariate polynomials. - Victor Magron; Mohab Safey El Din; Markus Schweighofer (J. Symb. Comput., 2019)

Semidefinite Approximations of Reachable Sets for Discrete-time Polynomial Systems. - Victor Magron; Pierre-Loïc Garoche; Didier Henrion; Xavier Thirioux (SIAM J. Control. Optim., 2019)

In SDP Relaxations, Inaccurate Solvers Do Robust Optimization. - Jean-Bernard Lasserre; Victor Magron (SIAM J. Optim., 2019)

Certified Roundoff Error Bounds Using Bernstein Expansions and Sparse Krivine-Stengle Representations. - Victor Magron; Alexandre Rocca; Thao Dang 001 (IEEE Trans. Computers, 2019)

A second order cone characterization for sums of nonnegative circuits. - Jie Wang 037; Victor Magron (ISSAC, 2020)

Semialgebraic Optimization for Lipschitz Constants of ReLU Networks. - Tong Chen 002; Jean B. Lasserre; Victor Magron; Edouard Pauwels (NeurIPS, 2020)

Polynomial Optimization for Bounding Lipschitz Constants of Deep Networks. - Tong Chen 002; Jean-Bernard Lasserre; Victor Magron; Edouard Pauwels (CoRR, 2020)

Optimal control of linear PDEs using occupation measures and SDP relaxations. - Victor Magron; Christophe Prieur 001 (IMA J. Math. Control. Inf., 2020)

Computing the Hausdorff Boundary Measure of Semialgebraic Sets. - Jean B. Lasserre; Victor Magron (SIAM J. Appl. Algebra Geom., 2020)

The quest of modeling, certification and efficiency in polynomial optimization. (La quête de modélisation, de certification et d'efficacité en optimisation polynomiale). - Victor Magron (2021)

SparseJSR: A Fast Algorithm to Compute Joint Spectral Radius via Sparse SOS Decompositions. - Jie Wang 037; Martina Maggio; Victor Magron (ACC, 2021)

Stability Analysis of Recurrent Neural Networks by IQC with Copositive Mutipliers. - Yoshio Ebihara; Hayato Waki; Victor Magron; Ngoc Hoang Anh Mai; Dimitri Peaucelle; Sophie Tarbouriech (CDC, 2021)

The Constant Trace Property in Noncommutative Optimization. - Ngoc Hoang Anh Mai; Abhishek Bhardwaj; Victor Magron (ISSAC, 2021)

Semialgebraic Representation of Monotone Deep Equilibrium Models and Applications to Certification. - Tong Chen 002; Jean B. Lasserre; Victor Magron; Edouard Pauwels (NeurIPS, 2021)

Exploiting term sparsity in noncommutative polynomial optimization. - Jie Wang 037; Victor Magron (Comput. Optim. Appl., 2021)

TSSOS: a Julia library to exploit sparsity for large-scale polynomial optimization. - Victor Magron; Jie Wang 037 (CoRR, 2021)

l2 induced norm analysis of discrete-time LTI systems for nonnegative input signals and its application to stability analysis of recurrent neural networks. - Yoshio Ebihara; Hayato Waki; Victor Magron; Ngoc Hoang Anh Mai; Dimitri Peaucelle; Sophie Tarbouriech (Eur. J. Control, 2021)

On exact Reznick, Hilbert-Artin and Putinar's representations. - Victor Magron; Mohab Safey El Din (J. Symb. Comput., 2021)

Minimizing Rational Functions: A Hierarchy of Approximations via Pushforward Measures. - Jean-Bernard Lasserre; Victor Magron; Swann Marx; Olivier Zahm (SIAM J. Optim., 2021)

TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity. - Jie Wang 037; Victor Magron; Jean-Bernard Lasserre (SIAM J. Optim., 2021)

Chordal-TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity with Chordal Extension. - Jie Wang 037; Victor Magron; Jean-Bernard Lasserre (SIAM J. Optim., 2021)

L2+ Induced Norm Analysis of Continuous-Time LTI Systems Using Positive Filters and Copositive Programming. - Yoshio Ebihara; Hayato Motooka; Hayato Waki; Noboru Sebe; Victor Magron; Dimitri Peaucelle; Sophie Tarbouriech (ECC, 2022)

Exact SOHS Decompositions of Trigonometric Univariate Polynomials with Gaussian Coefficients. - Victor Magron; Mohab Safey El Din; Markus Schweighofer; Trung Hieu Vu (ISSAC, 2022)

A sublevel moment-SOS hierarchy for polynomial optimization. - Tong Chen 002; Jean-Bernard Lasserre; Victor Magron; Edouard Pauwels (Comput. Optim. Appl., 2022)

Sparse Polynomial Optimization: Theory and Practice. - Victor Magron; Jie Wang 037 (CoRR, 2022)

Tractable hierarchies of convex relaxations for polynomial optimization on the nonnegative orthant. - Ngoc Hoang Anh Mai; Victor Magron; Jean-Bernard Lasserre; Kim-Chuan Toh (CoRR, 2022)

Stability of Linear Systems Under Extended Weakly-Hard Constraints. - Nils Vreman; Paolo Pazzaglia; Victor Magron; Jie Wang 037; Martina Maggio (IEEE Control. Syst. Lett., 2022)

On the complexity of Putinar-Vasilescu's Positivstellensatz. - Ngoc Hoang Anh Mai; Victor Magron (J. Complex., 2022)

Exploiting Sparsity in Complex Polynomial Optimization. - Jie Wang 037; Victor Magron (J. Optim. Theory Appl., 2022)

Sparse noncommutative polynomial optimization. - Igor Klep; Victor Magron; Janez Povh (Math. Program., 2022)

Positivity certificates and polynomial optimization on non-compact semialgebraic sets. - Ngoc Hoang Anh Mai; Jean-Bernard Lasserre; Victor Magron (Math. Program., 2022)

Exploiting Constant Trace Property in Large-scale Polynomial Optimization. - Ngoc Hoang Anh Mai; Jean B. Lasserre; Victor Magron; Jie Wang 037 (ACM Trans. Math. Softw., 2022)

CS-TSSOS: Correlative and Term Sparsity for Large-Scale Polynomial Optimization. - Jie Wang 037; Victor Magron; Jean B. Lasserre; Ngoc Hoang Anh Mai (ACM Trans. Math. Softw., 2022)

Sparse Polynomial Optimization - Theory and Practice - Victor Magron; Jie Wang 037 (Sparse Polynomial Optimization, 2023)

Peak Estimation of Time Delay Systems Using Occupation Measures. - Jared Miller; Milan Korda; Victor Magron; Mario Sznaier (CDC, 2023)

Pourchet's theorem in action: decomposing univariate nonnegative polynomials as sums of five squares. - Przemyslaw Koprowski; Victor Magron; Tristan Vaccon (ISSAC, 2023)

Local Lipschitz Constant Computation of ReLU-FNNs: Upper Bound Computation with Exactness Verification. - Yoshio Ebihara; Xin Dai; Victor Magron; Dimitri Peaucelle; Sophie Tarbouriech (CoRR, 2023)

Revisiting Semidefinite Programming Approaches to Options Pricing: Complexity and Computational Perspectives. - Didier Henrion; Felix Kirschner; Etienne de Klerk; Milan Korda; Jean-Bernard Lasserre; Victor Magron (INFORMS J. Comput., 2023)

SONC optimization and exact nonnegativity certificates via second-order cone programming. - Victor Magron; Jie Wang 037 (J. Symb. Comput., 2023)

Sum of Squares Decompositions of Polynomials over their Gradient Ideals with Rational Coefficients. - Victor Magron; Mohab Safey El Din; Trung Hieu Vu (SIAM J. Optim., 2023)

A Sparse Version of Reznick's Positivstellensatz. - Ngoc Hoang Anh Mai; Victor Magron; Jean B. Lasserre (Math. Oper. Res., 2023)

Correlations constrained by composite measurements. - John H. Selby; Ana Belén Sainz; Victor Magron; Lukasz Czekaj; Michal Horodecki (Quantum, 2023)

A hierarchy of spectral relaxations for polynomial optimization. - Ngoc Hoang Anh Mai; Jean-Bernard Lasserre; Victor Magron (Math. Program. Comput., 2023)

Exploiting Term Sparsity in Moment-SOS Hierarchy for Dynamical Systems. - Jie Wang 037; Corbinian Schlosser; Milan Korda; Victor Magron (IEEE Trans. Autom. Control., 2023)

Local Lipschitz Constant Computation of ReLU-FNNs: Upper Bound Computation with Exactness Verification. - Yoshio Ebihara; Xin Dai; Tsuyoshi Yuno; Victor Magron; Dimitri Peaucelle; Sophie Tarbouriech (ECC, 2024)

Exploiting ideal-sparsity in the generalized moment problem with application to matrix factorization ranks. - Milan Korda; Monique Laurent; Victor Magron; Andries Steenkamp (Math. Program., 2024)

State polynomials: positivity, optimization and nonlinear Bell inequalities. - Igor Klep; Victor Magron; Jurij Volcic; Jie Wang 037 (Math. Program., 2024)

Verifying Properties of Binary Neural Networks Using Sparse Polynomial Optimization. - Jianting Yang; Srecko Ðurasinovic; Jean B. Lasserre; Victor Magron; Jun Zhao (ICLR, 2025)

On the complexity of p-order cone programs. - Víctor Blanco; Victor Magron; Miguel Martínez-Antón (J. Complex., 2025)

Slow Convergence of the Moment-SOS Hierarchy for an Elementary Polynomial Optimization Problem. - Didier Henrion; Adrien Le Franc; Victor Magron (SIAM J. Appl. Algebra Geom., 2025)

A real moment-HSOS hierarchy for complex polynomial optimization with real coefficients. - Jie Wang 037; Victor Magron (Comput. Optim. Appl., 2025)

Convergence rates for sums-of-squares hierarchies with correlative sparsity. - Milan Korda; Victor Magron; Rodolfo Rios-Zertuche (Math. Program., 2025)

Computer-Assisted Proofs for Lyapunov Stability via Sums of Squares Certificates and Constructive Analysis. - Grigory Devadze; Victor Magron; Stefan Streif (J. Autom. Reason., 2025)