This thesis focuses on designing efficient algorithms for solving large scale semidfinite programming, which have many applications in a wide range of fields, such as combinatorial optimization, robust optimization, option pricing, correlation/covariance matrix estimation, kernel estimation and so on. (Abstract shortened by UMI.). |