Stability of an analog optimization circuit for quadratic programming

We study the stability of an analog optimization circuit that solves quadratic programming (QP) problems. The circuit dynamics are modeled as a switched affine system. A piece-wise quadratic Lyapunov function and the KYP lemma are used to derive the stability criterion. The stability criterion characterizes the range of critical circuit parameters for which the QP circuit is globally exponentially stable.