Exploiting sparsity in semidefinite programming via matrix completion II: implementation and numerical results

In Part I of this series of articles, we introduced a general framework of exploiting the aggregate sparsity pattern over all data matrices of large scale and sparse semidefinite programs (SDPs) when solving them by primal-dual interior-point methods. This framework is based on some results about positive semidefinite matrix completion, and it can be… CONTINUE READING

8 Figures & Tables

Topics

Statistics

01020'02'04'06'08'10'12'14'16'18
Citations per Year

122 Citations

Semantic Scholar estimates that this publication has 122 citations based on the available data.

See our FAQ for additional information.