Evaluation of Lyapunov Function Candidates through Averaging Iterations

DOI10.5220/0009992507340744zbMATH Open1530.93430OpenAlexW3042560875MaRDI QIDQ6092008FDOQ6092008

Authors: Carlos Argáez, Peter Giesl, Sigurdur Hafstein 

Publication date: 22 November 2023

Published in: Proceedings of the 17th International Conference on Informatics in Control, Automation and Robotics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.5220/0009992507340744

Recommendations

• Construction of a Complete Lyapunov Function using Quadratic Programming
• Computing complete Lyapunov functions for discrete-time dynamical systems
• Computational Approach for Complete Lyapunov Functions
• Minimization with differential inequality constraints applied to complete Lyapunov functions
• Existence of complete Lyapunov functions with prescribed orbital derivative

zbMATH Keywords

dynamical systemsiterative methodsnumerical methodschain-recurrent setcomplete Lyapunov functions

Mathematics Subject Classification ID

Quadratic programming (90C20) Lyapunov and storage functions (93D30)

Cited In (1)

• Construction of a Complete Lyapunov Function using Quadratic Programming

This page was built for publication: Evaluation of Lyapunov Function Candidates through Averaging Iterations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6092008)