Minimizing rational functions: a hierarchy of approximations via pushforward measures - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles SIAM Journal on Optimization Year : 2021

Minimizing rational functions: a hierarchy of approximations via pushforward measures

Abstract

This paper is concerned with minimizing a sum of rational functions over a compact set of high-dimension. Our approach relies on the second Lasserre's hierarchy (also known as the upper bounds hierarchy) formulated on the pushforward measure in order to work in a space of smaller dimension. We show that in the general case the minimum can be approximated as closely as desired from above with a hierarchy of semidefinite programs problems or, in the particular case of a single fraction, with a hierarchy of generalized eigenvalue problems. We numerically illustrate the potential of using the pushforward measure rather than the standard upper bounds hierarchy. In our opinion, this potential should be a strong incentive to investigate a related challenging problem interesting in its own; namely integrating an arbitrary power of a given polynomial on a simple set (e.g., unit box or unit sphere) with respect to Lebesgue or Haar measure.

Dates and versions

hal-03053386 , version 1 (11-12-2020)

Identifiers

Cite

Jean-Bernard Lasserre, Victor Magron, Swann Marx, Olivier Zahm. Minimizing rational functions: a hierarchy of approximations via pushforward measures. SIAM Journal on Optimization, 2021, 31 (3), pp.2285-2306. ⟨10.1137/20M138541X⟩. ⟨hal-03053386⟩
214 View
0 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More