Title: How Far Can We Go With Primal--Dual Interior Point Methods For SDP?

Author:
Brian Borchers and Joseph Young
Department of Mathematics
New Mexico Tech
801 Leroy Place
Socorro, NM 87801

Abstract: 
Primal-Dual interior point methods, and in particular the HKM method,
are used in several of the available codes for semidefinite
programming, including CSDP, SeDuMi, SDPA, SDPT3.  These methods have
proven to be quite satisfactory for a variety of small and medium
sized problems.  However, larger problems have not been solvable by
primal-dual methods.  This presenter will review the computational
difficulties associated with solving larger problems by primal-dual
methods, look at the characteristics of some medium to large scale SDP
problems, and report on progress in solving larger problems with CSDP.