Minimizing the sum of many rational functions - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Mathematical Programming Computation Année : 2015

Minimizing the sum of many rational functions

Résumé

We consider the problem of globally minimizing the sum of many rational functionsover a given compact semialgebraic set. The number of terms can be large (10 to 100),the degree of each term should be small (up to 10), and the number of variables can be relatively large(10 to 100) provided some kind of sparsity is present. We describe a formulation of therational optimization problemas a generalized moment problem and its hierarchy of convex semidefinite relaxations. Undersome conditions we prove that the sequence of optimal values convergesto the globally optimal value. We show how public-domain software can beused to model and solve such problems. Finally, we also compare with the epigraph approach and the BARON software.
Fichier principal
Vignette du fichier
rational.pdf (244.76 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-00569067 , version 1 (24-02-2011)
hal-00569067 , version 2 (04-12-2014)

Identifiants

Citer

Florian Bugarin, Didier Henrion, Jean-Bernard Lasserre. Minimizing the sum of many rational functions. Mathematical Programming Computation, 2015, 8 (1), pp. 83-111. ⟨10.1007/s12532-015-0089-z⟩. ⟨hal-00569067v2⟩
273 Consultations
1116 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More