BEGIN:VCALENDAR
PRODID:-//Microsoft Corporation//Outlook MIMEDIR//EN
VERSION:1.0
BEGIN:VEVENT
DTSTART:20121115T213000Z
DTEND:20121115T220000Z
LOCATION:355-EF
DESCRIPTION;ENCODING=QUOTED-PRINTABLE:ABSTRACT: Semidefinite Programming (SDP) is one of the most important optimization problems, which covers a wide range of applications such as combinatorial optimization, control theory, quantum chemistry, truss topology design, etc. =0ASolving extremely large-scale SDP problems has significant importance for the current and future applications of SDPs. We have developed SDPA aimed for solving large-scale SDP problems with numerical stability. SDPARA is a parallel version of SDPA, which replaces two major bottleneck parts (the generation of the Schur complement matrix and its Cholesky factorization) of SDPA by their parallel implementation. In particular, it has been successfully applied on combinatorial optimization and truss topology optimization, new SDPARA(7.5.0-G) on a large-scale supercomputer called TSUBAME2.0 has succeeded to solve the largest SDP problem which has over 1.48 million constraints and make a new world record. Our implementation has also achieved 533 TFlops for the large-scale Cholesky factorization using 2,720 CPUs and 4,080 GPUs.
SUMMARY:High-Performance General Solver for Extremely Large-Scale Semidefinite Programing Problems
PRIORITY:3
END:VEVENT
END:VCALENDAR