20.500.12556/RUL-106174
A new approximation hierarchy for polynomial conic optimization
In this paper we consider polynomial conic optimization problems, where the feasible set is defined by constraints in the form of given polynomial vectors belonging to given nonempty closed convex cones, and we assume that all the feasible solutions are non-negative. This family of problems captures in particular polynomial optimization problems (POPs), polynomial semi-definite polynomial optimization problems (PSDPs) and polynomial second-order cone-optimization problems (PSOCPs). We propose a new general hierarchy of linear conic optimization relaxations inspired by an extension of Pólyaʼs Positivstellensatz for homogeneous polynomials being positive over a basic semi-algebraic cone contained in the non-negative orthant, introduced in Dickinson and Povh (J Glob Optim 61(4):615-625, 2015). We prove that based on some classic assumptions, these relaxations converge monotonically to the optimal value of the original problem. Adding a redundant polynomial positive semi-definite constraint to the original problem drastically improves the bounds produced by our method. We provide an extensive list of numerical examples that clearly indicate the advantages and disadvantages of our hierarchy. In particular, in comparison to the classic approach of sum-of-squares, our new method provides reasonable bounds on the optimal value for POPs, and strong bounds for PSDPs and PSOCPs, even outperforming the sum-of-squares approach in these latter two cases.
V članku obravnavamo polinomske konične optimizacijske probleme, kjer je dopustna množica definirana z omejitvami, da morajo biti dani polinomski vektorji v danih nepraznih zaprtih konveksnih stožcih. Dodatno morajo dopustne rešitve zadoščati pogoju nenegativnosti. Ta družina problemov zajema zlasti klasične probleme polinomske optimizacije (POP), probleme polinomske semidefinitne optimizacije (PSDP) in probleme polinomske optimizacije nad stožci drugega reda (PSOCP). Predlagamo novo splošno hierarhijo linearnih koničnih optimizacijskih poenostavitev, ki naravno sledijo iz razširitve Pólya-jevega izreka o pozitivnosti iz Dickinson in Povh (J Glob Optim 61 (4): 615-625, 2015). Ob nekaterih klasičnih predpostavkah te poenostavitve monotono konvergirajo k optimalni vrednosti izvirnega problema. Kot zanimivost pokažemo, da dodajanje posebne redundantne omejitve k osnovnemu problemu ne spremeni optimalne rešitve tega problema, a bistveno izboljša kvaliteto poenostavitev. V članku tudi predstavimo obsežen seznam številčnih primerov, ki jasno kažejo na prednosti in slabosti naše hierarhije.
Polynomial conic optimization
Polynomial semi-definite programming
Polynomial second-order cone programming
Approximation hierarchy
Linear programming
Semi-definite programming
polinomska stožčna optimizacija
polinomsko semidefinitno programiranje
polinomska optimizacija nad stožci drugega reda
aproksimacijska hierarhija
linearna optimizacija
semidefinitna optimizacija
true
false
true
Angleški jezik
Slovenski jezik
Članek v reviji
2019-02-06 09:12:44
2019-02-06 09:12:47
2022-08-18 03:48:17
0000-00-00 00:00:00
2019
0
0
Str. [1-31]
Jan. 2019
0000-00-00
PostprintKoncna
VTisku
NiDoloceno
0000-00-00
0000-00-00
0000-00-00
2020-01-29
519.8(045)
0926-6003
10.1007/s10589-019-00066-0
16466459
RAZ_Dickinson_Peter_J._C._i2019.pdf
RAZ_Dickinson_Peter_J._C._i2019.pdf
1
859089A9476F2EF9B9A50E249C958C44
4fc0ce87a36b5bd97a28fb4d919246729676ec49a4bc119f49dff92d3544c0ac
4ba4dc89-a1b6-11eb-a523-00155dcfd717
https://repozitorij.uni-lj.si/Dokument.php?lang=slv&id=116915
https://link.springer.com/article/10.1007%2Fs10589-019-00066-0
1
https://repozitorij.uni-lj.si/Dokument.php?lang=slv&id=116914
Fakulteta za strojništvo
0
0
0