Credible Autocoding of Convex Optimization Algorithms - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Optimization and Engineering Année : 2016

Credible Autocoding of Convex Optimization Algorithms

Résumé

The 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. There is a considerable body of mathematical proofs on on-line optimization programs which can be leveraged to assist in the development and verification of their implementation. In this paper, we demonstrate how theoretical proofs of real-time optimization algorithms can be used to describe functional properties at the level of the code, thereby making it accessible for the formal methods community. The running example used in this paper is a generic semi-definite programming (SDP) solver. Semi-definite programs can encode a wide variety of optimization problems and can be solved in polynomial time at a given accuracy. We describe a top-to-down approach that transforms a high-level analysis of the algorithm into useful code annotations. We formulate some general remarks about how such a task can be incorporated into a convex programming autocoder. We then take a first step towards the automatic verification of the optimization program by identifying key issues to be adressed in future work.
Fichier principal
Vignette du fichier
crediblesdp.pdf (424.98 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00961133 , version 1 (19-03-2014)

Identifiants

Citer

Timothy Wang, Romain Jobredeaux, Marc Pantel, Pierre-Loïc Garoche, Eric Féron, et al.. Credible Autocoding of Convex Optimization Algorithms. Optimization and Engineering, 2016, 17 (4), pp.781-812. ⟨10.1007/s11081-016-9320-7⟩. ⟨hal-00961133⟩
795 Consultations
201 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More