Exploiting Sparsity in Semidefinite Programming via Matrix Completion I: General Framework

  • Fukuda M
  • Kojima M
  • Murota K
 et al. 
  • 54


    Mendeley users who have this article in their library.
  • 122


    Citations of this article.


A critical disadvantage of primal-dual interior-point methods against dual interiorpoint methods for large scale SDPs (semide nite programs) has been that the primal positive semide nite variable matrix becomes fully dense in general even when all data matrices are sparse. Based on some fundamental results about positive semide nite matrix completion, this article proposes a general method of exploiting the aggregate sparsity pattern over all data matrices to overcome this disadvantage. Our method is used in two ways. One is a conversion of a sparse SDP having a large scale positive semide nite variable matrix into an SDP having multiple but smaller size positive semide nite variable matrices to which we can e ectively apply any interior-point method for SDPs employing a standard block-diagonal matrix data structure. The other way is an incorporation of our method into primal-dual interior-point methods which we can apply directly to a given SDP. In Part II of this article, we will investigate an implementation of such a primal-dual interior-point method based on positive de nite matrix completion, and report some numerical results.

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


  • Mituhiro Fukuda

  • Masakazu Kojima

  • Kazuo Murota

  • Kazuhide Nakata

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free