default search action
Victor Magron
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j38]Milan Korda, Monique Laurent, Victor Magron, Andries Steenkamp:
Exploiting ideal-sparsity in the generalized moment problem with application to matrix factorization ranks. Math. Program. 205(1): 703-744 (2024) - [j37]Igor Klep, Victor Magron, Jurij Volcic, Jie Wang:
State polynomials: positivity, optimization and nonlinear Bell inequalities. Math. Program. 207(1): 645-691 (2024) - [c19]Yoshio Ebihara, Xin Dai, Tsuyoshi Yuno, Victor Magron, Dimitri Peaucelle, Sophie Tarbouriech:
Local Lipschitz Constant Computation of ReLU-FNNs: Upper Bound Computation with Exactness Verification. ECC 2024: 2506-2511 - [i33]Jianting Yang, Srecko Ðurasinovic, Jean-Bernard Lasserre, Victor Magron, Jun Zhao:
Verifying Properties of Binary Neural Networks Using Sparse Polynomial Optimization. CoRR abs/2405.17049 (2024) - 2023
- [b3]Victor Magron, Jie Wang:
Sparse Polynomial Optimization - Theory and Practice. Series on Optimization and its Applications 5, WorldScientific 2023, ISBN 9781800612945, pp. 1-224 - [j36]Didier Henrion, Felix Kirschner, Etienne de Klerk, Milan Korda, Jean-Bernard Lasserre, Victor Magron:
Revisiting Semidefinite Programming Approaches to Options Pricing: Complexity and Computational Perspectives. INFORMS J. Comput. 35(2): 335-349 (2023) - [j35]Victor Magron, Jie Wang:
SONC optimization and exact nonnegativity certificates via second-order cone programming. J. Symb. Comput. 115: 346-370 (2023) - [j34]Ngoc Hoang Anh Mai, Victor Magron, Jean B. Lasserre:
A Sparse Version of Reznick's Positivstellensatz. Math. Oper. Res. 48(2): 812-833 (2023) - [j33]Ngoc Hoang Anh Mai, Jean-Bernard Lasserre, Victor Magron:
A hierarchy of spectral relaxations for polynomial optimization. Math. Program. Comput. 15(4): 651-701 (2023) - [j32]John H. Selby, Ana Belén Sainz, Victor Magron, Lukasz Czekaj, Michal Horodecki:
Correlations constrained by composite measurements. Quantum 7: 1080 (2023) - [j31]Victor Magron, Mohab Safey El Din, Trung Hieu Vu:
Sum of Squares Decompositions of Polynomials over their Gradient Ideals with Rational Coefficients. SIAM J. Optim. 33(1): 63-88 (2023) - [j30]Jie Wang, Corbinian Schlosser, Milan Korda, Victor Magron:
Exploiting Term Sparsity in Moment-SOS Hierarchy for Dynamical Systems. IEEE Trans. Autom. Control. 68(12): 8232-8237 (2023) - [c18]Jared Miller, Milan Korda, Victor Magron, Mario Sznaier:
Peak Estimation of Time Delay Systems Using Occupation Measures. CDC 2023: 5294-5300 - [c17]Przemyslaw Koprowski, Victor Magron, Tristan Vaccon:
Pourchet's theorem in action: decomposing univariate nonnegative polynomials as sums of five squares. ISSAC 2023: 425-433 - [i32]Victor Magron, Przemyslaw Koprowski, Tristan Vaccon:
Pourchet's theorem in action: decomposing univariate nonnegative polynomials as sums of five squares. CoRR abs/2302.02202 (2023) - [i31]Jared Miller, Milan Korda, Victor Magron, Mario Sznaier:
Peak Estimation of Time Delay Systems using Occupation Measures. CoRR abs/2303.12863 (2023) - [i30]Milan Korda, Victor Magron, Rodolfo Rios-Zertuche:
Convergence rates for sums-of-squares hierarchies with correlative sparsity. CoRR abs/2303.14824 (2023) - [i29]Yoshio Ebihara, Xin Dai, Victor Magron, Dimitri Peaucelle, Sophie Tarbouriech:
Local Lipschitz Constant Computation of ReLU-FNNs: Upper Bound Computation with Exactness Verification. CoRR abs/2310.11104 (2023) - 2022
- [j29]Tong Chen, Jean-Bernard Lasserre, Victor Magron, Edouard Pauwels:
A sublevel moment-SOS hierarchy for polynomial optimization. Comput. Optim. Appl. 81(1): 31-66 (2022) - [j28]Nils Vreman, Paolo Pazzaglia, Victor Magron, Jie Wang, Martina Maggio:
Stability of Linear Systems Under Extended Weakly-Hard Constraints. IEEE Control. Syst. Lett. 6: 2900-2905 (2022) - [j27]Ngoc Hoang Anh Mai, Victor Magron:
On the complexity of Putinar-Vasilescu's Positivstellensatz. J. Complex. 72: 101663 (2022) - [j26]Jie Wang, Victor Magron:
Exploiting Sparsity in Complex Polynomial Optimization. J. Optim. Theory Appl. 192(1): 335-359 (2022) - [j25]Igor Klep, Victor Magron, Janez Povh:
Sparse noncommutative polynomial optimization. Math. Program. 193(2): 789-829 (2022) - [j24]Ngoc Hoang Anh Mai, Jean-Bernard Lasserre, Victor Magron:
Positivity certificates and polynomial optimization on non-compact semialgebraic sets. Math. Program. 194(1): 443-485 (2022) - [j23]Ngoc Hoang Anh Mai, Jean B. Lasserre, Victor Magron, Jie Wang:
Exploiting Constant Trace Property in Large-scale Polynomial Optimization. ACM Trans. Math. Softw. 48(4): 40:1-40:39 (2022) - [j22]Jie Wang, Victor Magron, Jean B. Lasserre, Ngoc Hoang Anh Mai:
CS-TSSOS: Correlative and Term Sparsity for Large-Scale Polynomial Optimization. ACM Trans. Math. Softw. 48(4): 42:1-42:26 (2022) - [c16]Yoshio Ebihara, Hayato Motooka, Hayato Waki, Noboru Sebe, Victor Magron, Dimitri Peaucelle, Sophie Tarbouriech:
L2+ Induced Norm Analysis of Continuous-Time LTI Systems Using Positive Filters and Copositive Programming. ECC 2022: 1385-1390 - [c15]Victor Magron, Mohab Safey El Din, Markus Schweighofer, Trung Hieu Vu:
Exact SOHS Decompositions of Trigonometric Univariate Polynomials with Gaussian Coefficients. ISSAC 2022: 325-332 - [i28]Yoshio Ebihara, Hayato Waki, Victor Magron, Ngoc Hoang Anh Mai, Dimitri Peaucelle, Sophie Tarbouriech:
Stability Analysis of Recurrent Neural Networks by IQC with Copositive Mutipliers. CoRR abs/2202.04592 (2022) - [i27]Victor Magron, Mohab Safey El Din, Markus Schweighofer, Trung Hieu Vu:
Exact SOHS decompositions of trigonometric univariate polynomials with Gaussian coefficients. CoRR abs/2202.06544 (2022) - [i26]Victor Magron, Jie Wang:
Sparse Polynomial Optimization: Theory and Practice. CoRR abs/2208.11158 (2022) - [i25]Ngoc Hoang Anh Mai, Victor Magron, Jean-Bernard Lasserre, Kim-Chuan Toh:
Tractable hierarchies of convex relaxations for polynomial optimization on the nonnegative orthant. CoRR abs/2209.06175 (2022) - 2021
- [b2]Victor Magron:
The quest of modeling, certification and efficiency in polynomial optimization. (La quête de modélisation, de certification et d'efficacité en optimisation polynomiale). Paul Sabatier University, Toulouse, France, 2021 - [j21]Jie Wang, Victor Magron:
Exploiting term sparsity in noncommutative polynomial optimization. Comput. Optim. Appl. 80(2): 483-521 (2021) - [j20]Yoshio Ebihara, Hayato Waki, Victor Magron, Ngoc Hoang Anh Mai, Dimitri Peaucelle, Sophie Tarbouriech:
l2 induced norm analysis of discrete-time LTI systems for nonnegative input signals and its application to stability analysis of recurrent neural networks. Eur. J. Control 62: 99-104 (2021) - [j19]Victor Magron, Mohab Safey El Din:
On exact Reznick, Hilbert-Artin and Putinar's representations. J. Symb. Comput. 107: 221-250 (2021) - [j18]Jie Wang, Victor Magron, Jean-Bernard Lasserre:
TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity. SIAM J. Optim. 31(1): 30-58 (2021) - [j17]Jie Wang, Victor Magron, Jean-Bernard Lasserre:
Chordal-TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity with Chordal Extension. SIAM J. Optim. 31(1): 114-141 (2021) - [j16]Jean-Bernard Lasserre, Victor Magron, Swann Marx, Olivier Zahm:
Minimizing Rational Functions: A Hierarchy of Approximations via Pushforward Measures. SIAM J. Optim. 31(3): 2285-2306 (2021) - [c14]Jie Wang, Martina Maggio, Victor Magron:
SparseJSR: A Fast Algorithm to Compute Joint Spectral Radius via Sparse SOS Decompositions. ACC 2021: 2254-2259 - [c13]Yoshio Ebihara, Hayato Waki, Victor Magron, Ngoc Hoang Anh Mai, Dimitri Peaucelle, Sophie Tarbouriech:
Stability Analysis of Recurrent Neural Networks by IQC with Copositive Mutipliers. CDC 2021: 5098-5103 - [c12]Ngoc Hoang Anh Mai, Abhishek Bhardwaj, Victor Magron:
The Constant Trace Property in Noncommutative Optimization. ISSAC 2021: 297-304 - [c11]Tong Chen, Jean B. Lasserre, Victor Magron, Edouard Pauwels:
Semialgebraic Representation of Monotone Deep Equilibrium Models and Applications to Certification. NeurIPS 2021: 27146-27159 - [i24]Victor Magron, Jie Wang:
TSSOS: a Julia library to exploit sparsity for large-scale polynomial optimization. CoRR abs/2103.00915 (2021) - [i23]Victor Magron, Mohab Safey El Din, Trung Hieu Vu:
Sum of Squares Decompositions of Polynomials over their Gradient Ideals with Rational Coefficients. CoRR abs/2107.11825 (2021) - 2020
- [j15]Victor Magron, Christophe Prieur:
Optimal control of linear PDEs using occupation measures and SDP relaxations. IMA J. Math. Control. Inf. 37(1): 159-174 (2020) - [j14]Jean B. Lasserre, Victor Magron:
Computing the Hausdorff Boundary Measure of Semialgebraic Sets. SIAM J. Appl. Algebra Geom. 4(3): 441-469 (2020) - [c10]Jie Wang, Victor Magron:
A second order cone characterization for sums of nonnegative circuits. ISSAC 2020: 450-457 - [c9]Tong Chen, Jean B. Lasserre, Victor Magron, Edouard Pauwels:
Semialgebraic Optimization for Lipschitz Constants of ReLU Networks. NeurIPS 2020 - [i22]Tong Chen, Jean-Bernard Lasserre, Victor Magron, Edouard Pauwels:
Polynomial Optimization for Bounding Lipschitz Constants of Deep Networks. CoRR abs/2002.03657 (2020) - [i21]Jie Wang, Victor Magron, Jean B. Lasserre, Ngoc Hoang Anh Mai:
CS-TSSOS: Correlative and term sparsity for large-scale polynomial optimization. CoRR abs/2005.02828 (2020) - [i20]Grigory Devadze, Victor Magron, Stefan Streif:
Computer-assisted proofs for Lyapunov stability via Sums of Squares certificates and Constructive Analysis. CoRR abs/2006.09884 (2020) - [i19]Victor Magron, Jie Wang:
SONC Optimization and Exact Nonnegativity Certificates via Second-Order Cone Programming. CoRR abs/2012.07903 (2020)
2010 – 2019
- 2019
- [j13]Victor Magron, Mohab Safey El Din, Markus Schweighofer:
Algorithms for weighted sum of squares decomposition of non-negative univariate polynomials. J. Symb. Comput. 93: 200-220 (2019) - [j12]Victor Magron, Pierre-Loïc Garoche, Didier Henrion, Xavier Thirioux:
Semidefinite Approximations of Reachable Sets for Discrete-time Polynomial Systems. SIAM J. Control. Optim. 57(4): 2799-2820 (2019) - [j11]Jean-Bernard Lasserre, Victor Magron:
In SDP Relaxations, Inaccurate Solvers Do Robust Optimization. SIAM J. Optim. 29(3): 2128-2145 (2019) - [j10]Victor Magron, Alexandre Rocca, Thao Dang:
Certified Roundoff Error Bounds Using Bernstein Expansions and Sparse Krivine-Stengle Representations. IEEE Trans. Computers 68(7): 953-966 (2019) - [c8]Victor Magron, Henning Seidler, Timo de Wolff:
Exact Optimization via Sums of Nonnegative Circuits and Arithmetic-geometric-mean-exponentials. ISSAC 2019: 291-298 - [i18]Victor Magron, Henning Seidler, Timo de Wolff:
Exact Optimization via Sums of Nonnegative Circuits and Sums of AM/GM Exponentials. CoRR abs/1902.02123 (2019) - 2018
- [j9]Victor Magron, Mohab Safey El Din:
Realcertify: a maple package for certifying non-negativity. ACM Commun. Comput. Algebra 52(2): 34-37 (2018) - [j8]Jean-Bernard Lasserre, Victor Magron:
Optimal Data Fitting: A Moment Approach. SIAM J. Optim. 28(4): 3127-3144 (2018) - [j7]Victor Magron:
Interval Enclosures of Upper Bounds of Roundoff Errors Using Semidefinite Programming. ACM Trans. Math. Softw. 44(4): 41:1-41:18 (2018) - [c7]Alexandre Rocca, Marcelo Forets, Victor Magron, Eric Fanchon, Thao Dang:
Occupation measure methods for modelling and analysis of biological hybrid systems. ADHS 2018: 181-186 - [c6]Victor Magron, Mohab Safey El Din:
On Exact Polya and Putinar's Representations. ISSAC 2018: 279-286 - [i17]Victor Magron, Alexandre Rocca, Thao Dang:
Certified Roundoff Error Bounds using Bernstein Expansions and Sparse Krivine-Stengle Representations. CoRR abs/1802.04385 (2018) - [i16]Victor Magron, Mohab Safey El Din:
On Exact Polya and Putinar's Representations. CoRR abs/1802.10339 (2018) - [i15]Victor Magron, Mohab Safey El Din:
RealCertify: a Maple package for certifying non-negativity. CoRR abs/1805.02201 (2018) - [i14]Victor Magron, Mohab Safey El Din:
On Exact Polya, Hilbert-Artin and Putinar's Representations. CoRR abs/1811.10062 (2018) - 2017
- [j6]Victor Magron, George A. Constantinides, Alastair F. Donaldson:
Certified Roundoff Error Bounds Using Semidefinite Programming. ACM Trans. Math. Softw. 43(4): 34:1-34:31 (2017) - [c5]Alexandre Rocca, Victor Magron, Thao Dang:
Certified Roundoff Error Bounds Using Bernstein Expansions and Sparse Krivine-Stengle Representations. ARITH 2017: 74-81 - [i13]Victor Magron, Mohab Safey El Din, Markus Schweighofer:
Algorithms for Weighted Sums of Squares Decomposition of Non-negative Univariate Polynomials. CoRR abs/1706.03941 (2017) - [i12]Thao Dang, Eric Fanchon, Marcelo Forets, Victor Magron, Alexandre Rocca:
Occupation measure methods for modelling and analysis of biological hybrid automata. CoRR abs/1710.03158 (2017) - 2016
- [i11]Alexandre Rocca, Victor Magron, Thao Dang:
Certified Roundoff Error Bounds using Bernstein Expansions and Sparse Krivine-Stengle Representations. CoRR abs/1610.07038 (2016) - [i10]Victor Magron, Mountassir Farid:
Certified Lower Bounds of Roundoff Errors using Semidefinite Programming. CoRR abs/1611.01318 (2016) - 2015
- [j5]Victor Magron, Xavier Allamigeon, Stéphane Gaubert, Benjamin Werner:
Formal Proofs for Nonlinear Optimization. J. Formaliz. Reason. 8(1): 1-24 (2015) - [j4]Victor Magron, Xavier Allamigeon, Stéphane Gaubert, Benjamin Werner:
Certification of real inequalities: templates and sums of squares. Math. Program. 151(2): 477-506 (2015) - [j3]Victor Magron:
Error bounds for polynomial optimization over the hypercube using putinar type representations. Optim. Lett. 9(5): 887-895 (2015) - [j2]Victor Magron, Didier Henrion, Jean-Bernard Lasserre:
Semidefinite Approximations of Projections and Polynomial Images of SemiAlgebraic Sets. SIAM J. Optim. 25(4): 2143-2164 (2015) - [c4]Assalé Adjé, Pierre-Loïc Garoche, Victor Magron:
Property-based Polynomial Invariant Generation Using Sums-of-Squares Optimization. SAS 2015: 235-251 - [i9]Thomas C. Hales, Mark Adams, Gertrud Bauer, Dat Tat Dang, John Harrison, Truong Le Hoang, Cezary Kaliszyk, Victor Magron, Sean McLaughlin, Thang Tat Nguyen, Truong Quang Nguyen, Tobias Nipkow, Steven Obua, Joseph Pleso, Jason M. Rute, Alexey Solovyev, An Hoai Thi Ta, Trung Nam Tran, Diep Thi Trieu, Josef Urban, Ky Khac Vu, Roland Zumkeller:
A formal proof of the Kepler conjecture. CoRR abs/1501.02155 (2015) - [i8]Assalé Adjé, Pierre-Loïc Garoche, Victor Magron:
Property-based Polynomial Invariant Generation using Sums-of-Squares Optimization. CoRR abs/1503.07025 (2015) - [i7]Assalé Adjé, Pierre-Loïc Garoche, Victor Magron:
A Sums-of-Squares Extension of Policy Iterations. CoRR abs/1503.08090 (2015) - [i6]Victor Magron, George A. Constantinides, Alastair F. Donaldson:
Certified Roundoff Error Bounds Using Semidefinite Programming. CoRR abs/1507.03331 (2015) - 2014
- [j1]Victor Magron, Didier Henrion, Jean-Bernard Lasserre:
Approximating Pareto curves using semidefinite relaxations. Oper. Res. Lett. 42(6-7): 432-437 (2014) - [c3]Victor Magron:
NLCertify: A Tool for Formal Nonlinear Optimization. ICMS 2014: 315-320 - [i5]Victor Magron, Didier Henrion, Jean-Bernard Lasserre:
Approximating Pareto Curves using Semidefinite Relaxations. CoRR abs/1404.4772 (2014) - [i4]Xavier Allamigeon, Stéphane Gaubert, Victor Magron, Benjamin Werner:
Formal Proofs for Nonlinear Optimization. CoRR abs/1404.7282 (2014) - [i3]Victor Magron:
NLCertify: A Tool for Formal Nonlinear Optimization. CoRR abs/1405.5668 (2014) - [i2]Assalé Adjé, Victor Magron:
Polynomial Template Generation using Sum-of-Squares Programming. CoRR abs/1409.3941 (2014) - 2013
- [b1]Victor Magron:
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). École Polytechnique, Palaiseau, France, 2013 - [c2]Xavier Allamigeon, Stephane Gaubert, Victor Magron, Benjamin Werner:
Certification of inequalities involving transcendental functions: Combining SDP and max-plus approximation. ECC 2013: 2244-2250 - [c1]Xavier Allamigeon, Stéphane Gaubert, Victor Magron, Benjamin Werner:
Certification of Bounds of Non-linear Functions: The Templates Method. MKM/Calculemus/DML 2013: 51-65 - [i1]Xavier Allamigeon, Stéphane Gaubert, Victor Magron, Benjamin Werner:
Certification of Bounds of Non-linear Functions: the Templates Method. CoRR abs/1307.3231 (2013)
Coauthor Index
aka: Jean-Bernard Lasserre
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-23 18:33 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint