An efficient and safe framework for solving optimization problems

Abstract : Interval methods have shown their ability to locate and prove the existence of a global optima in a safe and rigorous way. Unfortunately, these methods are rather slow. Efficient solvers for optimization problems are based on linear relaxations. However, the latter are unsafe, and thus may overestimate, or, worst, underestimate the very global minima. This paper introduces QuadOpt, an efficient and safe framework to rigorously bound the global optima as well as its location. QuadOpt uses consistency techniques to speed up the initial convergence of the interval narrowing algorithms. A lower bound is computed on a linear relaxation of the constraint system and the objective function. All these computations are based on a safe and rigorous implementation of linear programming techniques. First experimental results are very promising.
Type de document :
Article dans une revue
Journal of Computational and Applied Mathematics, Elsevier, 2007, 199, pp.372-377,. 〈10.1016/j.cam.2005.08.037〉
Liste complète des métadonnées

Littérature citée [14 références]  Voir  Masquer  Télécharger

https://hal.archives-ouvertes.fr/hal-00510304
Contributeur : Michel Rueher <>
Soumis le : mercredi 18 août 2010 - 15:11:03
Dernière modification le : mercredi 18 août 2010 - 15:32:52
Document(s) archivé(s) le : vendredi 19 novembre 2010 - 02:24:56

Fichier

scan-04.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Collections

Citation

Yahia Lebbah, Claude Michel, Michel Rueher. An efficient and safe framework for solving optimization problems. Journal of Computational and Applied Mathematics, Elsevier, 2007, 199, pp.372-377,. 〈10.1016/j.cam.2005.08.037〉. 〈hal-00510304〉

Partager

Métriques

Consultations de la notice

143

Téléchargements de fichiers

53