Zames–Falb multipliers for convergence rate: motivating example and convex searches

DOI10.1080/00207179.2020.1823484zbMATH Open1485.93463OpenAlexW3092058891MaRDI QIDQ5069015FDOQ5069015

Authors: Jingfan Zhang, Peter Seiler, Joaquín Carrasco 

Publication date: 7 April 2022

Published in: International Journal of Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207179.2020.1823484

Recommendations

• Convex Searches for Discrete-Time Zames–Falb Multipliers
• Zames-Falb multipliers for absolute stability: from O'Shea's contribution to convex searches
• scientific article; zbMATH DE number 3898619
• A proof of convergence of the concave-convex procedure using Zangwill's theory
• Convergence rates for Kaczmarz-type algorithms
• Convergence rate of a proximal multiplier algorithm for separable convex minimization
• On the convergence of the exponential multiplier method for convex programming
• Convergence rates of gradient methods for convex optimization in the space of measures
• On the convergence of faster modified multi-step iterations to fixed points for Zamfirescu operators
• Zames-Falb Multipliers for Quadratic Programming

zbMATH Keywords

exponential convergence rateZames-Falb multipliersKalman conjectureintegral quadratic constraint

Mathematics Subject Classification ID

Stabilization of systems by feedback (93D15) Input-output approaches in control theory (93D25)

Cites Work

• Solving semidefinite-quadratic-linear programs using SDPT3
• Analysis and design of optimization algorithms via integral quadratic constraints
• On the Kalman-Yakubovich-Popov lemma
• System analysis via integral quadratic constraints
• Stability Conditions for Systems with Monotone and Slope-Restricted Nonlinearities
• Title not available (Why is that?)
• Zames-Falb multipliers for absolute stability: from O'Shea's contribution to convex searches
• Nonlinear Systems Analysis
• Second-order counterexamples to the discrete-time Kalman conjecture
• Frequency domain criteria for absolute stability. A delay-integral-quadratic constraints approach.
• Robust and structure exploiting optimisation algorithms: an integral quadratic constraint approach
• Analysis of optimization algorithms via integral quadratic constraints: nonstrongly convex problems
• Convex Searches for Discrete-Time Zames–Falb Multipliers
• Exponential Decay Rate Conditions for Uncertain Linear Systems Using Integral Quadratic Constraints

Cited In (2)

• On the necessity and sufficiency of discrete-time O'Shea-Zames-Falb multipliers
• LMI searches for anticausal and noncausal rational Zames-Falb multipliers

Uses Software

• SDPT3
• CVX

This page was built for publication: Zames–Falb multipliers for convergence rate: motivating example and convex searches

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5069015)