A semidefinite programming approach for robust elliptic localization

DOI10.1016/J.JFRANKLIN.2024.107237MaRDI QIDQ7032843zbMATH OpenFDO

Authors Wenxin Xiong, Yuming Chen, J. He, Zhanglei Shi, Keyuan Hu, H. C. So, Chi-Sing Leung

Publication date 4 February 2025

Published in Journal of the Franklin Institute (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.JFRANKLIN.2024.107237

zbMATH Keywords

Gaussian mixture noisemin-max optimizationrobust elliptic localizationsemidefinite programmingworst-case

Mathematics Subject Classification ID

Semidefinite programming (90C22) Minimax problems in mathematical programming (90C47)

Cites work

• \(\ell_p\)-norm minimization for outlier-resistant elliptic positioning in \(\alpha\)-stable impulsive interference
• A new approximate algorithm for the Chebyshev center
• Elliptic Localization: Performance Study and Optimum Receiver Placement
• scientific article; zbMATH DE number 2107836 (Why is no real title available?)
• Lagrange Programming Neural Network Approach for Target Localization in Distributed MIMO Radar
• Outlier-Robust Matrix Completion via $\ell _p$ -Minimization
• Robust Convex Approximation Methods for TDOA-Based Localization Under NLOS Conditions
• Robust statistics for signal processing
• Target localization in distributed MIMO radars via improved semidefinite relaxation

This page was built for publication: A semidefinite programming approach for robust elliptic localization

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