全局求解用于 GPS 定位的分数平方最小二乘模型

IF 1.7 3区数学 Q2 MATHEMATICS, APPLIED

Numerical Algorithms Pub Date : 2024-09-14 DOI:10.1007/s11075-024-01935-4

Xiaoli Cen, Yong Xia

{"title":"全局求解用于 GPS 定位的分数平方最小二乘模型","authors":"Xiaoli Cen, Yong Xia","doi":"10.1007/s11075-024-01935-4","DOIUrl":null,"url":null,"abstract":"<p>This study presents a new branch and bound algorithm designed for the global optimization of the fractional squared least squares model for GPS localization. The algorithm incorporates a novel underestimation approach that provides theoretically superior lower bounds while requiring a comparable computational effort to the current approach. Numerical results demonstrate the substantial efficiency enhancements of the proposed algorithm over the existing algorithm.</p>","PeriodicalId":54709,"journal":{"name":"Numerical Algorithms","volume":null,"pages":null},"PeriodicalIF":1.7000,"publicationDate":"2024-09-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Globally solving the fractional squared least squares model for GPS localization\",\"authors\":\"Xiaoli Cen, Yong Xia\",\"doi\":\"10.1007/s11075-024-01935-4\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>This study presents a new branch and bound algorithm designed for the global optimization of the fractional squared least squares model for GPS localization. The algorithm incorporates a novel underestimation approach that provides theoretically superior lower bounds while requiring a comparable computational effort to the current approach. Numerical results demonstrate the substantial efficiency enhancements of the proposed algorithm over the existing algorithm.</p>\",\"PeriodicalId\":54709,\"journal\":{\"name\":\"Numerical Algorithms\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":1.7000,\"publicationDate\":\"2024-09-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Numerical Algorithms\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1007/s11075-024-01935-4\",\"RegionNum\":3,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"MATHEMATICS, APPLIED\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Numerical Algorithms","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s11075-024-01935-4","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}

引用次数: 0

摘要

本研究提出了一种新的分支和约束算法，旨在对用于 GPS 定位的分数平方最小二乘法模型进行全局优化。该算法采用了一种新颖的低估方法，可提供理论上更优越的下限，同时所需的计算量与当前方法相当。数值结果表明，与现有算法相比，拟议算法大大提高了效率。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

$Globally solving the fractional squared least squares model for GPS localization$

查看原文本刊更多论文

Globally solving the fractional squared least squares model for GPS localization

This study presents a new branch and bound algorithm designed for the global optimization of the fractional squared least squares model for GPS localization. The algorithm incorporates a novel underestimation approach that provides theoretically superior lower bounds while requiring a comparable computational effort to the current approach. Numerical results demonstrate the substantial efficiency enhancements of the proposed algorithm over the existing algorithm.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Numerical Algorithms 数学-应用数学

CiteScore

4.00

自引率

9.50%

发文量

201

审稿时长

9 months

期刊介绍： The journal Numerical Algorithms is devoted to numerical algorithms. It publishes original and review papers on all the aspects of numerical algorithms: new algorithms, theoretical results, implementation, numerical stability, complexity, parallel computing, subroutines, and applications. Papers on computer algebra related to obtaining numerical results will also be considered. It is intended to publish only high quality papers containing material not published elsewhere.