arXiv subjects

Corbinian Schlosser

Publications and source records attributed to Corbinian Schlosser.

9 recordsLinked to original sources

arXiv2025

Convergence rates for the moment-SoS hierarchy

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 hierarchy. Our primary focus is on extending the existing convergence rate analysis, initially developed for static polynomial optimization, to the more general and challenging domain of the generalized moment problem. We establish an easy-to-follow procedure for obtaining convergence rates. Our methodology is based on, firstly, a state-of-the-art degree bound for Putinar's Positivstellensatz, secondly, quantitative polynomial approximation bounds, and, thirdly, a geometric Slater condition on the infinite dimensional LP. We address a broad problem formulation that encompasses various applications, such as optimal control, volume computation, and exit location of stochastic processes. We illustrate the procedure at these three problems and, using a recent improvement on effective versions of Putinar's Positivstellensatz, we improve existing convergence rates.

math.OC↗

arXiv2025

Convergence rate for linear minimizer-estimators in the moment-sum-of-squares hierarchy

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 property to the recent advances in those effective Positivstellensätze. We consider optimal solutions to the moment relaxations in the moment-SoS hierarchy and investigate the measures they converge to. It has been established that those limit measures are the probability measures on the set of optimal points of the underlying POP. We complement this result by showing that these measures are approached with a convergence rate that transfers from the (recent) effective Positivstellensätze. As a special case, this covers estimating the minimizer of the underlying POP via linear pseudo-moments. Finally, we analyze the same situation for another SoS hierarchy - the upper bound hierarchy - and show how convexity can be leveraged.

math.OC↗

arXiv2024

Sparse decompositions of nonlinear dynamical systems and applications to moment-sum-of-squares relaxations

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 subsystems. This notion is based on causal dependence in the dynamics between the different states. This results in sparse descriptions for fundamental problems from nonlinear dynamical systems: region of attraction, maximum positively invariant set, and global attractor. The decompositions can be paired with any method for computing (outer) approximations of these sets to reduce the computation to lower dimensional systems. This is illustrated by methods from previous work based on infinite-dimensional linear programming. This exhibits one example where the curse of dimensionality is present and hence dimension reduction is crucial. In this context, for polynomial dynamics, we show that these problems admit a sparse sum-of-squares (SOS) approximation with guaranteed convergence such that the number of variables in the largest SOS multiplier is given by the dimension of the largest subsystem appearing in the decomposition. The dimension of such subsystems depends on the sparse structure of the vector field and the constraint set; if the dimension of the largest subsystem is small compared to the ambient dimension, this allows for a significant reduction in the computation time of the SOS approximations. Numerical examples accompany the approach.

math.OC↗

arXiv2024

Specialized effective Positivstellensätze for improved convergence rates of the moment-SOS hierarchy

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 that the solutions approach the optimal value by a super-polynomial rate. To show this result we state a new effective Positivstellensatz on the sphere with quadratic degree bound based on a recent Positivstellensatz for trigonometric polynomials on the hypercube and pair it with a recent effective Positivstellensatz on the unit ball. At the present example, we aim to highlight the effectiveness of specialized Positivstellensätze for the moment-SoS hierarchy and their interplay with problem intrinsic properties.

math.OC↗

arXiv2024

Koopman and Perron-Frobenius Operators on reproducing kernel Banach spaces

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 depend on the choice of function spaces where it acts. Particularly the case of reproducing kernel Hilbert spaces (RKHSs) draws more and more attention in data science. In this paper, we give a general framework for Koopman and Perron-Frobenius operators on reproducing kernel Banach spaces (RKBSs). More precisely, we extend basic known properties of these operators from RKHSs to RKBSs and state new results, including symmetry and sparsity concepts, on these operators on RKBS for discrete and continuous time systems.

math.DS↗

arXiv2023

Exploiting Term Sparsity in Moment-SOS hierarchy for Dynamical Systems

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 computational savings and improved scalability while preserving convergence guarantees when sum-of-squares methods are applied to problems from dynamical systems, including the problems of approximating region of attraction, the maximum positively invariant set, and the global attractor. At its core, the method exploits the algebraic structure of the data, thereby complementing existing methods that exploit causality relations among the states of the dynamical system. The procedure encompasses sign symmetries of the dynamical system as was already revealed for polynomial optimization. Numerical examples demonstrate the efficiency of the approach in the presence of this type of sparsity.

math.OC↗

arXiv2023

Converging approximations of attractors via almost Lyapunov functions and semidefinite programming

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 infinite dimensional linear programming problems. A downside there is that these sets are not necessarily positively invariant. On the contrary, the second method provides supersets of the attractor which are positively invariant. Their method on the other hand has the disadvantage that the underlying optimization problem is not computationally tractable without the use of heuristics - and incorporating them comes at the price of losing guaranteed convergence. In this paper we marry both approaches by combining their techniques and we get converging outer approximations of the attractor consisting of positively invariant sets based on convex optimization via sum-of-squares techniques. The method is easy to use and illustrated by numerical examples.

math.OC↗

arXiv2023

Converging outer approximations to global attractors using semidefinite programming

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 a hierarchy of semidefinite programming problems of increasing size with guaranteed convergence to the global attractor. The approach taken follows an established line of reasoning, where we first characterize the global attractor via an infinite dimensional linear programming problem (LP) in the space of Borel measures. The dual to this LP is in the space of continuous functions and its feasible solutions provide guaranteed outer approximations to the global attractor. For systems with polynomial dynamics, a hierarchy of finite-dimensional sum-of-squares tightenings of the dual LP provides a sequence of outer approximations to the global attractor with guaranteed convergence in the sense of volume discrepancy tending to zero. The method is very simple to use and based purely on convex optimization. Numerical examples with the code available online demonstrate the method.

math.OC↗

arXiv2021

Sparsity structures for Koopman operators

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 interconnected by a graph. Using the intrinsic properties of the Koopman operator, we show that eigenfunctions for the subsystems induce eigenfunctions for the whole system. The use of principal eigenfunctions allows to reverse this result. Similarly for the adjoint operator, the Perron-Frobenius operator, invariant measures for the dynamical system induce invariant measures of the subsystems, while constructing invariant measures from invariant measures of the subsystems is less straightforward. We address this question and show that under necessary compatibility assumptions such an invariant measure exists. Based on these results we demonstrate that the a-priori knowledge of a decomposition of a dynamical system allows for a reduction of the computational cost for data driven approaches on the example of the dynamic mode decomposition.

math.OC↗