A facial reduction approach for the single source localization problem
From MaRDI portal
Publication:6064050
DOI10.1007/s10898-022-01188-2zbMath1528.90141arXiv2110.00757OpenAlexW3203247648MaRDI QIDQ6064050
Publication date: 8 November 2023
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2110.00757
Euclidean distance matrixconstraint nondegeneracyfacial reductionsingle source localizationmajorized penalty approach
Cites Work
- Unnamed Item
- Unnamed Item
- Solving semidefinite-quadratic-linear programs using SDPT3
- Computing the nearest Euclidean distance matrix with low embedding dimensions
- A remark on the faces of the cone of Euclidean distance matrices
- Theory of semidefinite programming for sensor network localization
- On certain linear mappings between inner-product and squared-distance matrices
- Theory of cones
- Regularizing the abstract convex program
- An exact duality theory for semidefinite programming and its complexity implications
- On the cone of positive semidefinite matrices
- Circum-Euclidean distance matrices and faces
- Noisy Euclidean distance matrix completion with a single missing node
- Feasibility and a fast algorithm for Euclidean distance matrix optimization with ordinal constraints
- Robust principal component analysis using facial reduction
- Faces of the cone of Euclidean distance matrices: characterizations, structure and induced geometry
- Nonmetric multidimensional scaling. A numerical method
- Remarks to Maurice Frechet's article ``Sur la definition axiomatique d'une classe d'espaces vectoriels distancies applicables vectoriellement sur l'espace de Hilbert
- Euclidean Distance Matrices and Applications
- Iterative Minimization Schemes for Solving the Single Source Localization Problem
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Euclidean Distance Matrices and Their Applications in Rigidity Theory
- Exact and Approximate Solutions of Source Localization Problems
- A Lagrangian Dual Approach to the Single-Source Localization Problem
- A Fast Matrix Majorization-Projection Method for Penalized Stress Minimization With Box Constraints
- SDPNAL+: A Matlab software for semidefinite programming with bound constraints (version 1.0)
- Exploiting Sparsity in SDP Relaxation for Sensor Network Localization
- Constrained Best Euclidean Distance Embedding on a Sphere: A Matrix Optimization Approach
- Coordinate Shadows of Semidefinite and Euclidean Distance Matrices
- A Semismooth Newton Method for the Nearest Euclidean Distance Matrix Problem
- The Strong Second-Order Sufficient Condition and Constraint Nondegeneracy in Nonlinear Semidefinite Programming and Their Implications
- Convex Analysis
This page was built for publication: A facial reduction approach for the single source localization problem
