An Inexact Smoothing Newton Method for Euclidean Distance Matrix Optimization Under Ordinal Constraints

Abstract

When the coordinates of a set of points are known, the pairwise Euclidean distances among the points can be easily computed. Conversely, if the Euclidean distance matrix is given, a set of coordinates for those points can be computed through the well known classical Multi-Dimensional Scaling (MDS). In this paper, we consider the case where some of the… (More)

Topics

9 Figures and Tables

Cite this paper

@inproceedings{Li2017AnIS, title={An Inexact Smoothing Newton Method for Euclidean Distance Matrix Optimization Under Ordinal Constraints}, author={Qingna Li}, year={2017} }