IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v413y2022ics0096300321007335.html
   My bibliography  Save this article

Uniqueness and nonuniqueness for the L1 minimization source localization problem with three measurements

Author

Listed:
  • Kwon, Kiwoon

Abstract

The source localization problem has been studied by many researchers and applied to a wide range of areas including Global Positioning System (GPS) localization. Although there have been studies examining closed form solutions for cases with not so large noise, only the existence of local solution in L2 minimization settings is known. In this paper, L1 minimization with three measurements is studied, and nonuniqueness examples for the minimization are provided. Futher, the uniqueness of the solution in certain conditions is stated and proven. The proof is based on the analysis for the extreme points of the objective function. The singular points are the three source points and the three measurement circles. The critical points are the Fermat point and some points located inside of one measurement circle and outside two other circles. The numbers of the latter critical points are infinite for the equilateral measurement triangle and one for nonequilateral measurement triangle. The analysis for these critical points is also provided. Finally, a few numerical implementations are provided to clarify the uniqueness and nonuniqueness of the problem.

Suggested Citation

  • Kwon, Kiwoon, 2022. "Uniqueness and nonuniqueness for the L1 minimization source localization problem with three measurements," Applied Mathematics and Computation, Elsevier, vol. 413(C).
    • Handle: RePEc:eee:apmaco:v:413:y:2022:i:c:s0096300321007335
    DOI: 10.1016/j.amc.2021.126649
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300321007335
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2021.126649?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Kwon, Kiwoon, 2022. "Exact solutions for source localization problem with minimal squared distance error," Applied Mathematics and Computation, Elsevier, vol. 427(C).

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:apmaco:v:413:y:2022:i:c:s0096300321007335. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.