Near-optimal Closed-loop Method via Lyapunov Damping for Convex Optimization

Severin Maier, Camille Castera, Peter Ochs
11/16/2023
math.OCcs.LGmath.DS

No confident code implementation found for this paper.

Abstract

We introduce an autonomous system with closed-loop damping for first-order convex optimization. While, to this day, optimal rates of convergence are almost exclusively achieved by non-autonomous methods via open-loop damping (e.g., Nesterov's algorithm), we show that our system, featuring a closed-loop damping, exhibits a rate arbitrarily close to the optimal one. We do so by coupling the damping and the speed of convergence of the system via a well-chosen Lyapunov function. By discretizing our system we then derive an algorithm and present numerical experiments supporting our theoretical findings.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{maier2023nearoptimal,
  title  = {Near-optimal Closed-loop Method via Lyapunov Damping for Convex Optimization},
  author = {Severin Maier and Camille Castera and Peter Ochs},
  year   = {2023},
  eprint = {2311.10053},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2311.10053v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2311.10053.svg)](https://codeofpaper.com/paper/2311.10053)

Discussion