Towards Scalable Algorithms with Formal Guarantees for Lyapunov Analysis of Control Systems via Algebraic Optimization

Exciting recent developments at the interface of optimization and control have shown that several fundamental problems in dynamics and control, such as stability, collision avoidance, robust performance, and controller synthesis can addressed by a synergy of classical tools from Lyapunov theory and modern computational techniques from algebraic optimization. In this paper, we give a brief overview of our recent research efforts (with various coauthors) to (i) enhance the scalability of the algorithms in this field, and (ii) understand their worst case performance guarantees as well as fundamental limitations. Our results are tersely surveyed and challenges/opportunities that lie ahead are stated.

By: Amir Ali Ahmadi, Pablo A. Parrilo

Published in: R25479 in 2014


This Research Report is available. This report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of IBM prior to publication should be limited to peer communications and specific requests. After outside publication, requests should be filled only by reprints or legally obtained copies of the article (e.g., payment of royalties). I have read and understand this notice and am a member of the scientific community outside or inside of IBM seeking a single copy only.


Questions about this service can be mailed to .