Semidefinite Programing and Matrix Completions for Partial Hermitian Matrices

colloquium talk at University of Guelph, Mar 2, 2001. ( map)

Abstract (text file):; the presentation (ps file))

This talk is based on several papers; principally, on the papers
dealing with completion problems.
The paper

Positive definite completions of
partial {H}ermitian matrices
(GRONE, B. and JOHNSON, C.R. and MARQUES de SA, E. and WOLKOWICZ, H.)
presents a characterization for completion using chordality of graphs;

while the three papers:

AN INTERIOR-POINT METHOD FOR APPROXIMATE POSITIVE
SEMIDEFINITE COMPLETIONS and

Solving Euclidean distance matrix completion problems via
semidefinite programming and
Two Theorems On Euclidean Distance Matrices and Gale Transform

present primal-dual interior-point methods/theory for solving approximate
completion problems. A summary of these results is presented in

Matrix Completion Problems, in the
Handbook of Semidefinite Programming, Kluwer Academic, 2000.