Victor Magron

CoRR, 2021

Exploiting term sparsity in noncommutative polynomial optimization.

[BibT_eX]

[DOI]

Comput. Optim. Appl., 2021

Semialgebraic Representation of Monotone Deep Equilibrium Models and Applications to Certification.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

The Constant Trace Property in Noncommutative Optimization.

[BibT_eX]

[DOI]

Ngoc Hoang Anh Mai

Abhishek Bhardwaj

Proceedings of the ISSAC '21: International Symposium on Symbolic and Algebraic Computation, 2021

Stability Analysis of Recurrent Neural Networks by IQC with Copositive Mutipliers.

[BibT_eX]

[DOI]

Proceedings of the 2021 60th IEEE Conference on Decision and Control (CDC), 2021

SparseJSR: A Fast Algorithm to Compute Joint Spectral Radius via Sparse SOS Decompositions.

[BibT_eX]

[DOI]

Martina Maggio

Proceedings of the 2021 American Control Conference, 2021

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

[BibT_eX]

[DOI]

, 2021

2020

Computing the Hausdorff Boundary Measure of Semialgebraic Sets.

[BibT_eX]

[DOI]

Jean B. Lasserre

SIAM J. Appl. Algebra Geom., 2020

Optimal control of linear PDEs using occupation measures and SDP relaxations.

[BibT_eX]

[DOI]

Christophe Prieur

IMA J. Math. Control. Inf., 2020

Computer-assisted proofs for Lyapunov stability via Sums of Squares certificates and Constructive Analysis.

[BibT_eX]

[DOI]

Grigory Devadze

Stefan Streif

CoRR, 2020

Polynomial Optimization for Bounding Lipschitz Constants of Deep Networks.

[BibT_eX]

[DOI]

Tong Chen

Edouard Pauwels

CoRR, 2020

Semialgebraic Optimization for Lipschitz Constants of ReLU Networks.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

A second order cone characterization for sums of nonnegative circuits.

[BibT_eX]

[DOI]

Proceedings of the ISSAC '20: International Symposium on Symbolic and Algebraic Computation, 2020

2019

Certified Roundoff Error Bounds Using Bernstein Expansions and Sparse Krivine-Stengle Representations.

[BibT_eX]

[DOI]

Alexandre Rocca

Thao Dang

IEEE Trans. Computers, 2019

In SDP Relaxations, Inaccurate Solvers Do Robust Optimization.

[BibT_eX]

[DOI]

SIAM J. Optim., 2019

Semidefinite Approximations of Reachable Sets for Discrete-time Polynomial Systems.

[BibT_eX]

[DOI]

SIAM J. Control. Optim., 2019

Algorithms for weighted sum of squares decomposition of non-negative univariate polynomials.

[BibT_eX]

[DOI]

Markus Schweighofer

J. Symb. Comput., 2019

Exact Optimization via Sums of Nonnegative Circuits and Sums of AM/GM Exponentials.

[BibT_eX]

[DOI]

Henning Seidler

Timo de Wolff

CoRR, 2019

Exact Optimization via Sums of Nonnegative Circuits and Arithmetic-geometric-mean-exponentials.

[BibT_eX]

[DOI]

Henning Seidler

Timo de Wolff

Proceedings of the 2019 on International Symposium on Symbolic and Algebraic Computation, 2019

2018

Interval Enclosures of Upper Bounds of Roundoff Errors Using Semidefinite Programming.

[BibT_eX]

[DOI]

ACM Trans. Math. Softw., 2018

Optimal Data Fitting: A Moment Approach.

[BibT_eX]

[DOI]

SIAM J. Optim., 2018

On Exact Polya, Hilbert-Artin and Putinar's Representations.

[BibT_eX]

[DOI]

CoRR, 2018

Realcertify: a maple package for certifying non-negativity.

[BibT_eX]

[DOI]

ACM Commun. Comput. Algebra, 2018

On Exact Polya and Putinar's Representations.

[BibT_eX]

[DOI]

Proceedings of the 2018 ACM on International Symposium on Symbolic and Algebraic Computation, 2018

Occupation measure methods for modelling and analysis of biological hybrid systems.

[BibT_eX]

[DOI]

Proceedings of the 6th IFAC Conference on Analysis and Design of Hybrid Systems, 2018

2017

Certified Roundoff Error Bounds Using Semidefinite Programming.

[BibT_eX]

[DOI]

George A. Constantinides

Alastair F. Donaldson

ACM Trans. Math. Softw., 2017

Occupation measure methods for modelling and analysis of biological hybrid automata.

[BibT_eX]

[DOI]

CoRR, 2017

Algorithms for Weighted Sums of Squares Decomposition of Non-negative Univariate Polynomials.

[BibT_eX]

[DOI]

Markus Schweighofer

CoRR, 2017

2016

Certified Lower Bounds of Roundoff Errors using Semidefinite Programming.

[BibT_eX]

[DOI]

Mountassir Farid

CoRR, 2016

2015

Semidefinite Approximations of Projections and Polynomial Images of SemiAlgebraic Sets.

[BibT_eX]

[DOI]

Didier Henrion

SIAM J. Optim., 2015

Error bounds for polynomial optimization over the hypercube using putinar type representations.

[BibT_eX]

[DOI]

Optim. Lett., 2015

Certification of real inequalities: templates and sums of squares.

[BibT_eX]

[DOI]

Math. Program., 2015

Formal Proofs for Nonlinear Optimization.

[BibT_eX]

[DOI]

J. Formaliz. Reason., 2015

A formal proof of the Kepler conjecture.

[BibT_eX]

[DOI]

CoRR, 2015

A Sums-of-Squares Extension of Policy Iterations.

[BibT_eX]

[DOI]

Assalé Adjé

Pierre-Loïc Garoche

CoRR, 2015

Property-based Polynomial Invariant Generation Using Sums-of-Squares Optimization.

[BibT_eX]

[DOI]

Assalé Adjé

Pierre-Loïc Garoche

Proceedings of the Static Analysis - 22nd International Symposium, 2015

2014

Approximating Pareto curves using semidefinite relaxations.

[BibT_eX]

[DOI]

Didier Henrion

Oper. Res. Lett., 2014

Polynomial Template Generation using Sum-of-Squares Programming.

[BibT_eX]

[DOI]

Assalé Adjé

CoRR, 2014

NLCertify: A Tool for Formal Nonlinear Optimization.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Software - ICMS 2014, 2014

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).

[BibT_eX]

[DOI]