Lagrange Multiplier Expressions for Matrix Polynomial Optimization and Tight Relaxations
SIAM Journal on Optimization · 30.06.2026 · 36 (2) · 1017-1042
DOI: 10.1137/25m1788907 ↗Kurz gefasst
Fachartikel in der Zeitschrift SIAM Journal on Optimization, online erschienen am 15.06.2026. Verfasst von Lei Huang und 3 weiteren Autor:innen. Die Arbeit nennt 51 Literaturangaben. Gefördert von: National Science Foundation.
Abstract (Originalsprache)
This paper studies matrix constrained polynomial optimization. We investigate how to get explicit expressions for Lagrange multiplier matrices from the first order optimality conditions. The existence of these expressions can be shown under the nondegeneracy condition. Using Lagrange multiplier matrix expressions, we propose a strengthened Moment-SOS hierarchy for solving matrix polynomial optimization. Given some general assumptions, we show that this strengthened hierarchy is tight, or equivalently, it has finite convergence. We also study how to detect tightness and how to extract optimizers. Numerical experiments are provided to show the efficiency of the strengthened hierarchy.
Förderung
- National Science Foundation
Zitieren
APA
Huang, L., Nie, J., Wang, J., & Xie, L. (2026). Lagrange Multiplier Expressions for Matrix Polynomial Optimization and Tight Relaxations. SIAM Journal on Optimization, 36(2), 1017-1042. https://doi.org/10.1137/25m1788907
Vancouver
Huang L, Nie J, Wang J, Xie L. Lagrange Multiplier Expressions for Matrix Polynomial Optimization and Tight Relaxations. SIAM Journal on Optimization. 2026;36(2):1017-1042. doi:10.1137/25m1788907
BibTeX
@article{Huang2026,
author = {Huang, Lei and Nie, Jiawang and Wang, Jiajia and Xie, Lingling},
title = {Lagrange Multiplier Expressions for Matrix Polynomial Optimization and Tight Relaxations},
journal = {SIAM Journal on Optimization},
year = {2026},
volume = {36},
number = {2},
pages = {1017--1042},
doi = {10.1137/25m1788907}
}
EUVIMED