izpis_h1_title_alt

A new approximation hierarchy for polynomial conic optimization
Dickinson, Peter J. C. (Author), Povh, Janez (Author)

.pdfPDF - Presentation file, Download (463,92 KB)
URLURL - Source URL, Visit https://link.springer.com/article/10.1007%2Fs10589-019-00066-0 This link opens in a new window

Abstract
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.

Language:English
Keywords:Polynomial conic optimization, Polynomial semi-definite programming, Polynomial second-order cone programming, Approximation hierarchy, Linear programming, Semi-definite programming
Work type:Article (dk_c)
Tipology:1.01 - Original Scientific Article
Organization:FS - Faculty of Mechanical Engineering
Year:2019
Number of pages:str. [1-31]
UDC:519.8(045)
ISSN on article:0926-6003
DOI:10.1007/s10589-019-00066-0 Link is opened in a new window
COBISS.SI-ID:16466459 Link is opened in a new window
Views:305
Downloads:302
Metadata:XML RDF-CHPDL DC-XML DC-RDF
 
Average score:(0 votes)
Your score:Voting is allowed only to logged in users.
:
Share:AddThis
AddThis uses cookies that require your consent. Edit consent...

Document is financed by a project

Funder:ARRS - Agencija za raziskovalno dejavnost Republike Slovenije (ARRS)
Project no.:N1-0057, J1-8132, N1-0071, P1-0383
Name:Visoko zmogljiv reševalec za binarne kvadratične probleme, Pozitivne preslikave in realna algebrična geometrija, Razširitev algoritmov prvega in drugega reda za izbrane razrede optimizacijskih problemov s ciljem rešiti računsko zahtevne industrijske probleme, Kompleksna omrežja

Secondary language

Language:Slovenian
Abstract:
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.

Keywords:polinomska stožčna optimizacija, polinomsko semidefinitno programiranje, polinomska optimizacija nad stožci drugega reda, aproksimacijska hierarhija, linearna optimizacija, semidefinitna optimizacija

Similar documents

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

Comments

Leave comment

You have to log in to leave a comment.

Comments (0)
0 - 0 / 0
 
There are no comments!

Back