Convex Euclidean distance embedding for collaborative position localization with NLOS mitigation
From MaRDI portal
Publication:2397097
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
Cites work
- scientific article; zbMATH DE number 432498 (Why is no real title available?)
- scientific article; zbMATH DE number 194744 (Why is no real title available?)
- A Lagrangian Dual Approach to the Single-Source Localization Problem
- A convergent 3-block semiproximal alternating direction method of multipliers for conic programming with 4-type constraints
- A cyclic projection algorithm via duality
- A semismooth Newton method for the nearest Euclidean distance matrix problem
- An Alternating Projection Algorithm for Computing the Nearest Euclidean Distance Matrix
- An inexact primal-dual path following algorithm for convex quadratic SDP
- Approximation by matrices positive semidefinite on a subspace
- Comparing SOS and SDP relaxations of sensor network localization
- Computing the nearest Euclidean distance matrix with low embedding dimensions
- Convex Analysis
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Edge-based semidefinite programming relaxation of sensor network localization with lower bound constraints
- Equality relating Euclidean distance cone to positive semidefinite cone
- Exact and Approximate Solutions of Source Localization Problems
- Explicit sensor network localization using semidefinite representations and facial reductions
- Further Relaxations of the Semidefinite Programming Approach to Sensor Network Localization
- Modern multidimensional scaling. Theory and applications.
- Multidimensional scaling.
- NLOS identification and weighted least-squares localization for UWB systems using multipath channel statistics
- Remarks to Maurice Frechet's article ``Sur la definition axiomatique d'une classe d'espaces vectoriels distancies applicables vectoriellement sur l'espace de Hilbert
- Robust Estimation of a Location Parameter
- Robust Statistics
- SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
- Second‐Order Cone Programming Relaxation of Sensor Network Localization
- Solving Euclidean distance matrix completion problems via semidefinite progrmming
- Sparsity-Exploiting Robust Multidimensional Scaling
- Sum of squares method for sensor network localization
Cited in
(6)- An Ordinal Weighted EDM Model for Nonmetric Multidimensional Scaling
- 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
- Ordinal distance metric learning with MDS for image ranking
- A block symmetric Gauss-Seidel decomposition theorem for convex composite quadratic programming and its applications
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)
