Convex searches for discrete-time Zames-Falb multipliers
Not on the map. Why?
Abstract (arXiv)
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 ℓ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.
Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). First posted on arXiv 6 Dec 2018.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 0; 2023: 0; 2024: 3.
4 papers.
- 2021Linear systems with neural network nonlinearities: Improved stability analysis via acausal Zames-Falb multiplierscited by 6
- 2024Stability and Performance Analysis of Discrete-Time ReLU Recurrent Neural Networkscited by 4
- 2024A Complete Set of Quadratic Constraints for Repeated ReLU and Generalizationscited by 2
- 2024Mapping back and forth between model predictive control and neural networkscited by 1
- 2024A Complete Set of Quadratic Constraints for Repeated ReLU and Generalizations9 Jul 2024
- 2024Stability and Performance Analysis of Discrete-Time ReLU Recurrent Neural Networks8 May 2024
- 2024Mapping back and forth between model predictive control and neural networks18 Apr 2024
- 2021Linear systems with neural network nonlinearities: Improved stability analysis via acausal Zames-Falb multipliers31 Mar 2021