@techreport{5119,
  title = {Scalable Semidefinite Programming using Convex Perturbations},
  abstract = {Several important machine learning problems can be modeled and solved via semidefinite programs. Often, researchers invoke off-the-shelf software for the associated optimization, which can be inappropriate for many applications due to computational and storage requirements. In this paper, we introduce the use of convex perturbations for semidefinite programs (SDPs). Using a particular perturbation function, we arrive
  at an algorithm for SDPs that has several advantages over existing techniques: a) it is simple, requiring only a few lines of MATLAB, b) it is a first-order method which makes it scalable, c) it can easily exploit the structure of a particular SDP to gain efficiency (e.g., when the constraint matrices are low-rank). We demonstrate on several machine learning applications that the proposed algorithm is effective in finding fast approximations to large-scale SDPs.},
  number = {TR-07-47},
  organization = {Max-Planck-Gesellschaft},
  institution = {University of Texas, Austin, TX, USA},
  school = {Biologische Kybernetik},
  month = sep,
  year = {2007},
  slug = {5119},
  author = {Kulis, B. and Sra, S. and Jegelka, S.},
  month_numeric = {9}
}