Credible Autocoding of The Ellipsoid Algorithm Solving Second-Order Cone Programs - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2018

Credible Autocoding of The Ellipsoid Algorithm Solving Second-Order Cone Programs

Résumé

The efficiency of modern optimization meth- ods, coupled with increasing computational resources, has led to the possibility of real-time optimization algorithms acting in guidance of systems. Unfortunately, those algo- rithms are still seen as new and obscure and are not considered as a viable option for safety critical roles. This paper deals with the formal verification of convex optimization algorithms. Additionally, we demonstrate how theoretical proofs of real-time convex optimization algo- rithms 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 framework. We focused our attention on the Ellipsoid Algorithm solving second-order cone programs (SOCP). The paper also considers floating- point errors and gives a framework to numerically validate the method.
Fichier principal
Vignette du fichier
DTIS18240.1539349109.pdf (1006.08 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01983383 , version 1 (16-01-2019)

Identifiants

  • HAL Id : hal-01983383 , version 1

Citer

Raphael Cohen, Eric Féron, Pierre-Loïc Garoche. Credible Autocoding of The Ellipsoid Algorithm Solving Second-Order Cone Programs. 57th IEEE Conference on Decision and Control, Dec 2018, MIAMI, United States. ⟨hal-01983383⟩

Collections

ONERA
42 Consultations
170 Téléchargements

Partager

Gmail Facebook X LinkedIn More