Sparse noncommutative polynomial optimizationKlep, Igor (Avtor) Magron, Victor (Avtor) Povh, Janez (Avtor) noncommutative polynomialsparsity patternsemialgebraic setsemidefinite programmingeigenvalue optimizationtrace optimizationGNS constructionThis article focuses on optimization of polynomials in noncommuting variables, while taking into account sparsity in the input data. A converging hierarchy of semidefinite relaxations for eigenvalue and trace optimization is provided. This hierarchy is a noncommutative analogue of results due to Lasserre (SIAM J Optim 17(3):822-843, 2006) and Waki et al. (SIAM J Optim 17(1):218-242, 2006). The Gelfand-Naimark-Segal construction is applied to extract optimizers if flatness and irreducibility conditions are satisfied. Among the main techniques used are amalgamation results from operator algebra. The theoretical results are utilized to compute lower bounds on minimal eigenvalue of noncommutative polynomials from the literature.20212021-02-01 20:43:26Članek v reviji124550UDK: 512.622(045)ISSN pri članku: 0025-5610DOI: 10.1007/s10107-020-01610-1COBISS_ID: 49537283sl