Dice Question Streamline Icon: https://streamlinehq.com

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.

Information Square Streamline Icon: https://streamlinehq.com

Background

The paper highlights that while sharp characterizations of contractivity exist for certain systems (e.g., gradient flow, firing-rate neural networks, Lur’e models), for other standard dynamics the best contraction rates are not yet characterized.

Primal–dual dynamics for linear equality-constrained minimization are a canonical algorithmic flow used to solve problems of the form minimize f(x) subject to Ax=b. Establishing the largest contraction rate would yield tight robustness and convergence guarantees and unify analysis across normed and Riemannian settings.

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.

Perspectives on Contractivity in Control, Optimization, and Learning (2404.11707 - Davydov et al., 17 Apr 2024) in Section 6 (Conjectures and Future Directions), Theory