3 papers
math.OC2025
Convergence rates for the moment-SoS hierarchy
Corbinian Schlosser, Matteo Tacchi, Alexey Lazarev
We introduce a comprehensive framework for analyzing convergence rates for infinite dimensional linear programming problems (LPs) within the context of the moment-sum-of-squares hi…
math.OC2025
Convergence rate for linear minimizer-estimators in the moment-sum-of-squares hierarchy
Corbinian Schlosser
Effective Positivstellensätze provide convergence rates for the moment-sum-of-squares (SoS) hierarchy for polynomial optimization (POP). In this paper, we add a qualitative proper…
math.OC2024
Sparse decompositions of nonlinear dynamical systems and applications to moment-sum-of-squares relaxations
Corbinian Schlosser, Milan Korda
In this paper, we propose a general sparse decomposition of dynamical systems provided that the vector field and constraint set possess certain sparse structures, which we call sub…