Conditional Quadratic Semidefinite Programming: Examples and Methods

Journal of the Operations Research Society of China

Volumn 2, Issue 2, 2014, Pages 143-170

  Qi, Hou Duo ^a  

^a UNIVERSITY OF SOUTHAMPTON   (United Kingdom)

Author keywords

Conditional semidefinite programming; Euclidean distance matrix; Matrix optimization; Semismooth Newton method

Indexed keywords

COMPUTER APPLICATIONS; OPERATIONS RESEARCH;

CONSTRAINT NONDEGENERACY; EUCLIDEAN DISTANCE MATRICES; MATRIX OPTIMIZATION; POSITIVE SEMIDEFINITE; QUADRATIC CONVERGENCE; QUADRATIC SEMIDEFINITE PROGRAMMING; SEMI-DEFINITE PROGRAMMING; SEMISMOOTH NEWTON METHOD;

NEWTON-RAPHSON METHOD;

EID: 84903600117     PISSN: 2194668X     EISSN: 21946698     Source Type: Journal    
DOI: 10.1007/s40305-014-0048-9     Document Type: Review

References (49)

1. Alfakih, A. Y., Khandani, A., Wolkowicz, H.: Solving Euclidean distance matrix completion problems via semidefinite programming. Comput. Optim. Appl. 12, 13-30 (1999).
2. Bai, S., Qi, H.-D., Xiu, N.: Constrained best Euclidean distance embedding on a sphere: a matrix optimization approach. Tech. Report, School of Mathematics, University of Southampton, December (2013).
3. Baxter, B. J. C.: Conditionally positive functions and p-norm distance matrices. Constr. Approx. 7, 427-440 (1991).
4. Bonnans, J. F., Gilbert, J. C., Lemaréchal, C., Sagastiábal, C. A.: Numerical Optimization. Springer-Verlag, Berlin (2006).
5. Borg, I., Groenen, P. J. F.: Modern Multidimensional Scaling: Theory and Applications. Springer Series in Statistics, 2nd edn. Springer, New York (2005).
6. Chen, X., Qi, H.-D., Tseng, P.: Analysis of nonsmooth symmetric matrix valued functions with applications to semidefinite complementarity problems. SIAM J. Optim. 13, 960-985 (2003).
7. Chabrillac, Y., Crouzeix, J.-P.: Definiteness and semidefiniteness of quadratic forms revisted. Linear Algebra Appl. 63, 283-292 (1984).
8. Chan, Z. X., Sun, D. F.: Constraint nondegeneracy, strong regularity and nonsingularity in semidefinite programming. SIAM J. Optim. 19, 370-396 (2008).
9. Clarke, F. H.: Optimization and Nonsmooth Analysis. Wiley, New York (1983).
10. Cox, T. F., Cox, M. A. A.: Multidimensional Scaling, 2nd edn. Chapman and Hall/CRC, Boca Raton (2001).
11. Dattorro, J.: Convex Optimization and Euclidean Distance Geometry. Meboo Publishing, Palo Alto (2005).
12. Donoghue, W. F.: Monotone Matrix Functions and Analytic Continuation. Springer-Verlag, Berlin (1974).
13. Gaffke, N., Mathar, R.: A cyclic projection algorithm via duality. Metrika 36, 29-54 (1989).
14. Gao, Y.: Structured low rank matrix optimization problems: a penalty approach. PhD Thesis National University of Singapore (2010).
15. Gao, Y., Sun, D. F.: Calibrating least squares covariance matrix problems with equality and inequality constraints. SIAM J. Matrix Anal. Appl. 31, 1432-1457 (2009).
16. Glunt, W., Hayden, T. L., Hong, S., Wells, J.: An alternating projection algorithm for computing the nearest Euclidean distance matrix. SIAM J. Matrix Anal. Appl. 11, 589-600 (1990).
17. Glunt, W., Hayden, T. L., Liu, W.-M.: The embedding problem for predistance matrices. Bull. Math. Biol. 53, 769-796 (1991).
18. Glunt, W., Hayden, T. L., Raydan, R.: Molecular conformations from distance matrices. J. Comput. Chem. 14, 114-120 (1993).
19. Gower, J. C.: Some distance properties of latent root and vector methods in multivariate analysis. Biometrika 53, 315-328 (1966).
20. Grooms, I. G., Lewis, R. M., Trosset, M. W.: Molecular embedding via a second order dissimilarity parameterized approach. SIAM J. Sci. Comput. 31, 2733-2756 (2009).
21. Hayden, T. L., Wells, J.: Approximation by matrices positive semidefinite on a subspace. Linear Algebra Appl. 109, 115-130 (1988).
22. Hestenes, M. R., Stiefel, E.: Methods of conjugate gradients for solving linear systems. J. Res. Natl. Bur. Stand. 49, 409-436 (1952).
23. Hu, X., Zhang, L., Du, W.: The solvability conditions for the inverse problem of matrices positive semidefinite on a subspace. J. Comput. Math. 12, 78-87 (1994).
24. Ikramov, KhD, Savel'eva, N. V.: Conditionally definite matrices. J. Math. Sci. 98, 1-50 (2000). Translated from Itogi Nauki i Tekhniki, Seriya Sovremennaya Matematika i Ee Prilozheniya, Tematicheskie Obzory. Vol. 52, Algebra-9 (1998).
25. Jiang, K., Sun, D. F., Toh, K.-C.: An inexact accelerated proximal gradient method for large scale linearly constrained convex SDP. SIAM J. Optim. 22, 1042-1064 (2012).
26. Johnson, C. R., Smith, R. L.: The positive definite completion problem relative to a subspace. Linear Algebra Appl. 307, 1-14 (2000).
27. Lucic, V.: Private communication, January (2014).
28. Mathar, R.: The best Euclidean fit to a given distance matrix in prescribed dimensions. Linear Algebra Appl. 67, 1-6 (1985).
29. Micchelli, C. A.: Interpolation of scattered data: distance matrices and conditionally positive definite functions. Constr. Approx. 2, 11-22 (1986).
30. Nocedal, J., Wright, S. J.: Numerical Optimization. Springer-Verlag, New York (2000).
31. Parhizkar, R.: Euclidean Distance Matrices: Properties, Algorithms and Applications. PhD Thesis, École Polytechnique Fédérale Lausanne (2013).
32. Piterbarg, V. V.: LMM correlation parameterization guaranteed to be positive semidefinite. Technical Report (2009).
33. Qi, H.-D.: A semismooth Newton method for the nearest Euclidean distance matrix problem. SIAM J. Matrix Anal. Appl. 34, 67-93 (2013).
34. Qi, H.-D., Sun, D. F.: A quadratically convergent Newton method for computing the nearest correlation matrix. SIAM J. Matrix Anal. Appl. 28, 360-385 (2006).
35. Qi, H.-D., Sun, D. F.: An augmented Lagrangian dual approach for the H-weighted nearest correlation matrix problem. IMA J. Numer. Anal. 31, 491-511 (2011).
36. Qi, H.-D., Xiu, N.: A convex quadratic semidefinite programming approach to the partial additive constant problem in multidimensional scaling. J. Stat. Comput. Simul. 82, 1317-1336 (2012).
37. Qi, L., Sun, J.: A nonsmooth version of Newton's method. Math. Program. 58, 353-367 (1993).
38. Reams, R.: Hadamard inverse, square roots and products of almost semidefinite matrices. Linear Algebra Appl. 288, 35-43 (1999).
39. Rebonato, R.: Volatility and Correlation, 2nd edn. Wiley, Hoboken (2004).
40. Schoenberg, I. J.: Remarks to Maurice Fréchet's article "Sur la définition axiomatque d'une classe d'espaces vectoriels distanciés applicbles vectoriellement sur l'espace de Hilbet". Ann. Math. 36, 724-732 (1935).
41. Schoenberg, I. J.: On certain metric spaces arising from Euclidean spaces by a change of metric and their embedding in Hilbert space. Ann. Math. 38(2), 787-793 (1937).
42. Schoenberg, I. J.: Metric spaces and positive definite functions. Trans. Am. Math. Soc. 44, 522-536 (1938).
43. Sun, D. F., Sun, J.: Semismooth matrix valued functions. Math. Oper. Res. 27, 150-169 (2002).
44. Toh, K. C.: An inexact path-following algorithm for convex quadratic SDP. Math. Program. 112, 221-254 (2008).
45. Torgerson, W. S.: Multidimensional scaling: I. Theory and method. Psychometrka 17, 401-419 (1952).
46. Torgerson, W. S.: Theory and Methods of Scaling. Wiley, New York (1958).
47. Trosset, M. W.: Distance matrix completion by numerical optimization. Comput. Optim. Appl. 17, 11-22 (2000).
48. Young, G., Householder, A. S.: Discussion of a set of points in terms of their mutual distances. Psychometrika 3, 19-22 (1938).
49. Zhao, X., Sun, D. F., Toh, K.-C.: A Newton-CG augmented Lagrangian method for semidefinite programming. SIAM J. Optim. 20, 1737-1765 (2010).