Skip to main content
SpringerLink
Log in

Nonlinear mapping and distance geometry

  • Original Paper
  • Published:
Optimization Letters Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1

Similar content being viewed by others

Notes

  1. In such a case, strictly speaking, the matrix built from the pairwise distances is not a Gram matrix.

  2. It is unfortunate that least-square scaling has been proposed with the same name MDS than classical MDS. However, classical texts such as [1, 6, 13] are clear on this matter and agree on setting the vocabulary.

  3. Here, it is known as part of the problem that the distances are taken between points living in a Euclidean space, whereas in NLM, such an hypothesis is not required.

  4. Rigorously, one should replace \(|X'-X|<\epsilon \) by: there exists an \(X'\) in the set of solutions for \(\varOmega '\) such that \(|X'-X|<\epsilon \).

References

  1. Cox, T., Cox, M.A.A.: Multidimensional Scaling - Second edition, Monographs on Statistics and Applied Probability, vol. 88. Chapman & Hall (2001)

  2. Cristianini, N., Shawe-Taylor, J.: An Introduction to Support Vector Machines and Other Kernel-Based Learning Methods. Cambridge University Press, Cambridge (2000)

    Book  Google Scholar 

  3. Glunt, W., Hayden, T.L., Raydan, M.: Molecular conformations from distance matrices. J. Comput. Chem. 14(1), 114–120 (1993)

    Article  Google Scholar 

  4. Gusfield, D.: Algorithms on Strings, Trees, and Sequences. Cambridge University Press, Cambridge (1997)

    Book  Google Scholar 

  5. Hillis, D.M., Moritz, C., Mable, B.: Molecular Systematics. Sinauer, Sunderland (1996)

    Google Scholar 

  6. Izenman, A.J.: Modern Multivariate Statistical Techniques. Springer, New York (2008)

    Book  Google Scholar 

  7. Krantz, S.G., Parks, H.R.: Geometric Integration Theory. Birkaüser, Boston (2008)

    Book  Google Scholar 

  8. Kruskal, J.B.: Non metric multidimensional scaling: a numerical approach. Psychometrika 29(2), 115–129 (1964)

    Article  MathSciNet  Google Scholar 

  9. Le Thi, H.A., Pham Dinh, T.: DC programming approaches for distance geometry problems, chap. 13 in distance geometry. In: Mucherino, (ed.) Theory, Methods and Applications, pp. 225–290. Springer, New York (2013)

  10. Lee, J.A., Verleysen, M.: Nonlinear Dimensionality Reduction. Springer, New York (2007)

    Book  Google Scholar 

  11. Liberti, L., D’Ambrosio, C.: The isomap algorithm in distance geometry. In: Iliopoulos, C.S., Pissis, S.P., Puglisi, S.J., Raman, R. (eds.) 16th International Symposium on Experimental Algorithms (SEA 2017). pp. 5:1–5:13. Leibniz International Proceedings in Informatics (2017)

  12. Liberti, L., Lavor, C., Maculan, N., Mucherino, A.: Euclidean distance geometry and applications. SIAM Rev. 56(1), 3–69 (2014)

    Article  MathSciNet  Google Scholar 

  13. Mardia, K.V., Kent, J., Bibby, J.M.: Multivariate Analysis. Probability and Mathematical Statistics. Academic Press, London (1979)

    MATH  Google Scholar 

  14. Moré, J.J., Wu, Z.: Global continuation for distance geometry problems. SIAM J. Optim. 7(3), 814–836 (1997)

    Article  MathSciNet  Google Scholar 

  15. Mucherino, A., Gonçalves, D.A.: An approach to dynamical distance geometry, Lecture Notes in Computer Science, vol. 10589, chap. In: Proceedings of Geometric Science of Information (GSI17), Paris, France, F. Nielsen & F. Barbaresco (eds.), pp. 821–829 (2017)

  16. Mucherino, A., Lavor, C., Liberti, L., Maculan, N. (eds.): Distance Geometry. Springer, New York (2013)

    MATH  Google Scholar 

  17. Sammon, J.W.: A nonlinear mapping algorithm for data structure analysis. IEEE Trans. Comput. 18(5), 401–409 (1969)

    Article  Google Scholar 

  18. Saxe, J.B.: Embeddability of weighted graphs in k-space is strongly NP-hard. In: 17th Allerton Conference in Communication Control and Computing, pp. 480–489 (1979)

  19. Tennenbaum, J.B., de Silva, B., Langford, J.C.: A global geometric framework for nonlinear dimensionality reduction. Science 290, 2319–2323 (2000)

    Article  Google Scholar 

  20. Torgerson, W.S.: Multidimensional scaling: I. Theory and method. Psychometrika 17(4), 401–419 (1952)

    Article  MathSciNet  Google Scholar 

  21. Wales, D.J., Doye, J.P.K.: Global optimization by basin-hopping and the lowest energy structures of Lennard-Jones clusters containing up to 110 atoms. J. Phys. Chem. A 101, 5111–5116 (1997)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. BioGeCo, INRA, Univ. Bordeaux, Cestas, France

    Alain Franc & Pierre Blanchard

  2. HiePACS, Inria Bordeaux - Sud-Ouest, 200, rue Vieille Tour, 33405, Talence CEDEX, France

    Pierre Blanchard & Olivier Coulaud

  3. Pleiade, Inria Bordeaux- Sud-Ouest, 200, rue Vieille Tour, 33405, Talence CEDEX, France

    Alain Franc

Authors
  1. Alain Franc
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Pierre Blanchard
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Olivier Coulaud
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Alain Franc.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Franc, A., Blanchard, P. & Coulaud, O. Nonlinear mapping and distance geometry. Optim Lett 14, 453–467 (2020). https://doi.org/10.1007/s11590-019-01431-y

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11590-019-01431-y

Keywords

Search

Navigation