The Analysis of Optimization Algorithms, A Dissipativity Approach
Laurent Lessard

TL;DR
This paper applies dissipativity theory from control systems to analyze and improve the convergence of iterative optimization algorithms, providing a systematic, control-inspired framework for their selection and tuning.
Contribution
It formalizes the connection between optimization algorithms and control systems using dissipativity theory, enabling systematic analysis and tuning of algorithms.
Findings
Dissipativity theory can characterize convergence properties of optimization algorithms.
Control-theoretic framework allows systematic selection and tuning of algorithms.
Examples demonstrate the effectiveness of the dissipativity approach.
Abstract
Optimization problems in engineering and applied mathematics are typically solved in an iterative fashion, by systematically adjusting the variables of interest until an adequate solution is found. The iterative algorithms that govern these systematic adjustments can be viewed as a control system. In control systems, the output in measured and the input is adjusted using feedback to drive the error to zero. Similarly, in iterative algorithms, the optimization objective is evaluated and the candidate solution is adjusted to drive it toward the optimal point. Choosing an algorithm that works well for a variety of optimization problems is akin to robust controller design. Just as dissipativity theory can be used to analyze the stability properties of control systems, it can also be used to analyze the convergence properties of iterative algorithms. By defining an appropriate notion of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
