Georgia Institute of Technology
Formal verification and validation of convex optimization algorithms for model predictive control
Abstract
dc:description.abstractThe efficiency of modern optimization methods, coupled with increasing computational resources, has led to the possibility of real-time optimization algorithms acting in safety critical roles. However, this cannot happen without addressing proper attention to the soundness of these algorithms. This PhD thesis discusses the formal verification of convex optimization algorithms with a articular emphasis on receding-horizon controllers. Additionally, we demonstrate how theoretical proofs of real-time optimization algorithms can be used to describe functional properties at the code level, thereby making it accessible for the formal methods community. In seeking zero-bug software, we use the Credible Autocoding scheme. We focused our attention on the ellipsoid algorithm solving second-order cone programs (SOCP). In addition to this, we present a floating-point analysis of the algorithm and give a framework to numerically validate the method.
Degree
thesis:*- Level thesis:degree_level
- Doctoral
- Department dc:contributor.department
- Aerospace Engineering
- Grantor dc:publisher
- Georgia Institute of Technology
- Year dc:date.issued
- 2018
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Cohen, Raphael P.
- Advisors dc:contributor.advisor
-
- Feron, Eric
- Garoche, Pierre-Loïc
- Committee members dc:contributor.committeemember
-
- Tsiotras, Panagiotis
- Holzinger, Marcus J.
- Wang, Tim
- Muñoz, César
Subjects
dc:subject × 7Rights
- Language dc:language.iso
- en_US
Identifiers
dc:identifier.*- Handle dc:identifier.uri
- http://hdl.handle.net/1853/61186