izpis_h1_title_alt

Extracting optimisers by non-commutative GNS construction is robust
Povh, Janez (Avtor), Volčič, Jurij (Avtor), Klep, Igor (Avtor)

Gradivo nima datotek.
Gradivo je morda fizično dosegljivo v knjižnici fakultete, zalogo lahko preverite v COBISS-u. Povezava se odpre v novem oknu

Izvleček
Extracting eigenvalue optimisers in optimization of non commutative polynomials can be done efficiently by Gelfand Naimark-Segal (GNS) construction if the dual (moment) problem has flat optimum solution. However, in numerical computations the flatness is always subject to rounding threshold, i.e., often we can find only approximately flat dual solutions. In this talk we present how to apply GNS construction to approximately flat data and present sensitivity analysis results. We show that if the optimum of the dual problem is close to a flat solution then it yields a solution on the primal side that is close to an optimum solution. The distance to the optimum solution on the primal side can be expressed by the distance to a flat solution on the dual side. Similarly we can express for constraint optimization how close is the solution given by GNS construction to primal feasible and/or optimum solution in terms of the distance of the dual optimum to flatness. With extensive numerical evaluations we show that the established relations are usually very tight when we deal with random non-commutative polynomials. The focus will be on the (constrained) eigenvalue optimization for noncommutative polynomials, but we will also explain how the main results pertain to commutative and tracial optimization

Jezik:Angleški jezik
Ključne besede:high performance computing, polynomial optimization, optimum extraction, flat extension, robustness
Tipologija:1.12 - Objavljeni povzetek znanstvenega prispevka na konferenci
Organizacija:FS - Fakulteta za strojništvo
Leto izida:2018
Št. strani:Str. 244
UDK:519.8(045)
COBISS.SI-ID:16150555 Povezava se odpre v novem oknu
Število ogledov:460
Število prenosov:0
Metapodatki:XML RDF-CHPDL DC-XML DC-RDF
 
Skupna ocena:(0 glasov)
Vaša ocena:Ocenjevanje je dovoljeno samo prijavljenim uporabnikom.
:
Objavi na:AddThis
AddThis uporablja piškotke, za katere potrebujemo vaše privoljenje.
Uredi privoljenje...

Gradivo je del monografije

Naslov:ISMP 2018
Založnik:University of Bordeaux
COBISS.SI-ID:16150299 Povezava se odpre v novem oknu
Kraj izida:Bordeaux
Leto izida:2018

Sekundarni jezik

Jezik:Slovenski jezik
Ključne besede:visoko zmogljivo računalništvo, polinomska optimizacija, ekstrakcija optimuma, ploske razširitve, robustnost

Podobna dela

Podobna dela v RUL:
Podobna dela v drugih slovenskih zbirkah:

Komentarji

Dodaj komentar

Za komentiranje se morate prijaviti.

Komentarji (0)
0 - 0 / 0
 
Ni komentarjev!

Nazaj