Proximal Gradient Dynamics and Feedback Control for Equality-Constrained Composite Optimization
By: Veronica Centorrino , Francesca Rossi , Francesco Bullo and more
Potential Business Impact:
Solves hard math problems faster for computers.
This paper studies equality-constrained composite minimization problems. This class of problems, capturing regularization terms and convex inequality constraints, naturally arises in a wide range of engineering and machine learning applications. To tackle these minimization problems, we introduce the \emph{proportional--integral proximal gradient dynamics} (PI--PGD): a closed-loop system where the Lagrange multipliers are control inputs and states are the problem decision variables. First, we establish the equivalence between the minima of the optimization problem and the equilibria of the PI--PGD. Then {for the case of affine constraints}, {by} leveraging tools from contraction theory we give a comprehensive convergence analysis for the dynamics, showing linear--exponential convergence towards the equilibrium. That is, the distance between each solution and the equilibrium is upper bounded by a function that first decreases linearly and then exponentially. Our findings are illustrated numerically on a set of representative examples, which include an application to entropy-regularized optimal transport.
Similar Papers
Integral control of the proximal gradient method for unbiased sparse optimization
Optimization and Control
Makes computer math problems solve faster and better.
PGD-TO: A Scalable Alternative to MMA Using Projected Gradient Descent for Multi-Constraint Topology Optimization
Computational Engineering, Finance, and Science
Designs stronger shapes faster, even with many rules.
Inexact Projected Preconditioned Gradient Methods with Variable Metrics: General Convergence Theory via Lyapunov Approach
Optimization and Control
Solves hard math problems faster for science.