A parallel interior point decomposition algorithm for block angular semidefinite programs

@article{Sivaramakrishnan2010API,
  title={A parallel interior point decomposition algorithm for block angular semidefinite programs},
  author={Kartik Krishnan Sivaramakrishnan},
  journal={Comp. Opt. and Appl.},
  year={2010},
  volume={46},
  pages={1-29}
}
We present a two phase interior point decomposition framework for solving semidefinite (SDP) relaxations of sparse maxcut, stable set, and box constrained quadratic programs. In phase 1, we suitably modify the matrix completion scheme of Fukuda et al. [11] to preprocess an existing SDP into an equivalent SDP in the block-angular form. In phase 2, we solve the resulting block-angular SDP using a regularized interior point decomposition algorithm, in an iterative fashion between a master problem… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-10 of 38 references

Nonlinear Optimization

  • A. Ruszczyński
  • Princeton University Press
  • 2006
Highly Influential
9 Excerpts

Csdp

  • B. Borchers
  • a C library for semidefinite programming…
  • 1999
Highly Influential
6 Excerpts

Aspects of Semidefinite Programming: Interior Point Algorithms and Selected Applications

  • E. de Klerk
  • Kluwer Academic Publishers, Dordrecht,
  • 2002
Highly Influential
5 Excerpts

Similar Papers

Loading similar papers…