Παρακολούθηση
Victor Magron
Victor Magron
Η διεύθυνση ηλεκτρονικού ταχυδρομείου έχει επαληθευτεί στον τομέα laas.fr - Αρχική σελίδα
Τίτλος
Παρατίθεται από
Παρατίθεται από
Έτος
A formal proof of the Kepler conjecture
T Hales, M Adams, G Bauer, TD Dang, J Harrison, H Le Truong, ...
Forum of mathematics, Pi 5, 2017
3592017
Certified roundoff error bounds using semidefinite programming
V Magron, G Constantinides, A Donaldson
ACM Transactions on Mathematical Software (TOMS) 43 (4), 1-31, 2017
882017
TSSOS: A Moment-SOS hierarchy that exploits term sparsity
J Wang, V Magron, JB Lasserre
SIAM Journal on Optimization 31 (1), 30-58, 2021
682021
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
582021
CS-TSSOS: Correlative and term sparsity for large-scale polynomial optimization
J Wang, V Magron, JB Lasserre, NHA Mai
arXiv preprint arXiv:2005.02828, 2020
412020
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
352015
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
332019
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
29*2020
Sparse noncommutative polynomial optimization
I Klep, V Magron, J Povh
Mathematical Programming 193 (2), 789-829, 2022
272022
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
272020
Formal proofs for nonlinear optimization
V Magron, X Allamigeon, S Gaubert, B Werner
arXiv preprint arXiv:1404.7282, 2014
242014
Interval enclosures of upper bounds of roundoff errors using semidefinite programming
V Magron
ACM Transactions on Mathematical Software (TOMS) 44 (4), 1-18, 2018
212018
Exploiting term sparsity in noncommutative polynomial optimization
J Wang, V Magron
Computational Optimization and Applications 80 (2), 483-521, 2021
182021
On exact Polya and Putinar's representations
V Magron, M Safey El Din
Proceedings of the 2018 ACM International Symposium on Symbolic and …, 2018
182018
Property-based polynomial invariant generation using sums-of-squares optimization
A Adjé, PL Garoche, V Magron
International Static Analysis Symposium, 235-251, 2015
182015
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
172019
A sparse version of Reznick’s Positivstellensatz
NHA Mai, V Magron, J Lasserre
Mathematics of Operations Research, 2022
162022
Exact optimization via sums of nonnegative circuits and arithmetic-geometric-mean-exponentials
V Magron, H Seidler, T De Wolff
Proceedings of the 2019 on International Symposium on Symbolic and Algebraic …, 2019
152019
On the complexity of Putinar-Vasilescu's Positivstellensatz
NHA Mai, V Magron
arXiv preprint arXiv:2104.11606, 2021
132021
Realcertify a maple package for certifying non-negativity
V Magron, MSE Din
ACM Communications in Computer Algebra 52 (2), 34-37, 2018
122018
Δεν είναι δυνατή η εκτέλεση της ενέργειας από το σύστημα αυτή τη στιγμή. Προσπαθήστε ξανά αργότερα.
Άρθρα 1–20