Convex Euclidean distance embedding for collaborative position localization with NLOS mitigation
From MaRDI portal
Publication:2397097
DOI10.1007/S10589-016-9858-5zbMATH Open1369.90120OpenAlexW2465368474MaRDI QIDQ2397097FDOQ2397097
Publication date: 29 May 2017
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://eprints.soton.ac.uk/396745/1/NLOS_Revised.pdf
Recommendations
- Feasibility and a fast algorithm for Euclidean distance matrix optimization with ordinal constraints
- Sensor network localization, Euclidean distance matrix completions, and graph realization
- Computing the nearest Euclidean distance matrix with low embedding dimensions
- Euclidean distance matrices and applications
- (Robust) edge-based semidefinite programming relaxation of sensor network localization
augmented LagrangianEuclidean distance matrixalternating direction method of multipliers (ADMM)collaborative localizationnon-line of sight (NLOS)
Cites Work
- SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- Modern multidimensional scaling. Theory and applications.
- Robust Estimation of a Location Parameter
- Explicit Sensor Network Localization using Semidefinite Representations and Facial Reductions
- Title not available (Why is that?)
- Title not available (Why is that?)
- Robust Statistics
- Convex Analysis
- Remarks to Maurice Frechet's article ``Sur la definition axiomatique d'une classe d'espaces vectoriels distancies applicables vectoriellement sur l'espace de Hilbert
- Multidimensional scaling.
- A Convergent 3-Block SemiProximal Alternating Direction Method of Multipliers for Conic Programming with 4-Type Constraints
- An Alternating Projection Algorithm for Computing the Nearest Euclidean Distance Matrix
- Equality relating Euclidean distance cone to positive semidefinite cone
- Sum of squares method for sensor network localization
- An inexact primal-dual path following algorithm for convex quadratic SDP
- A cyclic projection algorithm via duality
- Approximation by matrices positive semidefinite on a subspace
- Computing the nearest Euclidean distance matrix with low embedding dimensions
- Solving Euclidean distance matrix completion problems via semidefinite progrmming
- Further Relaxations of the Semidefinite Programming Approach to Sensor Network Localization
- Second‐Order Cone Programming Relaxation of Sensor Network Localization
- Exact and Approximate Solutions of Source Localization Problems
- A Semismooth Newton Method for the Nearest Euclidean Distance Matrix Problem
- Comparing SOS and SDP relaxations of sensor network localization
- Edge-based semidefinite programming relaxation of sensor network localization with lower bound constraints
- A Lagrangian Dual Approach to the Single-Source Localization Problem
- NLOS identification and weighted least-squares localization for UWB systems using multipath channel statistics
- Sparsity-Exploiting Robust Multidimensional Scaling
Cited In (6)
- An Ordinal Weighted EDM Model for Nonmetric Multidimensional Scaling
- Ordinal Distance Metric Learning with MDS for Image Ranking
- Matrix optimization based Euclidean embedding with outliers
- Feasibility and a fast algorithm for Euclidean distance matrix optimization with ordinal constraints
- A Euclidean distance matrix model for protein molecular conformation
- A block symmetric Gauss-Seidel decomposition theorem for convex composite quadratic programming and its applications
Uses Software
This page was built for publication: Convex Euclidean distance embedding for collaborative position localization with NLOS mitigation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2397097)
