Sharpest contraction rate for primal–dual dynamics with linear equality constraints
Determine the sharpest exponential contraction rate for the continuous-time primal–dual dynamics that solve linear equality-constrained minimization problems; specifically, identify the largest rate and an associated norm or Riemannian metric under which the flow is strongly contracting so that the distance between any two trajectories decays exponentially.
References
For example, sharp characterizations of contractivity exist for some special dynamical systems (e.g., gradient flow, firing rate neural networks, and certain Lur’e models), yet there are other relatively simple dynamical systems whose sharpest rates of contraction are still unknown, e.g., primal dual dynamics for linear equality-constrained minimization and Hopfield neural networks with diagonally stable synaptic matrices.