{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:46:41Z","timestamp":1742914001008,"version":"3.40.3"},"publisher-location":"New York, NY","reference-count":48,"publisher":"Springer New York","isbn-type":[{"type":"print","value":"9781461451273"},{"type":"electronic","value":"9781461451280"}],"license":[{"start":{"date-parts":[[2012,11,3]],"date-time":"2012-11-03T00:00:00Z","timestamp":1351900800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2012,11,3]],"date-time":"2012-11-03T00:00:00Z","timestamp":1351900800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-1-4614-5128-0_13","type":"book-chapter","created":{"date-parts":[[2012,12,14]],"date-time":"2012-12-14T20:20:20Z","timestamp":1355516420000},"page":"225-290","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["DC Programming Approaches for Distance Geometry Problems"],"prefix":"10.1007","author":[{"given":"Hoai An Le","family":"Thi","sequence":"first","affiliation":[]},{"given":"Tao Pham","family":"Dinh","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,11,3]]},"reference":[{"key":"13_CR1","unstructured":"Alfakih, A.Y., Khandani, A., Wolkowicz, H.: An interior-point method for the Euclidean distance matrix completion problem. Research Report CORR 97-9, University of Waterloo, Waterloo, Ontario N2L 3G1, Canada"},{"key":"13_CR2","unstructured":"Blumenthal, L.M.: Theory and Applications of Distance Geometry. Oxford University Press (1953)"},{"key":"13_CR3","volume-title":"Distance Geometry and Molecular Conformation","author":"G.M. Crippen","year":"1988","unstructured":"Crippen, G.M., Havel, T.F.: Distance Geometry and Molecular Conformation. Wiley, New York (1988)"},{"key":"13_CR4","unstructured":"Le Thi H.A.: DC programming and DCA, available on the website http:\/\/lita.sciences.univ-metz.fr\/~lethi\/DCA.html"},{"key":"13_CR5","unstructured":"Demyanov, V.F., Vasilev, L.V.: Nondifferentiable optimization. Optimization Software, Inc. Publications Division, New York (1985)"},{"key":"13_CR6","unstructured":"De\u00a0Leeuw, J.: Applications of convex analysis to multidimensional scaling. In: Barra, J.R., et al. (eds.) Recent Developments in Statistics, pp. 133\u2013145. North-Holland Publishing Company (1977)"},{"key":"13_CR7","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/BF01897162","volume":"5","author":"J. De Leeuw","year":"1988","unstructured":"De Leeuw, J.: Convergence of the majorization method for multidimensional scaling. Journal of Classification 5, 163\u2013180 (1988)","journal-title":"Journal of Classification"},{"issue":"1","key":"13_CR8","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/s11081-008-9072-0","volume":"11","author":"Y. Ding","year":"2010","unstructured":"Ding, Y., Krislock, N., Qian, J., Wolkowicz, H.: Sensor network localization, Euclidean distance matrix completions, and graph realization. Optim. Eng. 11(1), 45\u201366 (2010)","journal-title":"Optim. Eng."},{"issue":"1","key":"13_CR9","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1023\/A:1013857218127","volume":"22","author":"Q. Dong","year":"2002","unstructured":"Dong, Q., Wu, Z.: A linear-time algorithm for solving the molecular distance geometry problem with exact inter-atomic distances. J. Global Optim. 22(1), 365\u2013375 (2002)","journal-title":"J. Global Optim."},{"key":"13_CR10","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/S0098-1354(98)00033-7","volume":"22","author":"C. Floudas","year":"1998","unstructured":"Floudas, C., Adjiman, C.S., Dallwig, S., Neumaier, A.: A global optimization method, \u03b1BB, for general twice differentiable constrained NLPs \u2013 I: theoretical advances. Comput. Chem. Eng. 22, 11\u201337 (1998)","journal-title":"Comput. Chem. Eng."},{"key":"13_CR11","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1002\/jcc.540140115","volume":"14","author":"W. Glunt","year":"1993","unstructured":"Glunt, W., Hayden, T.L., Raydan, M.: Molecular conformation from distance matrices. J. Comput. Chem. 14, 114\u2013120 (1993)","journal-title":"J. Comput. Chem."},{"key":"13_CR12","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/0079-6107(91)90007-F","volume":"56","author":"T.F. Havel","year":"1991","unstructured":"Havel, T.F.: An evaluation of computational strategies for use in the determination of protein structure from distance geometry constraints obtained by nuclear magnetic resonance. Progr. Biophys. Mol. Biol. 56, 43\u201378 (1991)","journal-title":"Progr. Biophys. Mol. Biol."},{"key":"13_CR13","unstructured":"Hendrickson, B.A.: The molecule problem: determining conformation from pairwise distances. Ph.D. thesis, Cornell University, Ithaca, New York (1991)"},{"key":"13_CR14","doi-asserted-by":"publisher","first-page":"835","DOI":"10.1137\/0805040","volume":"5","author":"B.A. Hendrickson","year":"1995","unstructured":"Hendrickson, B.A.: The molecule problem: exploiting structure in global optimization. SIAM J. Optim. 5, 835\u2013857 (1995)","journal-title":"SIAM J. Optim."},{"key":"13_CR15","doi-asserted-by":"crossref","unstructured":"Hirriart\u00a0Urruty, J.B., Lemarechal, C.: Convex Analysis and Minimization Algorithms. Springer, Berlin (1993)","DOI":"10.1007\/978-3-662-02796-7"},{"key":"13_CR16","volume-title":"Some properties for the Euclidean distance matrix and positive semi-Definite matrix completion problems","author":"H.X. Huang","year":"2001","unstructured":"Huang, H.X., Liang, Z.A., Pardalos, P.M.: Some properties for the Euclidean distance matrix and positive semi-Definite matrix completion problems. Department of Industrial and Systems Engineering, University Florida (2001)"},{"key":"13_CR17","first-page":"879","volume-title":"Handbook on Semidefinite","author":"N. Krislock","year":"2012","unstructured":"Krislock, N., Wolkowicz, H.: Euclidean distance matrices and applications. In: Anjos, M.F., Lasserre, J.B. (eds.) Handbook on Semidefinite, Conic and Polynomial Optimization, pp.\u00a0879\u2013914 (2012)"},{"issue":"1\u20133","key":"13_CR18","first-page":"255","volume":"79","author":"M. Laurent","year":"1997","unstructured":"Laurent, M.: Cuts, matrix completions and a graph rigidity. Math. Program. 79(1-3), 255\u2013283 (1997)","journal-title":"Math. Program."},{"key":"13_CR19","unstructured":"Le\u00a0Thi, H.A.: Contribution \u00e0 l\u2019optimisation non convexe et l\u2019optimisation globale: Th\u00e9orie, Algorithmes et Applications. Habilitation \u00e0 Diriger des Recherches, Universit\u00e9 de Rouen, Juin (1997)"},{"key":"13_CR20","doi-asserted-by":"crossref","unstructured":"Le\u00a0Thi, H.A., Le\u00a0Hoai, M., Nguyen, V.V., Pham\u00a0Dinh, T.: A DC Programming approach for Feature Selection in Support Vector Machines learning. Journal of Advances in Data Analysis and Classification 2(3), 259\u2013278 (2008)","DOI":"10.1007\/s11634-008-0030-7"},{"key":"13_CR21","doi-asserted-by":"crossref","unstructured":"Le\u00a0Thi, H.A., Pham\u00a0Dinh, T.: Solving a class of linearly constrained indefinite quadratic problems by d.c. algorithms. J. Global Optim. 11, 253\u2013285 (1997)","DOI":"10.1023\/A:1008288411710"},{"key":"13_CR22","doi-asserted-by":"crossref","unstructured":"Le\u00a0Thi, H.A., Pham\u00a0Dinh, T.: D.c. programming approach for large scale molecular optimization via the general distance geometry problem. In: Floudas, C.A., Pardalos, P.M. (eds.) Optimization in Computational Chemistry and Molecular Biology: Local and Global Approaches, pp. 301\u2013339. Kluwer Academic Publishers (2000)","DOI":"10.1007\/978-1-4757-3218-4_18"},{"key":"13_CR23","doi-asserted-by":"crossref","unstructured":"Le\u00a0Thi, H.A., Pham\u00a0Dinh, T.: Large scale molecular optimization from distance matrices by a d.c.\u00a0optimization approach. SIAM J. Optim. 14(1), 77\u2013114 (2003)","DOI":"10.1137\/S1052623498342794"},{"key":"13_CR24","unstructured":"Le\u00a0Thi, H.A., Pham\u00a0Dinh, T.: A new algorithm for solving large scale molecular distance geometry problems. special issue of Applied Optimization, HighPerformance Algorithms and Software for Nonlinear Optimization, pp. 279\u2013296. Kluwer Academic Publishers (2003)"},{"issue":"4","key":"13_CR25","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1023\/A:1026016804633","volume":"27","author":"H.A. Le Thi","year":"2003","unstructured":"Le\u00a0Thi, H.A.: Solving large scale molecular distance geometry problems by a smoothing technique via the gaussian transform and d.c.\u00a0programming. J. Global Optim. 27(4), 375\u2013397 (2003)","journal-title":"J. Global Optim."},{"key":"13_CR26","doi-asserted-by":"crossref","unstructured":"Le\u00a0Thi, H.A., Pham\u00a0Dinh, T.: The DC programming and DCA revisited with DC models of real world nonconvex optimization problems. Ann. Oper. Res. 133, 23\u201346 (2005)","DOI":"10.1007\/s10479-004-5022-1"},{"key":"13_CR27","unstructured":"Le\u00a0Thi, H.A., Pham\u00a0Dinh, T., Huynh, V.N.: Convergence analysis of DC algorithm for DC programming with subanalytic data. Research Report, National Institute for Applied Sciences (2009)"},{"issue":"1","key":"13_CR28","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1111\/j.1475-3995.2007.00622.x","volume":"15","author":"L. Liberti","year":"2008","unstructured":"Liberti, L., Lavor, C., Maculan, N.: A branch-and-prune algorithm for the molecular distance geometry problem. Int. Trans. Oper. Res. 15(1), 1\u201317 (2008)","journal-title":"Int. Trans. Oper. Res."},{"key":"13_CR29","doi-asserted-by":"crossref","unstructured":"Mahey, P., Pham\u00a0Dinh, T.: Partial regularization of the sum of two maximal monotone operators. Math. Model. Numer. Anal. (M\n                2\n                AN) 27, 375\u2013395 (1993)","DOI":"10.1051\/m2an\/1993270303751"},{"key":"13_CR30","doi-asserted-by":"crossref","unstructured":"Mahey, P., Pham\u00a0Dinh, T.: Proximal decomposition of the graph of maximal monotone operator. SIAM J. Optim. 5, 454-468 (1995)","DOI":"10.1137\/0805023"},{"key":"13_CR31","doi-asserted-by":"publisher","first-page":"814","DOI":"10.1137\/S1052623495283024","volume":"8","author":"J.J. Mor\u00e9","year":"1997","unstructured":"Mor\u00e9, J.J., Wu, Z.: Global continuation for distance geometry problems. SIAM J. Optim. 8, 814\u2013836 (1997)","journal-title":"SIAM J. Optim."},{"key":"13_CR32","unstructured":"Mor\u00e9, J.J., Wu, Z.: Issues in large-scale molecular optimization. preprint MCS-P539-1095, Argonne National Laboratory, Argonne, Illinois 60439, March 1996"},{"key":"13_CR33","unstructured":"Mor\u00e9, J.J., Wu, Z.: Distance geometry optimization for protein structures. preprint MCS-P628-1296, Argonne National Laboratory, Argonne, Illinois 60439, December 1996"},{"key":"13_CR34","unstructured":"Pham\u00a0Dinh, T.: Contribution \u00e0 la th\u00e9orie de normes et ses applications \u00e0 l\u2019analyse num\u00e9rique. Th\u00e8se de Doctorat d\u2019Etat Es Science, Universit\u00e9 Joseph Fourier-Grenoble (1981)"},{"key":"13_CR35","doi-asserted-by":"crossref","unstructured":"Pham\u00a0Dinh, T.: Convergence of subgradient method for computing the bound norm of matrices. Lin. Algebra. Appl. 62, 163\u2013182 (1984)","DOI":"10.1016\/0024-3795(84)90093-4"},{"key":"13_CR36","doi-asserted-by":"crossref","unstructured":"Pham\u00a0Dinh, T.: Algorithmes de calcul d\u2019une forme quadratique sur la boule unit\u00e9 de la norme maximum. Numer. Math. 45, 377\u2013440 (1985)","DOI":"10.1007\/BF01391415"},{"key":"13_CR37","unstructured":"Pham\u00a0Dinh, T.: Algorithms for solving a class of non convex optimization problems. Methods of subgradients. Mathematics for Optimization, Elsevier Science Publishers B.V., North-Holland (1986)"},{"key":"13_CR38","doi-asserted-by":"crossref","unstructured":"Pham\u00a0Dinh, T.: Duality in d.c. (difference of convex functions) optimization. Subgradient methods. Trends in Mathematical Optimization, International Series of Numer Math., vol. 84, pp. 277\u2013293. Birkh\u00e4user (1988)","DOI":"10.1007\/978-3-0348-9297-1_18"},{"key":"13_CR39","unstructured":"Pham\u00a0Dinh, T., Le\u00a0Thi, H.A.: Stabilit\u00e9 de la dualit\u00e9 lagrangienne en optimisation d.c. (diff\u00e9rence de deux fonctions convexes). C.R.\u00a0Acad.\u00a0Paris, t.318, S\u00e9rie I, pp. 379\u2013384 (1994)"},{"key":"13_CR40","first-page":"289","volume":"22","author":"T. Pham Dinh","year":"1997","unstructured":"Pham\u00a0Dinh, T., Le Thi, H.A.: Convex analysis approach to d.c. programming: Theory, Algorithms and Applications (dedicated to Professor Hoang Tuy on the occasion of his 70th birthday). Acta Mathematica Vietnamica 22, 289\u2013355 (1997)","journal-title":"Acta Mathematica Vietnamica"},{"key":"13_CR41","doi-asserted-by":"crossref","unstructured":"Pham\u00a0Dinh, T., Le\u00a0Thi, H.A.: D.c.\u00a0optimization algorithms for solving the trust region subproblem. SIAM J. Optim. 8, 476\u2013505 (1998)","DOI":"10.1137\/S1052623494274313"},{"issue":"4","key":"13_CR42","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1007\/s10898-009-9507-y","volume":"48","author":"T. Pham Dinh","year":"2010","unstructured":"Pham\u00a0Dinh, T., Nguyen, C.N., Le\u00a0Thi, H.A.: An efficient combined DCA and B&B using DC\/SDP relaxation for globally solving binary quadratic programs. J. Global Optim. 48(4), 595\u2013632 (2010)","journal-title":"J. Global Optim."},{"key":"13_CR43","unstructured":"Polyak, B.: Introduction to optimization. Optimization Software, Inc. Publications Division, New York (1987)"},{"key":"13_CR44","doi-asserted-by":"crossref","DOI":"10.1515\/9781400873173","volume-title":"Convex Analysis","author":"R.T. Rockafellar","year":"1970","unstructured":"Rockafellar, R.T.: Convex Analysis. Princeton University, Princeton (1970)"},{"key":"13_CR45","unstructured":"Saxe, J.B.: Embeddability of weighted Graphs in k-space is strongly NP-hard. In: Proceedings of the 17th Allerton Conference in Communications, Control and Computing, pp. 480\u2013489 (1979)"},{"issue":"6","key":"13_CR46","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1016\/j.orl.2011.07.007","volume":"39","author":"M. Souza","year":"2011","unstructured":"Souza, M., Xavier, A.E., Lavor, C., Maculan, N.: Hyperbolic smoothing and penalty techniques applied to molecular structure determination. Oper. Res. Lett. 39(6), 461\u2013465 (2011)","journal-title":"Oper. Res. Lett."},{"key":"13_CR47","unstructured":"Varga, R.: Matrix Iterative Analysis. Prentice Hall (1962)"},{"key":"13_CR48","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1023\/A:1008244930007","volume":"11","author":"Z. Zou","year":"1997","unstructured":"Zou, Z., Richard, H.B., Schnabel, R.B.: A stochastic\/pertubation global optimization algorithm for distance geometry problems. J. Global Optim. 11, 91\u2013105 (1997)","journal-title":"J. Global Optim."}],"container-title":["Distance Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4614-5128-0_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,13]],"date-time":"2023-02-13T10:53:50Z","timestamp":1676285630000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-1-4614-5128-0_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,11,3]]},"ISBN":["9781461451273","9781461451280"],"references-count":48,"URL":"https:\/\/doi.org\/10.1007\/978-1-4614-5128-0_13","relation":{},"subject":[],"published":{"date-parts":[[2012,11,3]]},"assertion":[{"value":"3 November 2012","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}