Phase limitations of Zames-Falb multipliers

Phase limitations of both continuous-time and discrete-time Zames-Falb multipliers and their relation with the Kalman conjecture are analysed. A phase limitation for continuous-time multipliers given by Megretski is generalised and its applicability is clarified; its relation to the Kalman conjecture is illustrated with a classical example from the literature. It is demonstrated that there exist fourth-order plants where the existence of a suitable Zames-Falb multiplier can be discarded and for which simulations show unstable behavior. A novel phase-limitation for discrete-time Zames-Falb multipliers is developed. Its application is demonstrated with a second-order counterexample to the Kalman conjecture. Finally, the discrete-time limitation is used to show that there can be no direct counterpart of the off-axis circle criterion in the discrete-time domain

Convex searches for discrete-time Zames-Falb multipliers

In this paper we develop and analyse convex searches for Zames--Falb multipliers. We present two different approaches: Infinite Impulse Response (IIR) and Finite Impulse Response (FIR) multipliers. The set of FIR multipliers is complete in that any IIR multipliers can be phase-substituted by an arbitrarily large order FIR multiplier. We show that searches in discrete-time for FIR multipliers are effective even for large orders. As expected, the numerical results provide the best $\ell_{2}$-stability results in the literature for slope-restricted nonlinearities. Finally, we demonstrate that the discrete-time search can provide an effective method to find suitable continuous-time multipliers.Comment: 12 page

Exponential Convergence Bounds using Integral Quadratic Constraints

The theory of integral quadratic constraints (IQCs) allows verification of stability and gain-bound properties of systems containing nonlinear or uncertain elements. Gain bounds often imply exponential stability, but it can be challenging to compute useful numerical bounds on the exponential decay rate. In this work, we present a modification of the classical IQC results of Megretski and Rantzer that leads to a tractable computational procedure for finding exponential rate certificates

Supporting research studies to booster flight control problems Final report

Asymptotic stability and response of nonlinear system

Convergence Rate Bounds for the Mirror Descent Method: IQCs, Popov Criterion and Bregman Divergence

This paper presents a comprehensive convergence analysis for the mirror descent (MD) method, a widely used algorithm in convex optimization. The key feature of this algorithm is that it provides a generalization of classical gradient-based methods via the use of generalized distance-like functions, which are formulated using the Bregman divergence. Establishing convergence rate bounds for this algorithm is in general a non-trivial problem due to the lack of monotonicity properties in the composite nonlinearities involved. In this paper we show that the Bregman divergence from the optimal solution, which is commonly used as a Lyapunov function for this algorithm, is a special case of Lyapunov functions that follow when the Popov criterion is applied to an appropriate reformulation of the problem. This is then used as a basis to construct an integral quadratic constraint (IQC) framework through which convergence rate bounds with reduced conservatism can be deduced. We also illustrate via examples that the convergence rate bounds derived can be tight.Comment: arXiv admin note: substantial text overlap with arXiv:2204.0050