Positive semidefinite matrix completions on chordal graphs and constraint nondegeneracy in semidefinite programming

Linear Algebra and Its Applications

Volumn 430, Issue 4, 2009, Pages 1151-1164

  Qi, Houduo ^a  

^a UNIVERSITY OF SOUTHAMPTON   (United Kingdom)

Author keywords

Chordal graph; Constraint nondegeneracy; Matrix completion; Semidefinite programming

Indexed keywords

DEMODULATION; THEOREM PROVING;

CHORDAL GRAPH; CONSTRAINT NONDEGENERACY; MATRIX COMPLETION; POSITIVE DEFINITE MATRIXES; POSITIVE SEMIDEFINITE MATRICES; SEMIDEFINITE PROGRAMMING;

TURBULENT FLOW;

EID: 58049191300     PISSN: 00243795     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.laa.2008.10.010     Document Type: Article

References (27)

1. Alfakih A., and Wolkowicz H. Matrix completion problems. Handbook of Semidefinite Programming. Internat. Ser. Oper. Res. Management Sci. vol. 27 (2000), Kluwer Acad. Publ., Boston, MA pp. 533-545
2. Alizadeh F., Haeberly J.-P.A., and Overton M.L. Complementarity and nondegenracy in semidefinite programming. Math. Program. 77 (1997) 111-128
3. Barrett W.W., Johnson C.R., and Loewy R. The real positive definite completion problem: cycle completability. Mem. Amer. Math. Soc. 122 584 (1996) viii+69 pp
4. Barrett W.W., Johnson C.R., and Loewy R. Critical graphs for the positive definite completion problem. SIAM J. Matrix Anal. Appl. 20 (1999) 117-130
5. Barrett W.W., Johnson C.R., and Tarazaga P. The real positive definite completion problemm for a simple cycle. Linear Algebra Appl. 192 (1993) 3-31
6. Bonnans J.F., and Shapiro A. Perturbation Analysis of Optimization Problems (2000), Springer, New York
7. Chan Z.X., and Sun D. Constraint nondegeneracy, strong regularity and nonsingularity in semidefinite programming. SIAM J. Optim. 19 (2008) 370-396
8. Dhillon I.S., and Tropp J.A. Matrix nearness problems with Bregman divergence. SIAM J. Matrix Anal. Appl. 29 (2007) 1120-1146
9. Dym H., and Gohberg I. Extensions of band matrices with band inverses. Linear Algebra Appl. 36 (1981) 1-24
10. Glunt W., Hayden T.L., Johnson C.R., and Tarazaga P. Positive definite completions and determinant maximization. Linear Algebra Appl. 288 (1999) 1-10
11. Grone R., Johnson C.R., Sà E.M., and Wolkowicz H. Positive definite completions of partial Hermitian matrices. Linear Algebra Appl. 58 (1984) 109-124
12. Harrison K.J. Matrix completions and chordal graphs. Acta Math., English Series 19 (2003) 577-590
13. Higham N.J. Computing the nearest correlation matrix - a problem from finance. IMA J. Numer. Analysis 22 (2002) 329-343
14. Johnson C.R. Matrix completion problems: a survey. Proc. Symp. Appl. Math. vol. 40 (1990), Amer. Math. Soc., Providence 171-198
15. Johnson C.R., Kroschel B., and Wolkowicz H. An interior-point method for approximate positive semidefinite completions. Comput. Optim. Appl. 9 (1998) 175-190
16. Laurent M. The real positive semidefinite completion problem for series-parallel graphs. Linear Algebra Appl. 252 (1997) 347-366
17. Laurent M. A connection between positive semidefinite and Euclidean distance matrix completion problems. Linear Algebra Appl. 273 (1998) 9-22
18. Laurent M. Matrix completion problem. In: Floudas C.A., and Pardalos P.M. (Eds). The Encyclopedia of Optimization vol. III (2001), Kluwer 221-229
19. H.-D. Qi, Local duality of nonlinear semidefinite programming, Math. Oper. Res. (2008), doi:10.1287/moor.1080.0315.
20. Qi H.-D., and Sun D.F. A quadratically convergent Newton method for computing the nearest correlation matrix. SIAM J. Matrix Anal. Appl. 28 (2006) 360-385
21. Robinson S.M. Strongly regular generalized equations. Math. Oper. Res. 5 (1980) 43-62
22. Rose D.J. Triangulated graphs and the elimination process. J. Math. Anal. Appl. 32 (1970) 597-609
23. Sun D.F. The strong second-order sufficient condition and constraint nondegeneracy in nonlinear semidefinite programming and their implications. Math. Oper. Res. 31 (2006) 761-776
24. Turkay S., Epperlein E., and Christofides N. Correlation stress testing for value-at-risk. J. Risk 5 (2003) 75-89
25. Toh K.C. An inexact path-following algorithm for convex quadratic SDP. Math. Program. 112 (2008) 221-254
26. Toh K.C., Tütüncü R.H., and Todd M.J. Inexact primal-dual path-following algorithms for a special class of convex quadratic SDP and related problems. Pacific J. Optim. 3 (2007) 135-164
27. Wolkowicz H., and Anjos M.F. Semidefinite programming for discrete optimization and matrix completion problems. Discrete Appl. Math. 123 (2002) 513-577