Robust algorithms for large sparse semidefinite programming (SDP)

abstract and talk (ps file);

• all my research reports
  and the two relevant reports:
  Solving Semidefinite Programs using Preconditioned Conjugate Gradients revision of CORR 2001-49; and
  Strengthened Existence and Uniqueness Conditions for Search Directions in Semidefinite Programming
• 
  
• DIMACS Workshop on Semidefinite Programming and its Applications to Large Scale Discrete Optimization, January 7 - 9, 1999, Princeton University, Department of Computer Science.
• Article: Solving Some Large Scale Semidefinite Programs via the Conjugate Residual Method , SIAM Journal on Optimization, Volume 12, Number 3, pp. 669-691, 2002 Society for Industrial and Applied Mathematics, by Kim-Chuan Toh, Masakazu Kojima
• Article: Exploiting Sparsity in Semidefinite Programming via Matrix Completion I: General Framework , SIAM Journal on Optimization, Volume 11, Number 3, pp. 647-674, 2000 Society for Industrial and Applied Mathematics, by Kim-Chuan Toh, Masakazu Kojima