A Common Lyapunov Matrix Approach to the Exponential Stability of Augmented Primal-Dual Gradient Flow as LPV Systems
Provides a theoretical convergence guarantee for a class of constrained optimization algorithms, but the result is incremental as it extends existing Lyapunov methods to a specific LPV formulation.
The paper proves exponential convergence of augmented primal-dual gradient flow for constrained optimization with affine inequality constraints under a relaxed strong convexity condition, using a common Lyapunov matrix approach for LPV systems.
We show that a common Lyapunov matrix exists for the convex combination of two Hurwitz matrices if and only if the intersection of the set of strict Lyapunov matrices for one matrix and the set of non-strict Lyapunov matrices for the other is nonempty. This simple relaxation is useful for the convergence analysis of the augmented primal-dual gradient flow for constrained optimization problems with affine inequality constraints, which can be viewed as a polytopic linear parameter-varying (LPV) system driven by the active-constraint selector. Under a relaxed strong convexity condition, exponential convergence is proved for the LPV system. The analysis can further be extended to the integral quadratic constraints (IQCs) framework for LPV systems to facilitate numerical search of the convergence rate.