View : 237 Download: 0

Full metadata record

DC Field Value Language
dc.contributor.author김선영-
dc.date.accessioned2018-05-18T08:15:03Z-
dc.date.available2018-05-18T08:15:03Z-
dc.date.issued2005-
dc.identifier.issn1052-6234-
dc.identifier.otherOAK-2769-
dc.identifier.urihttps://dspace.ewha.ac.kr/handle/2015.oak/243115-
dc.description.abstractSequences of generalized Lagrangian duals and their sums of squares (SOS) of polynomials relaxations for a polynomial optimization problem (POP) are introduced. The sparsity of polynomials in the POP is used to reduce the sizes of the Lagrangian duals and their SOS relaxations. It is proved that the optimal values of the Lagrangian duals in the sequence converge to the optimal value of the POP using a method from the penalty function approach. The sequence of SOS relaxations is transformed into a sequence of semidefinite programing (SDP) relaxations of the POP, which correspond to duals of modification and generalization of SDP relaxations given by Lasserre for the POP. © 2005 Society for Industrial and Applied Mathematics.-
dc.languageEnglish-
dc.titleGeneralized lagrangian duals and sums of squares relaxations of sparse polynomial optimization blems-
dc.typeArticle-
dc.relation.issue3-
dc.relation.volume15-
dc.relation.indexSCIE-
dc.relation.indexSCOPUS-
dc.relation.startpage697-
dc.relation.lastpage719-
dc.relation.journaltitleSIAM Journal on Optimization-
dc.identifier.doi10.1137/030601260-
dc.identifier.wosidWOS:000229826800004-
dc.identifier.scopusid2-s2.0-23844439934-
dc.author.googleKim S.-
dc.author.googleKojima M.-
dc.author.googleWaki H.-
dc.contributor.scopusid김선영(57007276700)-
dc.date.modifydate20180517114647-
Appears in Collections:
자연과학대학 > 수학전공 > Journal papers
Files in This Item:
There are no files associated with this item.
Export
RIS (EndNote)
XLS (Excel)
XML


qrcode

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

BROWSE