Distance matrix completion by numerical optimization

DOI10.1023/A:1008722907820zbMath0964.65047OpenAlexW1490549637MaRDI QIDQ1588838

Michael W. Trosset

Publication date: 3 April 2001

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1008722907820

zbMATH Keywords

matrix completiondistance geometryEuclidean distance matricespositive semidefinite matricesmultidimensional scaling

Mathematics Subject Classification ID

Related Items (16)

Euclidean distance matrix completion problems ⋮ Theory of semidefinite programming for sensor network localization ⋮ An approximation theory of matrix rank minimization and its application to quadratic equations ⋮ On the uniqueness of Euclidean distance matrix completions. ⋮ A new approximation of the matrix rank function and its application to matrix rank minimization ⋮ Conditional quadratic semidefinite programming: examples and methods ⋮ Sensitivity analysis of the strain criterion for multidimensional scaling ⋮ Variable precision rough set for group decision-making: an application ⋮ Projected Landweber iteration for matrix completion ⋮ Adequateness and interpretability of objective functions in ordinal data analysis ⋮ On the uniqueness of Euclidean distance matrix completions: the case of points in general position ⋮ An efficient method for convex constrained rank minimization problems based on DC programming ⋮ Euclidean Distance Matrix Completion and Point Configurations from the Minimal Spanning Tree ⋮ An alternating direction method for solving convex nonlinear semidefinite programming problems ⋮ ROP: matrix recovery via rank-one projections ⋮ Extensions of classical multidimensional scaling via variable reduction

Uses Software

• L-BFGS-B
• L-BFGS
• Algorithm 611

This page was built for publication: Distance matrix completion by numerical optimization