An elementary proof for the exact relaxation for rank one moment matrices in multi-polynomial SOS relaxation
Minimax theory and its applications, Tome 4 (2019) no. 2
Voir la notice de l'article provenant de la source Minimax Theory and its Applications website
Zbl
We present an elementary proof for the fact that an optimal rank one moment matrix in the multi-polynomial SOS relaxation gives an exact relaxation. This fact is a fundamental result in multi-polynomial SOS relaxation method for the class of multi-polynomial optimization problems. The multi-polynomial SOS relaxation method is designed by exploring the special structures of the class of multi-polynomial optimization problems, which has the advantage for giving an SDP with size about half of that for the classical SOS relaxation in the general formulation.
Shenglong Hu. An elementary proof for the exact relaxation for rank one moment matrices in multi-polynomial SOS relaxation. Minimax theory and its applications, Tome 4 (2019) no. 2. http://geodesic.mathdoc.fr/item/MTA_2019_4_2_a5/
@article{MTA_2019_4_2_a5,
author = {Shenglong Hu},
title = {An elementary proof for the exact relaxation for rank one moment matrices in multi-polynomial {SOS} relaxation},
journal = {Minimax theory and its applications},
year = {2019},
volume = {4},
number = {2},
zbl = {1450.49004},
url = {http://geodesic.mathdoc.fr/item/MTA_2019_4_2_a5/}
}