Nonlinear constrained optimization of Schur test functions
Mikhail Anikushin, Andrey Romanov
TL;DR
The work addresses obtaining refined upper bounds on the norms of transfer operators arising from Schur tests for integral kernels related to delay equations. It introduces an iterative nonlinear programming framework that reduces the full minimax problem to a sequence of smooth nonlinear programs by restricting the maximization to a growing finite set of reference points and solving with the SLSQP method. The method is demonstrated on kernels $K(\theta,s)$ from twofold additive compound delay operators, using neural-network parametrizations to model the Schur weights $(\mathfrak{p},\mathfrak{q})$ and testing Mackey–Glass-type scenarios; results show convergence with modest reference-point counts and sharp Schur bounds near $\omega=0$, with asymptotic guidance provided by the surrogate kernel $\bar{K}$. This provides a practical route to verify frequency inequalities for the global stability of delay equations and suggests extensions to systems of delay equations, along with data and code made available for reproducibility.
Abstract
We apply the iterative nonlinear programming method, previously proposed in our earlier work, to optimize Schur test functions and thereby provide refined upper bounds for the norms of integral operators. As an illustration, we derive such bounds for transfer operators associated with twofold additive compound operators that arise in the study of delay equations. This is related to the verification of frequency inequalities that guarantee the global stability of nonlinear delay equations through the generalized Bendixson criterion.
