Uniqueness and nonuniqueness for the L^1 minimization source localization problem with three measurements

DOI10.1016/J.AMC.2021.126649MaRDI QIDQ2246497zbMATH OpenOpenAlexFDO

Authors Kiwoon Kwon

Publication date 16 November 2021

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.amc.2021.126649

zbMATH Keywords

Fermat pointGPSmeasurement circlesource localization

Mathematics Subject Classification ID

Real and complex geometry (51Mxx) Mathematical programming (90Cxx) Communication, information (94Axx)

Recommendations

• Exact solutions for source localization problem with minimal squared distance error
• Iterative Minimization Schemes for Solving the Single Source Localization Problem
• A simple globally convergent algorithm for the nonsmooth nonconvex single source localization problem
• On unique localization of constrained-signals sources
• Localization of Moving Sources: Uniqueness, Stability, and Bayesian Inference

Cites work

• A note on Fermat's problem
• Exact and Approximate Solutions of Source Localization Problems
• Iterative Minimization Schemes for Solving the Single Source Localization Problem
• Least Squares Algorithms for Time-of-Arrival-Based Mobile Location
• On the solution of the GPS localization and circle fitting problems
• The Generalized Fermat's Point

Cited in

(3)

• Exact solutions for source localization problem with minimal squared distance error
• Iterative Minimization Schemes for Solving the Single Source Localization Problem
• Global strong convexity and characterization of critical points of time-of-arrival-based source localization

This page was built for publication: Uniqueness and nonuniqueness for the \(L^1\) minimization source localization problem with three measurements

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2246497)