Connecting optimization with spectral analysis of tri-diagonal (univariate) moment matrices

Jean B. LasserreINRIA 2019

Abstract

We show that the global minimum (resp. maximum) of a continuous function on a compact set can be approximated from above (resp. from below) by computing the smallest (rest. largest) eigenvalue of a hierarchy of (r x r) tri-diagonal univariate moment matrix of increasing size. Equivalently it reduces to computing the smallest (resp. largest) root of a certain univariate degree-r orthonormal polynomial. This provides a strong connection between the fields of optimization, orthogonal poly-nomials, numerical analysis and linear algebra, via asymptotic spectral analysis of tri-diagonal symmetric matrices.
BibTeX
@inproceedings{lasserre2019connecting,
  author = {Jean B. Lasserre},
  title = {{Connecting optimization with spectral analysis of tri-diagonal (univariate) moment matrices}},
  booktitle = {INRIA},
  year = {2019},
}

Loading related content...

Figure