中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
Continuation methods with the trusty time-stepping scheme for linearly constrained optimization with noisy data

文献类型:期刊论文

作者Luo, Xin-long1; Lv, Jia-hui1; Sun, Geng2
刊名OPTIMIZATION AND ENGINEERING
出版日期2021-02-01
页码32
关键词Continuation method Trust-region technique Visual-inertial localization Unmanned aerial vehicle Noisy data Differential-algebraic dynamical system
ISSN号1389-4420
DOI10.1007/s11081-020-09590-z
英文摘要The nonlinear optimization problem with linear constraints has many applications in engineering fields such as the visual-inertial navigation and localization of an unmanned aerial vehicle maintaining the horizontal flight. In order to solve this practical problem efficiently, this paper constructs a continuation method with the trusty time-stepping scheme for the linearly equality-constrained optimization problem at every sampling time. At every iteration, the new method only solves a system of linear equations other than the traditional optimization method such as the sequential quadratic programming (SQP) method, which needs to solve a quadratic programming subproblem. Consequently, the new method can save much more computational time than SQP. Numerical results show that the new method works well for this problem and its consumed time is about one fifth of that of SQP (the built-in subroutine fmincon.m of the MATLAB2018a environment) or that of the traditional dynamical method (the built-in subroutine ode15s.m of the MATLAB2018a environment). Furthermore, we also give the global convergence analysis of the new method.
资助项目National Natural Science Foundation of China[61876199] ; Huawei Technologies Co., Ltd.[YBWL2011085] ; Innovation Research Program of Huawei Technologies Co., Ltd..[YJCB2011003HI]
WOS研究方向Engineering ; Operations Research & Management Science ; Mathematics
语种英语
WOS记录号WOS:000613598300001
出版者SPRINGER
源URL[http://ir.amss.ac.cn/handle/2S8OKBNM/58106]  
专题中国科学院数学与系统科学研究院
通讯作者Luo, Xin-long
作者单位1.Beijing Univ Posts & Telecommun, Sch Artificial Intelligence, POB 101,Xitucheng Rd 10, Beijing 100876, Peoples R China
2.Chinese Acad Sci, Acad Math & Syst Sci, Inst Math, Beijing 100190, Peoples R China
推荐引用方式
GB/T 7714
Luo, Xin-long,Lv, Jia-hui,Sun, Geng. Continuation methods with the trusty time-stepping scheme for linearly constrained optimization with noisy data[J]. OPTIMIZATION AND ENGINEERING,2021:32.
APA Luo, Xin-long,Lv, Jia-hui,&Sun, Geng.(2021).Continuation methods with the trusty time-stepping scheme for linearly constrained optimization with noisy data.OPTIMIZATION AND ENGINEERING,32.
MLA Luo, Xin-long,et al."Continuation methods with the trusty time-stepping scheme for linearly constrained optimization with noisy data".OPTIMIZATION AND ENGINEERING (2021):32.

入库方式: OAI收割

来源:数学与系统科学研究院

浏览0
下载0
收藏0
其他版本

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。