Multi-dimensional scaling from K-nearest neighbourhood distances

DOI10.1007/S10915-024-02662-7MaRDI QIDQ6608081zbMATH OpenFDO

Authors Wenjian Du, Jia Li

Publication date 19 September 2024

Published in Journal of Scientific Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10915-024-02662-7

zbMATH Keywords

\(K\)-nearest neighborhoodlow-rank matrix completionmultidimensional scalingsemi-definite programming

Mathematics Subject Classification ID

Matrix completion problems (15A83) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical methods for low-rank matrix approximation; matrix compression (65F55) Numerical mathematical programming methods (65K05)

Recommendations

• A globally convergent inertial first-order optimization method for multidimensional scaling
• Central limit theorems for classical multidimensional scaling
• Subspace Least Squares Multidimensional Scaling
• Multigrid multidimensional scaling
• A dual basis approach to multidimensional scaling

Cites work

• A Singular Value Thresholding Algorithm for Matrix Completion
• Calibration Using Matrix Completion With Application to Ultrasound Tomography
• Convex multi-task feature learning
• Distributed optimization and statistical learning via the alternating direction method of multipliers
• Eigenvector synchronization, graph rigidity and the molecule problem
• Guarantees of Riemannian optimization for low rank matrix recovery
• scientific article; zbMATH DE number 699389 (Why is no real title available?)
• Image Processing and Data Analysis
• Localization From Incomplete Euclidean Distance Matrix: Performance Analysis for the SVD–MDS Approach
• Low rank matrix completion by alternating steepest descent methods
• Low-rank matrix completion by Riemannian optimization
• Multidimensional scaling. I: Theory and method
• On the Goldstein-Levitin-Polyak gradient projection method
• On the rank minimization problem over a positive semidefinite linear matrix inequality
• Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm
• Solving partial differential equations on manifolds from incomplete interpoint distance
• Some empirical advances in matrix completion
• The Power of Convex Relaxation: Near-Optimal Matrix Completion

This page was built for publication: Multi-dimensional scaling from \(K\)-nearest neighbourhood distances

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