A semismooth Newton method for the nearest euclidean distance matrix problem

SIAM Journal on Matrix Analysis and Applications

Volumn 34, Issue 1, 2012, Pages 67-93

  Qi, Hou Duo ^a  

^a UNIVERSITY OF SOUTHAMPTON   (United Kingdom)

Author keywords

Euclidean distance matrix; Quadratic convergence; Semismooth Newton method

Indexed keywords

COMPUTATIONAL PROBLEM; EUCLIDEAN DISTANCE MATRICES; MOLECULAR CONFORMATION; MULTI-DIMENSIONAL SCALING; NUCLEAR MAGNETIC RESONANCE DATA; QUADRATIC CONVERGENCE; QUADRATIC SEMIDEFINITE PROGRAMMING; SEMISMOOTH NEWTON METHOD;

ATOMS; NEWTON-RAPHSON METHOD;

MATHEMATICAL PROGRAMMING;

EID: 84877341941     PISSN: 08954798     EISSN: 10957162     Source Type: Journal    
DOI: 10.1137/110849523     Document Type: Article

References (47)

1. A. Y. Alfakih, A. Khandani, and H. Wolkowicz, Solving Euclidean distance matrix completion problems via semidefinite programming, Comput. Optim. Appl., 12 (1999), pp. 13- 30.
2. S. Al-Homidan and H. Wolkowicz, Approximate and exact completion problems for Euclidean distance matrices using semidefinite programming, Linear Algebra Appl., 406 (2005), pp. 109-141.
3. F. Alizadeh, J.-P. A. Haeberly, M. L. Overton, Complementarity and nondegeneracy in semidefinite programming, Math. Program., 77 (1997), pp. 111-128.
4. A. Beck and M. Teboulle, A fast iterative shrinkage-thresholding algorithm for linear inverse problems, SIAM J. Imaging Sciences, 2 (2009), pp. 183-202.
5. D. P. Bertsekas, Nonlinear Programming, 2nd ed., Athena Scientific, Nashua, NH, 1999.
6. I. Borg and P. J. F. Groenen, Modern Multidimensional Scaling: Theory and Applications, 2nd ed., Springer Ser. Statist., Springer, New York, 2005.
7. R. Borsdorf and N. J. Higham, A preconditioned Newton algorithm for the nearest correlation matrix, IMA J. Numer. Anal., 94 (2010), pp. 94-107.
8. S. Boyd and L. Xiao, Least-squares covariance matrix adjustment, SIAM J. Matrix Anal. Appl., 27 (2005), pp. 532-546.
9. X. Chen, H. Qi, and P. Tseng, Analysis of nonsmooth symmetric-matrix- valued functions with applications to semidefinite complementarity problems, SIAM J. Optim., 13 (2003), pp. 960-985.
10. Z. X. Chan and D. Sun, Constraint nondegeneracy, strong regularity, and nonsingularity in semidefinite programming, SIAM J. Optim., 19 (2008), pp. 370-396.
11. F. H. Clarke, Optimization and Nonsmooth Analysis, John Wiley & Sons, New York, 1983.
12. T. F. Cox and M. A. A. Cox, Multidimensional Scaling, 2nd ed., Chapman and Hall/CRC, Boca Raton, FL, 2001.
13. G. Crippen and T. Havel, Distance Geometry and Molecular Conformation, John Wiley & Sons, New York, 1988
14. J. Dattorro, Convex Optimization and Euclidean Distance Geometry, Meboo Publishing USA, Palo Alto, CA, 2005.
15. R. L. Dykstra, An algorithm for restricted least squares regression, J. Amer. Statist. Assoc., 78 (1983), pp. 839-842.
16. H.-R. Fang and D. P. O'Leary, Euclidean distance matrix completion problems, Optim. Methods Softw., 27 (2012), pp. 695-717.
17. N. Gaffke and R. Mathar, A cyclic projection algorithm via duality, Metrika, 36 (1989), pp. 29-54.
18. Y. Gao and D. F. Sun, A Majorized Penalty Approach for Calibrating Rank Constrained Correlation Matrix Problems, Technical Report, Department of Mathematics, National University of Singapore, Singapore, 2010.
19. W. Glunt, T. L. Hayden, S. Hong, and J. Wells, An alternating projection algorithm for computing the nearest Euclidean distance matrix, SIAM J. Matrix Anal. Appl., 11 (1990), pp. 589-600.
20. W. Glunt, T. L. Hayden, and W.-M. Liu, The embedding problem for predistance matrices, Bull. Math. Biol., 53 (1991), pp. 769-796.
21. W. Glunt, T. L. Hayden, and R. Raydan, Molecular conformations from distance matrices, J. Comput. Chem., 14 (1993), pp. 114-120.
22. W. Glunt, T. L. Hayden, and R. Raydan, Preconditioners for distance matrix algorithms, J. Comput. Chem., 15 (1994), pp. 227-232.
23. J. C. Gower, Properties of Euclidean and non-Euclidean distance matrices, Linear Algebra Appl., 67 (1985), pp. 81-97.
24. S. P. Han, A successive projection method, Math. Programming, 40 (1988), pp. 1-14.
25. T. L. Hayden and J. Wells, Approximation by matrices positive semidefinite on a subspace, Linear Algebra Appl., 109 (1988), pp. 115-130.
26. T. L. Hayden, J. Wells, W.-M. Liu, and P. Tarazaga, The cone of distance matrices, Linear Algebra Appl., 144 (1991), pp. 153-169.
27. M. R. Hestenes and E. Stiefel, Methods of conjugate gradients for solving linear systems, J. Res. Nat. Bur. Stand., 49 (1952), pp. 409-436.
28. N. J. Higham, Computing the nearest correlation matrix - a problem from finance, IMA J. Numer. Anal., 22 (2002), pp. 329-343.
29. K. Jiang, D. Sun, and K.-C. Toh, An inexact accelerated proximal gradient method for large scale linearly constrained convex SDP, SIAM J. Optim., 22 (2012), pp. 1042-1064.
30. N. Krislock and H.Wolkowicz, Euclidean distance matrices and applications, in Handbook on Semidefinite, Conic and Polynomial Optimization, M. Anjos and J. Lasserre, eds., Springer, New York, 2012, pp. 879-914.
31. J. Malick, A dual approach to semidefinite least-squares problems, SIAM J. Matrix Anal. Appl., 26 (2004), pp. 272-284.
32. J. Malick and H. S. Sendov, Clarke generalized Jacobian of the projection onto the cone of positive semidefinite matrices, Set-Valued Anal., 14 (2006), pp. 273-293.
33. lp approximation, J. Construct. Approx., 9 (1985), pp. 93-102.
34. C. A. Micchelli and F. I. Utreras, Smoothing and interpolation in a convex subset of a Hilbert space, SIAM J. Sci. Stat. Comput., 9 (1988), pp. 728-746.
35. Y. Nesterov, A method of solving a convex programming problem with convergence rate O(1/k2), Soviet Math. Dokl., 27 (1983), pp. 372-376.
36. A. Neumaier, Molecular modeling of proteins and mathematical prediction of protein structure, SIAM Rev., 39 (1997), pp. 407-460.
37. H.-D. Qi, Positive semidefinite matrix completions on chordal graphs and constraint nondegeneracy in semidefinite programming, Linear Algebra Appl., 430 (2009), pp. 1151-1164.
38. H. Qi and D. Sun, A quadratically convergent Newton method for computing the nearest correlation matrix, SIAM J. Matrix Anal. Appl., 28 (2006), pp. 360-385.
39. L. Qi and J. Sun, A nonsmooth version of Newton's method, Math. Programming, 58 (1993), pp. 353-367.
40. H.-D. Qi and X. M. Yuan, Computing the Nearest Euclidean Distance Matrix with Low Embedding Dimensions, Tech. Report, School of Mathematics, University of Southampton, Southampton, UK, 2012.
41. R. T. Rockafellar, Conjugate Duality and Optimization, CBMS-NSF Reg. Conf. Ser. Appl. Math. 16, SIAM, Philadelphia, 1974.
42. I. J. Schoenberg, Remarks to Maurice Fréchet's article "Sur la définition axiomatique d'une classe d'espace vectoriels distanciés vectoriellement applicables sur l'espace de Hilbert," Ann. Math., 36 (1935), pp. 724-732.
43. D. F. Sun, The strong second-order sufficient condition and constraint nondegeneracy in nonlinear semidefinite programming and their implications, Math. Oper. Res., 31 (2006), pp. 761-776.
44. D. F. Sun and J. Sun, Semismooth matrix valued functions, Math. Oper. Res., 27 (2002), pp. 150-169.
45. K. C. Toh, An inexact path-following algorithm for convex quadratic SDP, Math. Programming, 112 (2008), pp. 221-254.
46. P. Tseng, On Accelerated Proximal Gradient Methods for Convex-Concave Optimization, Tech. report, University of Washington, Seattle, WA, 2008.
47. G. Young and A. S. Householder, Discussion of a set of points in terms of their mutual distances, Psychometrika, 3 (1938), pp. 19-22.