Improved spectral relaxation methods for binary quadratic optimization problems

@article{Olsson2008ImprovedSR,
  title={Improved spectral relaxation methods for binary quadratic optimization problems},
  author={Carl Olsson and Anders P. Eriksson and Fredrik Kahl},
  journal={Computer Vision and Image Understanding},
  year={2008},
  volume={112},
  pages={3-13}
}
In this paper, we introduce two new methods for solving binary quadratic problems. While spectral relaxation methods have been the workhorse subroutine for a wide variety of computer vision problems—segmentation, clustering, subgraph matching to name a few—it has recently been challenged by semidefinite programming (SDP) relaxations. In fact, it can be shown that SDP relaxations produce better lower bounds than spectral relaxations on binary problems with a quadratic objective function. On the… CONTINUE READING
Highly Cited
This paper has 21 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 14 extracted citations

References

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

Similar Papers

Loading similar papers…