Molecular conformations from distance matrices
Journal of Computational Chemistry
The Euclidian Distance Matrix Completion Problem
SIAM Journal on Matrix Analysis and Applications
A limited memory algorithm for bound constrained optimization
SIAM Journal on Scientific Computing
An Interior-Point Method for Approximate Positive Semidefinite Completions
Computational Optimization and Applications
Algorithm 611: Subroutines for Unconstrained Minimization Using a Model/Trust-Region Approach
ACM Transactions on Mathematical Software (TOMS)
Adequateness and interpretability of objective functions in ordinal data analysis
Journal of Multivariate Analysis
Variable precision rough set for group decision-making: An application
International Journal of Approximate Reasoning
Sensitivity analysis of the strain criterion for multidimensional scaling
Computational Statistics & Data Analysis
Projected Landweber iteration for matrix completion
Journal of Computational and Applied Mathematics
An SDP-Based Divide-and-Conquer Algorithm for Large-Scale Noisy Anchor-Free Graph Realization
SIAM Journal on Scientific Computing
A group decision-making model of risk evasion in software project bidding based on VPRS
RSFDGrC'05 Proceedings of the 10th international conference on Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing - Volume Part II
Hi-index | 0.00 |
Consider the problem of determining whether or not a partial dissimilarity matrix can be completed to a Euclidean distance matrix. The dimension of the distance matrix may be restricted and the known dissimilarities may be permitted to vary subject to bound constraints. This problem can be formulated as an optimization problem for which the global minimum is zero if and only if completion is possible. The optimization problem is derived in a very natural way from an embedding theorem in classical distance geometry and from the classical approach to multidimensional scaling. It belongs to a general family of problems studied by Trosset (Technical Report 97-3, Department of Computational & Applied Mathematics—MS 134, Rice University, Houston, TX 77005-1892, 1997) and can be formulated as a nonlinear programming problem with simple bound constraints. Thus, this approach provides a constructive technique for obtaining approximate solutions to a general class of distance matrix completion problems.