Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and Equipartition

@article{Fischer2006ComputationalEW,
  title={Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and Equipartition},
  author={Ilse Fischer and Gerald Gruber and Franz Rendl and Renata Sotirov},
  journal={Math. Program.},
  year={2006},
  volume={105},
  pages={451-469}
}
We propose a dynamic version of the bundle method to get approximate solutions to semidefinite programs with a nearly arbitrary number of linear inequalities. Our approach is based on Lagrangian duality, where the inequalities are dualized, and only a basic set of constraints is maintained explicitly. This leads to function evaluations requiring to solve a relatively simple semidefinite program. Our approach provides accurate solutions to semidefinite relaxations of the Max-Cut and the… CONTINUE READING
32 Citations
39 References
Similar Papers

Citations

Publications citing this paper.

References

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

Semidefinite Programming and Graph Equipartition

  • S. E. Karisch, F. Rendl
  • Fields Institute Communications 18, 77–95
  • 1998
Highly Influential
6 Excerpts

Solving quadratic (0,1)-problems by semidefinite programming and cutting planes

  • C. Helmberg, F. Rendl
  • Mathematical Programming 82, 291–315
  • 1998
Highly Influential
6 Excerpts

A study of search directions in primal-dual interior-point methods for semidefinite programming

  • M. J. Todd
  • Optimization Methods and Software 11, 1–46
  • 1999
Highly Influential
1 Excerpt

Similar Papers

Loading similar papers…