| A formal proof of the Kepler conjecture T Hales, M Adams, G Bauer, TD Dang, J Harrison, LT Hoang, C Kaliszyk, ... Forum of mathematics, Pi 5, e2, 2017 | 568 | 2017 |
| TSSOS: A Moment-SOS hierarchy that exploits term sparsity J Wang, V Magron, JB Lasserre SIAM Journal on Optimization 31 (1), 30-58, 2021 | 179 | 2021 |
| Certified roundoff error bounds using semidefinite programming V Magron, G Constantinides, A Donaldson ACM Transactions on Mathematical Software (TOMS) 43 (4), 1-31, 2017 | 125 | 2017 |
| CS-TSSOS: Correlative and term sparsity for large-scale polynomial optimization J Wang, V Magron, JB Lasserre, NHA Mai ACM Transactions on Mathematical Software 48 (4), 1-26, 2022 | 113 | 2022 |
| Chordal-TSSOS: a moment-SOS hierarchy that exploits term sparsity with chordal extension J Wang, V Magron, JB Lasserre SIAM Journal on Optimization 31 (1), 114-141, 2021 | 111 | 2021 |
| Sparse Polynomial Optimization: Theory and Practice V Magron, J Wang arXiv preprint arXiv:2208.11158, 2022 | 75 | 2022 |
| Semialgebraic Optimization for Lipschitz Constants of ReLU Networks T Chen, JB Lasserre, V Magron, E Pauwels Advances in Neural Information Processing Systems 33, 19189-19200, 2020 | 72 | 2020 |
| Sparse noncommutative polynomial optimization I Klep, V Magron, J Povh Mathematical Programming 193 (2), 789-829, 2022 | 54 | 2022 |
| Semidefinite approximations of reachable sets for discrete-time polynomial systems V Magron, PL Garoche, D Henrion, X Thirioux SIAM Journal on Control and Optimization 57 (4), 2799-2820, 2019 | 45 | 2019 |
| Exploiting term sparsity in noncommutative polynomial optimization J Wang, V Magron Computational Optimization and Applications 80 (2), 483-521, 2021 | 40 | 2021 |
| Semidefinite approximations of projections and polynomial images of semialgebraic sets V Magron, D Henrion, JB Lasserre SIAM Journal on Optimization 25 (4), 2143-2164, 2015 | 40 | 2015 |
| TSSOS: a Julia library to exploit sparsity for large-scale polynomial optimization V Magron, J Wang arXiv preprint arXiv:2103.00915, 2021 | 37 | 2021 |
| A second order cone characterization for sums of nonnegative circuits J Wang, V Magron Proceedings of the 45th International Symposium on Symbolic and Algebraic …, 2020 | 35 | 2020 |
| Algorithms for weighted sum of squares decomposition of non-negative univariate polynomials V Magron, MS El Din, M Schweighofer Journal of Symbolic Computation 93, 200-220, 2019 | 34 | 2019 |
| Formal proofs for nonlinear optimization V Magron, X Allamigeon, S Gaubert, B Werner arXiv preprint arXiv:1404.7282, 2014 | 32 | 2014 |
| SONC optimization and exact nonnegativity certificates via second-order cone programming V Magron, J Wang Journal of Symbolic Computation 115, 346-370, 2023 | 29 | 2023 |
| Exploiting constant trace property in large-scale polynomial optimization NHA Mai, JB Lasserre, V Magron, J Wang ACM Transactions on Mathematical Software 48 (4), 1-39, 2022 | 29 | 2022 |
| l2 induced norm analysis of discrete-time LTI systems for nonnegative input signals and its application to stability analysis of recurrent neural networks Y Ebihara, H Waki, V Magron, NHA Mai, D Peaucelle, S Tarbouriech European Journal of Control 62, 99-104, 2021 | 29 | 2021 |
| Semialgebraic Representation of Monotone Deep Equilibrium Models and Applications to Certification T Chen, JB Lasserre, V Magron, E Pauwels Advances in Neural Information Processing Systems 34, 2021 | 29 | 2021 |
| Stability of linear systems under extended weakly-hard constraints N Vreman, P Pazzaglia, V Magron, J Wang, M Maggio IEEE Control Systems Letters 6, 2900-2905, 2022 | 28* | 2022 |
Jean B. LasserreLAAS-CNRS & TSE, Toulouse France, ANITIVerified email at laas.fr
