3 problems

The paper constructs integral quadratic constraints (IQCs) with a nontrivial terminal cost for subdifferentials of convex functions, using causal and anti-causal O'Shea-Zames-Falb…

Let a first-order algorithm have $T$ steps of memory. For each integer $n\geq 1$, an off-by-$n$ pointwise IQC is the quadratic constraint associated with a pair of iterates…

IQC improvement conjecture. By using off-by-one IQCs or other IQCs developed in the cited work within this Lyapunov framework, one can further improve the numerical bounds.