1 - 2 / 2 ![]() ![]() ![]() ![]() |
1. Minimizer extraction in polynomial optimization is robust Igor Klep, Janez Povh, Jurij Volčič, 2018, original scientific article Keywords: 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, original scientific article Keywords: noncommutative polynomial, sparsity pattern, semialgebraic set, semidefinite programming, eigenvalue optimization, trace optimization, GNS construction |