UNI-MB - logo
UMNIK - logo
 
VSE knjižnice (vzajemna bibliografsko-kataložna baza podatkov COBIB.SI)
PDF Celotno besedilo
  • Sparse noncommutative polynomial optimization
    Klep, Igor, 1978- ; Magron, Victor ; Povh, Janez, 1973-
    This 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.
    Vir: Mathematical programming. - ISSN 0025-5610 (2021, str. [1-41])
    Vrsta gradiva - članek, sestavni del
    Leto - 2021
    Jezik - angleški
    COBISS.SI-ID - 49537283

    Povezava(-e):

    https://link.springer.com/article/10.1007%2Fs10107-020-01610-1#article-info
    Repozitorij Univerze v Ljubljani – RUL
    DOI

Vnos na polico