Improved Time of Arrival measurement model for non-convex optimization

被引:2
|
作者
Sidorenko, Juri [1 ,2 ]
Schatz, Volker [1 ]
Doktorski, Leo [1 ]
Scherer-Negenborn, Norbert [1 ]
Arens, Michael [1 ]
Hugentobler, Urs [2 ]
机构
[1] Syst Technol & Image Exploitat IOSB, Fraunhofer Inst Optron, Ettlingen, Germany
[2] Tech Univ Munich, Inst Astron & Phys Geodesy, Munich, Germany
来源
关键词
POSITION SELF-CALIBRATION;
D O I
10.1002/navi.277
中图分类号
V [航空、航天];
学科分类号
08 ; 0825 ;
摘要
The quadratic system provided by the Time of Arrival technique can be solved analytically or by nonlinear least squares minimization. An important problem in quadratic optimization is the possible convergence to a local minimum, instead of the global minimum. This problem does not occur for Global Navigation Satellite Systems (GNSS), due to the known satellite positions. In applications with unknown positions of the reference stations, such as indoor localization with self-calibration, local minima are an important issue. This article presents an approach showing how this risk can be significantly reduced. The main idea of our approach is to transform the local minimum to a saddle point by increasing the number of dimensions. In addition to numerical tests, we analytically prove the theorem and the criteria that no other local minima exist for nontrivial constellations.
引用
下载
收藏
页码:117 / 128
页数:12
相关论文
共 50 条
  • [31] A new accelerating method for global non-convex quadratic optimization with non-convex quadratic constraints
    Wu, Huizhuo
    Zhang, KeCun
    APPLIED MATHEMATICS AND COMPUTATION, 2008, 197 (02) : 810 - 818
  • [32] Beyond Convex Relaxation: A Polynomial-Time Non-Convex Optimization Approach to Network Localization
    Ji, Senshan
    Sze, Kam-Fung
    Zhou, Zirui
    So, Anthony Man-Cho
    Ye, Yinyu
    2013 PROCEEDINGS IEEE INFOCOM, 2013, : 2499 - 2507
  • [33] Improved Portfolio Optimization with Non-convex and Non-concave Cost Using Genetic Algorithms
    Lu, Zhang
    Wang, Xiaoli
    PROCEEDINGS 2013 INTERNATIONAL CONFERENCE ON MECHATRONIC SCIENCES, ELECTRIC ENGINEERING AND COMPUTER (MEC), 2013, : 2567 - 2570
  • [34] STABILITY FOR A CLASS OF NON-CONVEX OPTIMIZATION PROBLEMS
    ZALINESCU, C
    COMPTES RENDUS DE L ACADEMIE DES SCIENCES SERIE I-MATHEMATIQUE, 1988, 307 (12): : 643 - 646
  • [35] AN EFFICIENT ALGORITHM FOR NON-CONVEX SPARSE OPTIMIZATION
    Wang, Yong
    Liu, Wanquan
    Zhou, Guanglu
    JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION, 2019, 15 (04) : 2009 - 2021
  • [36] GloptiNets: Scalable Non-Convex Optimization with Certificates
    Beugnot, Gaspard
    Mairal, Julien
    Rudi, Alessandro
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 36 (NEURIPS 2023), 2023,
  • [37] Variance Reduction for Faster Non-Convex Optimization
    Allen-Zhu, Zeyuan
    Hazan, Elad
    INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 48, 2016, 48
  • [38] EXISTENCE OF SOLUTIONS FOR NON-CONVEX OPTIMIZATION PROBLEMS
    BARANGER, J
    COMPTES RENDUS HEBDOMADAIRES DES SEANCES DE L ACADEMIE DES SCIENCES SERIE A, 1972, 274 (04): : 307 - &
  • [39] Optimization of Non-convex Multiband Cooperative Sensing
    Khwaja, A. S.
    Naeem, M.
    Anpalagan, A.
    Venetsanopoulos, A.
    2014 27TH BIENNIAL SYMPOSIUM ON COMMUNICATIONS (QBSC), 2014, : 61 - 65
  • [40] Lower bounds for non-convex stochastic optimization
    Yossi Arjevani
    Yair Carmon
    John C. Duchi
    Dylan J. Foster
    Nathan Srebro
    Blake Woodworth
    Mathematical Programming, 2023, 199 : 165 - 214