Multi-dimensional scaling from \(K\)-nearest neighbourhood distances

DOI10.1007/s10915-024-02662-7zbMATH Open1547.65037MaRDI QIDQ6608081

Jia Li, Wenjian Du

Publication date: 19 September 2024

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

zbMATH Keywords

semi-definite programminglow-rank matrix completionmultidimensional scaling\(K\)-nearest neighborhood

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
• Some empirical advances in matrix completion
• Low rank matrix completion by alternating steepest descent methods
• Convex multi-task feature learning
• Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm
• Multidimensional scaling. I: Theory and method
• Guarantees of Riemannian Optimization for Low Rank Matrix Recovery
• Low-Rank Matrix Completion by Riemannian Optimization
• Eigenvector synchronization, graph rigidity and the molecule problem
• A Singular Value Thresholding Algorithm for Matrix Completion
• Image Processing and Data Analysis
• On the Goldstein-Levitin-Polyak gradient projection method
• On the rank minimization problem over a positive semidefinite linear matrix inequality
• Calibration Using Matrix Completion With Application to Ultrasound Tomography
• Localization From Incomplete Euclidean Distance Matrix: Performance Analysis for the SVD–MDS Approach
• The Power of Convex Relaxation: Near-Optimal Matrix Completion
• Solving Partial Differential Equations on Manifolds From Incomplete Interpoint Distance

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