2 rezultata
1 - 2 / 2   1  |
1. Minimizer extraction in polynomial optimization is robust Igor Klep, Janez Povh, Jurij Volčič, 2018, izvirni znanstveni članek Ključne besede: polynomial optimization, sum of squares, semidefinite programming, moment problem, Hankel matrix, flat extension, GNS construction, noncommutative polynomial, trace |
2. Sparse noncommutative polynomial optimization Igor Klep, Victor Magron, Janez Povh, 2021, izvirni znanstveni članek Ključne besede: noncommutative polynomial, sparsity pattern, semialgebraic set, semidefinite programming, eigenvalue optimization, trace optimization, GNS construction |
Iskanje izvedeno v 0.01 sek.
Na vrh