15 citations · 32 across the 8 of their papers we have counts for
9 papers
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 propert…
Specialized effective Positivstellensätze for improved convergence rates of the moment-SOS hierarchy
Corbinian Schlosser, Matteo Tacchi
Recently a moment-sum-of-squares hierarchy for exit location estimation of stochastic processes has been presented. When restricting to the special case of the unit ball, we show t…
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…
Koopman and Perron-Frobenius Operators on reproducing kernel Banach spaces
Masahiro Ikeda, Isao Ishikawa, Corbinian Schlosser
Koopman and Perron-Frobenius operators for dynamical systems have been getting popular in a number of fields in science these days. Properties of the Koopman operator essentially d…
Converging approximations of attractors via almost Lyapunov functions and semidefinite programming
Corbinian Schlosser
In this paper we combine two existing approaches for approximating attractors. One of them approximates the attractors arbitrarily well by sublevel sets related to solutions of inf…
Sparsity structures for Koopman operators
Corbinian Schlosser, Milan Korda
We present a decomposition of the Koopman operator based on the sparse structure of the underlying dynamical system, allowing one to consider the system as a family of subsystems i…
Exploiting Term Sparsity in Moment-SOS hierarchy for Dynamical Systems
Jie Wang, Corbinian Schlosser, Milan Korda +1
In this paper, we develop a dynamical system counterpart to the term sparsity sum-of-squares (TSSOS) algorithm proposed for static polynomial optimization. This allows for computat…
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…
Converging outer approximations to global attractors using semidefinite programming
Corbinian Schlosser, Milan Korda
This paper develops a method for obtaining guaranteed outer approximations for global attractors of continuous and discrete time nonlinear dynamical systems. The method is based on…