Distance matrix completion by numerical optimization

DOI10.1023/A:1008722907820MaRDI QIDQ1588838zbMATH OpenOpenAlexFDO

Authors 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 completionmultidimensional scalingEuclidean distance matricespositive semidefinite matricesdistance geometry

Mathematics Subject Classification ID

Inverse problems in linear algebra (15A29)

Recommendations

• Euclidean distance matrix completion problems
• Approximate and exact completion problems for Euclidean distance matrices using semidefinite programming
• Extensions of classical multidimensional scaling via variable reduction
• The Euclidian Distance Matrix Completion Problem
• Some properties for the Euclidean distance matrix and positive semidefinite matrix completion problems

Cited in

(20)

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

Describes a project that uses

Uses Software

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

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

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