View : 779 Download: 0

Full metadata record

DC Field Value Language
dc.contributor.author김선영*
dc.date.accessioned2016-08-27T02:08:32Z-
dc.date.available2016-08-27T02:08:32Z-
dc.date.issued2013*
dc.identifier.issn1348-9151*
dc.identifier.otherOAK-9737*
dc.identifier.urihttps://dspace.ewha.ac.kr/handle/2015.oak/216708-
dc.description.abstractThe solution methods based on semidefinite programming (SDP) relaxations for sensor network localization (SNL) problems can not handle very large-sized SNL problems. We present a continuation method using the gradient descent method to efficiently solve large-sized SNL problems. We first formulate the problem as an unconstrained optimization problem and then apply the continuation on the distance information with the continuation parameter. We show numerically that the continuation method provides an approximate solution efficiently with comparable accuracy to that of SFSDP, a Matlab software package, which showed better performance than other SDP-based methods for solving various types of the problems. Numerical results are presented to illustrate the performance of the proposed method in comparison with SFSDP.*
dc.languageEnglish*
dc.publisherYOKOHAMA PUBL*
dc.subjectsensor network localization problems*
dc.subjectcontinuation methods*
dc.subjecta first-order method*
dc.subjectMatlab software package*
dc.titleA CONTINUATION METHOD FOR LARGE-SIZED SENSOR NETWORK LOCALIZATION PROBLEMS*
dc.typeArticle*
dc.relation.issue1*
dc.relation.volume9*
dc.relation.indexSCIE*
dc.relation.startpage117*
dc.relation.lastpage136*
dc.relation.journaltitlePACIFIC JOURNAL OF OPTIMIZATION*
dc.identifier.wosidWOS:000314737500009*
dc.author.googleKim, Sunyoung*
dc.author.googleKojima, Masakazu*
dc.contributor.scopusid김선영(57221275622)*
dc.date.modifydate20231116113048*
Appears in Collections:
자연과학대학 > 수학전공 > Journal papers
Files in This Item:
There are no files associated with this item.
Export
RIS (EndNote)
XLS (Excel)
XML


qrcode

BROWSE