Zames-Falb Multipliers for Quadratic Programming
From MaRDI portal
Publication:5282270
DOI10.1109/TAC.2007.906233zbMATH Open1366.90155OpenAlexW2101330244MaRDI QIDQ5282270FDOQ5282270
Authors: William P. Heath, Adrian G. Wills 
Publication date: 27 July 2017
Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tac.2007.906233
Cited In (13)
- Analysis and design of optimization algorithms via integral quadratic constraints
- Zames-Falb multipliers for absolute stability: from O'Shea's contribution to convex searches
- Discrete-time counterparts of the RL and RC multipliers
- Factorization of multipliers in passivity and IQC analysis
- Equivalence between classes of multipliers for slope-restricted nonlinearities
- Region of attraction analysis with integral quadratic constraints
- Second-order counterexamples to the discrete-time Kalman conjecture
- \(\mathcal L_2\) gain bounds for systems with sector bounded and slope-restricted nonlinearities
- Stability analysis of piecewise affine systems with multi-model predictive control
- Lyapunov functions for the multivariable Popov criterion with indefinite multipliers
- Multipliers for model predictive control with structured input constraints
- ZFD formula \(4\mathrm{I}g\mathrm{SFD}\_\mathrm{Y}\) applied to future minimization
- Zames–Falb multipliers for convergence rate: motivating example and convex searches
This page was built for publication: Zames-Falb Multipliers for Quadratic Programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5282270)
