izpis_h1_title_alt

Minimizer extraction in polynomial optimization is robust
ID Klep, Igor (Author), ID Povh, Janez (Author), ID Volčič, Jurij (Author)

.pdfPDF - Presentation file, Download (493,08 KB)
MD5: 8C4794468E69F11FF4950B7BDCDF5D9D
URLURL - Source URL, Visit https://epubs.siam.org/doi/abs/10.1137/17M1152061 This link opens in a new window

Language:English
Keywords:polynomial optimization, sum of squares, semidefinite programming, moment problem, Hankel matrix, flat extension, GNS construction, noncommutative polynomial, trace
Work type:Article
Typology:1.01 - Original Scientific Article
Organization:FS - Faculty of Mechanical Engineering
Publication status:Published
Publication version:Version of Record
Year:2018
Number of pages:Str. 3177-3207
Numbering:Vol. 28, no. 4
PID:20.500.12556/RUL-105797 This link opens in a new window
UDC:519.85(045)
ISSN on article:1052-6234
DOI:10.1137/17M1152061 This link opens in a new window
COBISS.SI-ID:16398875 This link opens in a new window
Publication date in RUL:17.12.2018
Views:1381
Downloads:841
Metadata:XML RDF-CHPDL DC-XML DC-RDF
:
Copy citation
Share:Bookmark and Share

Secondary language

Language:Slovenian
Keywords:polinomska optimizacija, vsote kvadratov, semidefinitno programiranje, problem momentov, Hankelova matrika, ploščata razširitev, GNS konstrukcija, nekomutativni polinomi, sled

Projects

Funder:ARRS - Slovenian Research Agency
Project number:J1-8132, P1-0222
Name:Pozitivne preslikave in realna algebrična geometrija, Algebra v teoriji operatorjev in finančna matematika
Acronym:BiqBin

Similar documents

Similar works from RUL:
Similar works from other Slovenian collections:

Back