| Publication | Date of Publication | Type |
|---|
Certified Roundoff Error Bounds using Bernstein Expansions and Sparse Krivine-Stengle Representations
(available as arXiv preprint) | N/A | Paper |
A real moment-HSOS hierarchy for complex polynomial optimization with real coefficients
(available as arXiv preprint) | N/A | Paper |
$L_{2+}$ Induced Norm Analysis of Continuous-Time LTI Systems Using Positive Filters and Copositive Programming
(available as arXiv preprint) | N/A | Paper |
Induced Norm Analysis of Linear Systems for Nonnegative Input Signals
(available as arXiv preprint) | N/A | Paper |
Stability Analysis of Feedback Systems with ReLU Nonlinearities via Semialgebraic Set Representation
(available as arXiv preprint) | N/A | Paper |
Slow convergence of the moment-SOS hierarchy for an elementary polynomial optimization problem
(available as arXiv preprint) | N/A | Paper |
LMI hierarchies for stability analysis of ReLU feedback systems
MCSS. Mathematics of Control, Signals, and Systems | 2026-09-22 | Paper |
Convergence rates for polynomial optimization on set products
SIAM Journal on Optimization | 2026-09-16 | Paper |
Approximating the order 2 quantum Wasserstein distance using the moment-SOS hierarchy
Optimization Letters | 2026-09-15 | Paper |
Tractable hierarchies of convex relaxations for polynomial optimization on the nonnegative orthant
Computational Optimization and Applications | 2026-08-03 | Paper |
Sums of squares certificates for polynomial moment inequalities
Foundations of Computational Mathematics | 2026-06-22 | Paper |
Complete upper bound hierarchies for spectral minimum in noncommutative polynomial optimization
Journal of Mathematical Analysis and Applications | 2026-06-16 | Paper |
On the complexity of p-order cone programs
Journal of Complexity | 2026-01-16 | Paper |
Induced norm analysis of linear systems for nonnegative input signals
Automatica | 2025-12-15 | Paper |
Computer-assisted proofs for Lyapunov stability via sums of squares certificates and constructive analysis
Journal of Automated Reasoning | 2025-03-20 | Paper |
Slow convergence of the moment-SOS hierarchy for an elementary polynomial optimization problem
SIAM Journal on Applied Algebra and Geometry | 2025-03-18 | Paper |
| The constant trace property in noncommutative optimization | 2025-01-20 | Paper |
A real moment-HSOS hierarchy for complex polynomial optimization with real coefficients
Computational Optimization and Applications | 2025-01-20 | Paper |
Convergence rates for sums-of-squares hierarchies with correlative sparsity
Mathematical Programming. Series A. Series B | 2025-01-17 | Paper |
| Exact SOHS decompositions of trigonometric univariate polynomials with Gaussian coefficients | 2025-01-17 | Paper |
Symmetry reduction and recovery of trajectories of optimal control problems via measure relaxations
European Series in Applied and Industrial Mathematics (ESAIM): Control, Optimization and Calculus of Variations | 2024-10-18 | Paper |
State polynomials: positivity, optimization and nonlinear Bell inequalities
Mathematical Programming. Series A. Series B | 2024-09-19 | Paper |
Exploiting constant trace property in large-scale polynomial optimization
ACM Transactions on Mathematical Software | 2024-09-06 | Paper |
CS-TSSOS: correlative and term sparsity for large-scale polynomial optimization
ACM Transactions on Mathematical Software | 2024-09-06 | Paper |
Exploiting ideal-sparsity in the generalized moment problem with application to matrix factorization ranks
Mathematical Programming. Series A. Series B | 2024-04-09 | Paper |
Exploiting Term Sparsity in Moment-SOS Hierarchy for Dynamical Systems
IEEE Transactions on Automatic Control | 2024-02-29 | Paper |
A Sparse Version of Reznick’s Positivstellensatz
Mathematics of Operations Research | 2024-02-23 | Paper |
A hierarchy of spectral relaxations for polynomial optimization
Mathematical Programming Computation | 2023-12-02 | Paper |
Pourchet’s theorem in action: decomposing univariate nonnegative polynomials as sums of five squares
Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation | 2023-11-03 | Paper |
| Symmetry reduction and recovery of trajectories of optimal control problems via measure relaxations | 2023-07-07 | Paper |
| Minimal Sparsity for Second-Order Moment-SOS Relaxations of the AC-OPF Problem | 2023-05-30 | Paper |
Sum of Squares Decompositions of Polynomials over their Gradient Ideals with Rational Coefficients
SIAM Journal on Optimization | 2023-03-30 | Paper |
| Convergence rates for sums-of-squares hierarchies with correlative sparsity | 2023-03-26 | Paper |
| Sums of squares representations on singular loci | 2023-03-09 | Paper |
Noncommutative Christoffel-Darboux kernels
Transactions of the American Mathematical Society | 2022-11-17 | Paper |
| Time-dependent moments from partial differential equations and the time-dependent set of atoms | 2022-11-08 | Paper |
SONC optimization and exact nonnegativity certificates via second-order cone programming
Journal of Symbolic Computation | 2022-09-22 | Paper |
Sparse Polynomial Optimization: Theory and Practice
(available as arXiv preprint) | 2022-08-23 | Paper |
Sparse Polynomial Optimization
Series on Optimization and Its Applications | 2022-07-11 | Paper |
| Urysohn in action: separating semialgebraic sets by polynomials | 2022-07-01 | Paper |
Positivity certificates and polynomial optimization on non-compact semialgebraic sets
Mathematical Programming. Series A. Series B | 2022-06-29 | Paper |
On the complexity of Putinar-Vasilescu's Positivstellensatz
Journal of Complexity | 2022-06-17 | Paper |
Sparse noncommutative polynomial optimization
Mathematical Programming. Series A. Series B | 2022-06-14 | Paper |
Sparse noncommutative polynomial optimization
Mathematical Programming. Series A. Series B | 2022-06-14 | Paper |
| Tractable semidefinite bounds of positive maximal singular values | 2022-02-17 | Paper |
Exploiting sparsity in complex polynomial optimization
Journal of Optimization Theory and Applications | 2022-01-27 | Paper |
A sublevel moment-SOS hierarchy for polynomial optimization
Computational Optimization and Applications | 2022-01-24 | Paper |
Optimization over trace polynomials
Annales Henri Poincaré | 2022-01-19 | Paper |
\(l_2\) Induced norm analysis of discrete-time LTI systems for nonnegative input signals and its application to stability analysis of recurrent neural networks
European Journal of Control | 2022-01-19 | Paper |
Exploiting term sparsity in noncommutative polynomial optimization
Computational Optimization and Applications | 2021-09-29 | Paper |
Minimizing rational functions: a hierarchy of approximations via pushforward measures
SIAM Journal on Optimization | 2021-09-24 | Paper |
| Certifying Global Optimality of AC-OPF Solutions via sparse polynomial optimization | 2021-09-21 | Paper |
| Noncommutative Polynomial Optimization | 2021-09-02 | Paper |
Dimension-free entanglement detection in multipartite Werner states
(available as arXiv preprint) | 2021-08-19 | Paper |
Noncommutative Christoffel-Darboux Kernels
(available as arXiv preprint) | 2021-06-11 | Paper |
On exact Reznick, Hilbert-Artin and Putinar's representations
Journal of Symbolic Computation | 2021-06-03 | Paper |
| Semialgebraic Representation of Monotone Deep Equilibrium Models and Applications to Certification | 2021-06-02 | Paper |
TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity
SIAM Journal on Optimization | 2021-02-04 | Paper |
Chordal-TSSOS: a moment-SOS hierarchy that exploits term sparsity with chordal extension
SIAM Journal on Optimization | 2021-02-04 | Paper |
| The Constant Trace Property in Noncommutative Optimization | 2021-02-03 | Paper |
| Stability of Linear Systems under Extended Weakly-Hard Constraints | 2021-01-27 | Paper |
A second order cone characterization for sums of nonnegative circuits
Proceedings of the 45th International Symposium on Symbolic and Algebraic Computation | 2021-01-22 | Paper |
| Exploiting constant trace property in large-scale polynomial optimization | 2020-12-16 | Paper |
Computing the Hausdorff boundary measure of semialgebraic sets
SIAM Journal on Applied Algebra and Geometry | 2020-10-31 | Paper |
Exploiting term sparsity in Noncommutative Polynomial Optimization
(available as arXiv preprint) | 2020-10-14 | Paper |
Exact optimization via sums of nonnegative circuits and arithmetic-geometric-mean-exponentials
Proceedings of the 2019 on International Symposium on Symbolic and Algebraic Computation | 2020-09-10 | Paper |
Exact optimization via sums of nonnegative circuits and arithmetic-geometric-mean-exponentials
Proceedings of the 2019 on International Symposium on Symbolic and Algebraic Computation | 2020-09-10 | Paper |
On exact Polya and Putinar's representations
Proceedings of the 2018 ACM International Symposium on Symbolic and Algebraic Computation | 2020-09-09 | Paper |
| SparseJSR: A Fast Algorithm to Compute Joint Spectral Radius via Sparse SOS Decompositions | 2020-08-26 | Paper |
Optimal control of linear PDEs using occupation measures and SDP relaxations
IMA Journal of Mathematical Control and Information | 2020-04-07 | Paper |
Semidefinite approximations of invariant measures for polynomial systems
Discrete and Continuous Dynamical Systems. Series B | 2019-10-10 | Paper |
Formal Proofs for Nonlinear Optimization
(available as arXiv preprint) | 2019-09-18 | Paper |
In SDP Relaxations, Inaccurate Solvers Do Robust Optimization
SIAM Journal on Optimization | 2019-09-16 | Paper |
Semidefinite Approximations of Reachable Sets for Discrete-time Polynomial Systems
SIAM Journal on Control and Optimization | 2019-08-30 | Paper |
Certified Roundoff Error Bounds Using Bernstein Expansions and Sparse Krivine-Stengle Representations
IEEE Transactions on Computers | 2019-08-13 | Paper |
{\textsc{RealCertify}}: a Maple package for certifying non-negativity
ACM Communications in Computer Algebra | 2019-03-29 | Paper |
Algorithms for weighted sum of squares decomposition of non-negative univariate polynomials
Journal of Symbolic Computation | 2019-03-21 | Paper |
Interval Enclosures of Upper Bounds of Roundoff Errors Using Semidefinite Programming
ACM Transactions on Mathematical Software | 2019-01-18 | Paper |
Optimal data fitting: a moment approach
SIAM Journal on Optimization | 2018-11-20 | Paper |
Approximating Pareto curves using semidefinite relaxations
Operations Research Letters | 2018-09-28 | Paper |
A sums-of-squares extension of policy iterations
Nonlinear Analysis. Hybrid Systems | 2017-10-04 | Paper |
Semidefinite approximations of projections and polynomial images of semialgebraic sets
SIAM Journal on Optimization | 2015-11-18 | Paper |
Error bounds for polynomial optimization over the hypercube using Putinar type representations
Optimization Letters | 2015-07-22 | Paper |
Certification of real inequalities: templates and sums of squares
Mathematical Programming. Series A. Series B | 2015-06-19 | Paper |
NLCertify: a tool for formal nonlinear optimization
Mathematical Software – ICMS 2014 | 2014-09-08 | Paper |
Certification of bounds of non-linear functions: the templates method
Lecture Notes in Computer Science | 2013-08-09 | Paper |
| Certification of inequalities involving transcendental functions: combining SDP and max-plus approximation | 2013-07-26 | Paper |
