Skip to main navigation Skip to search Skip to main content

A Provably Convergent Block MM Algorithm for Range-based Multistatic Target Localization with Partial Transmitter Cooperation

  • Wenxin Xiong
  • , Meng Xu*
  • , Ge Cheng
  • , Hing Cheung So
  • *Corresponding author for this work

Research output: Journal Publications and ReviewsRGC 21 - Publication in refereed journalpeer-review

Abstract

This article focuses on locating a reflecting target using both bistatic and direct range measurements derived from the propagation delays of signals emitted by a transmitter with unknown position and received by spatially separated sensors with known positions. Addressing such a localization task is crucial for certain practical applications of multistatic systems, notably in the use of mobile units, hastily deployed nodes, or semi-cooperative illuminators of opportunity as sources of transmission. In the sense of maximum likelihood estimation, the problem lends itself to a formulation under the weighted nonlinear least squares (WNLS) framework. Beyond the challenge posed by nonconvexity, tackling the WNLS problem is inherently nontrivial as the squared residuals involve sums and differences of the Euclidean norm terms. To make the optimization more tractable, several approximations are employed, including a strategic two-block partitioning of variables and a series of proper upper-bounding functions for the corresponding subproblem objectives. They enable the development of an efficient block majorization–minimization algorithm, which admits closed-form updates at each iteration. Theoretically, we establish the convergence of the algorithm, confirming that every limit point of the generated iterates is a stationary point of the WNLS localization problem. We also present an analysis of the algorithmic complexity, and discuss how correlated noise may affect our approach. Simulations demonstrate the potential of the proposed method to attain higher positioning accuracy than the existing algebraic and semidefinite programming solutions, while being computationally lighter than the latter.

© 2026 IEEE. All rights reserved, including rights for text and data mining and training of artificial intelligence and similar technologies. Personal use is permitted, but republication/redistribution requires IEEE permission.
Original languageEnglish
Number of pages17
JournalIEEE Transactions on Mobile Computing
DOIs
Publication statusOnline published - 9 Apr 2026

Funding

This study was supported by the Open Project Program of Innovation Base for Monitoring, Evaluation, and Early Warning Technology of Territorial Space Ecological Restoration in the Southern Hilly and Mountainous Region of China, Chinese Geological Society (Grant No. CSZX-JD202502).

Research Keywords

  • block majorization–minimization
  • convergence
  • maximum likelihood
  • Multistatic target localization
  • unknown transmitter position
  • weighted nonlinear least squares

Fingerprint

Dive into the research topics of 'A Provably Convergent Block MM Algorithm for Range-based Multistatic Target Localization with Partial Transmitter Cooperation'. Together they form a unique fingerprint.

Cite this