Metraipolis › archive › dc_86eade57f984
Lie bracket approximations of RMSprop for Extremum Seeking Control — arXiv:2609.06505
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.06505
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-16T14:24:03.600Z
- SHA-256 of the archived text
08837355085a33efb2f1c83cb758c5c2b0c86690a869706c7651d5f63c29b0a9- Stable URL of this page
https://metraipolis.com/documento/dc_86eade57f984
How to cite
Lie bracket approximations of RMSprop for Extremum Seeking Control — arXiv:2609.06505 — arXiv (en), https://arxiv.org/abs/2609.06505 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_86eade57f984 (Metraipolis archive dc_86eade57f984, sha256 08837355085a33efb2f1c83cb758c5c2b0c86690a869706c7651d5f63c29b0a9)
BibTeX
@misc{dc86eade57f984,
title = {Lie bracket approximations of RMSprop for Extremum Seeking Control — arXiv:2609.06505},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.06505},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_86eade57f984; sha256 08837355085a33efb2f1c83cb758c5c2b0c86690a869706c7651d5f63c29b0a9},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.06505. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
This paper presents novel extremum seeking algorithms inspired by RMSProp dynamics and based on Lie bracket approximation techniques. To inherit the behavior of the classical continuous-time RMSProp algorithm, we introduce an extremum seeking scheme that exploits second-order Lie brackets, allowing the excitation of squared gradient terms in the resulting Lie bracket system. Moreover, we propose two modified RMSProp-type algorithms that can be implemented using only first-order Lie bracket approximations, thereby reducing the complexity of the extremum seeking control design. The three resulting extremum seeking algorithms are compared through numerical simulations. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-09 in math.OC). Categorie arXiv: Optimization and Control (math.OC). Pagina del lavoro: https://arxiv.org/abs/2609.06505 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-16T14:09:21.671Z dalla pagina https://arxiv.org/catchup/math.OC/2026-09-09?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).