Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > math > arXiv:2306.00565

Help | Advanced Search

Mathematics > Optimization and Control

arXiv:2306.00565 (math)
[Submitted on 1 Jun 2023 (v1) , last revised 15 Sep 2023 (this version, v2)]

Title: Optimization Algorithm Synthesis based on Integral Quadratic Constraints: A Tutorial

Title: 基于积分二次约束的优化算法综合:教程

Authors:Carsten W. Scherer, Christian Ebenbauer, Tobias Holicki
Abstract: We expose in a tutorial fashion the mechanisms which underlie the synthesis of optimization algorithms based on dynamic integral quadratic constraints. We reveal how these tools from robust control allow to design accelerated gradient descent algorithms with optimal guaranteed convergence rates by solving small-sized convex semi-definite programs. It is shown that this extends to the design of extremum controllers, with the goal to regulate the output of a general linear closed-loop system to the minimum of an objective function. Numerical experiments illustrate that we can not only recover gradient decent and the triple momentum variant of Nesterov's accelerated first order algorithm, but also automatically synthesize optimal algorithms even if the gradient information is passed through non-trivial dynamics, such as time-delays.
Abstract: 我们以教程的形式展示了基于动态积分二次约束的优化算法综合机制。我们揭示了这些来自鲁棒控制的工具如何通过求解小型凸半定规划问题来设计具有最优保证收敛率的加速梯度下降算法。结果表明,这种方法可以扩展到极值控制器的设计中,目的是将一般线性闭环系统的输出调节为目标函数的最小值。数值实验表明,我们不仅可以恢复梯度下降法和Nesterov加速一阶算法的三倍动量变体,还可以自动合成最优算法,即使梯度信息通过非平凡的动力学(如时滞)传递也是如此。
Comments: A short version of this paper has been accepted for publication at the CDC 2023
Subjects: Optimization and Control (math.OC) ; Systems and Control (eess.SY)
Cite as: arXiv:2306.00565 [math.OC]
  (or arXiv:2306.00565v2 [math.OC] for this version)
  https://doi.org/10.48550/arXiv.2306.00565
arXiv-issued DOI via DataCite

Submission history

From: Carsten Scherer [view email]
[v1] Thu, 1 Jun 2023 11:25:30 UTC (224 KB)
[v2] Fri, 15 Sep 2023 11:23:48 UTC (202 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • TeX Source
license icon view license
Current browse context:
math.OC
< prev   |   next >
new | recent | 2023-06
Change to browse by:
cs
cs.SY
eess
eess.SY
math

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号