Nonlinear mapping and distance geometry - Archive ouverte HAL Access content directly
Journal Articles Optimization Letters Year : 2020

Nonlinear mapping and distance geometry

(1, 2) , (3) , (3)
1
2
3

Abstract

Distance Geometry Problem (DGP) and Nonlinear Mapping (NLM) are two well established questions: DGP is about finding a Euclidean realization of an incomplete set of distances in a Euclidean space, whereas Nonlinear Mapping is a weighted Least Square Scaling (LSS) method. We show how all these methods (LSS, NLM, DGP) can be assembled in a common framework, being each identified as an instance of an optimization problem with a choice of a weight matrix. We study the continuity between the solutions (which are point clouds) when the weight matrix varies, and the compactness of the set of solutions (after centering). We finally study a numerical example, showing that solving the optimization problem is far from being simple and that the numerical solution for a given procedure may be trapped in a local minimum.

Dates and versions

hal-02124882 , version 1 (10-05-2019)

Identifiers

Cite

Alain Franc, Pierre Blanchard, Olivier Coulaud. Nonlinear mapping and distance geometry. Optimization Letters, 2020, 14 (2), pp.453-467. ⟨10.1007/s11590-019-01431-y⟩. ⟨hal-02124882⟩
83 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More