Numerical evaluation of SBmethod

Mathematical Programming, Series B

Volumn 95, Issue 2, 2003, Pages 381-406

  Helmberg, C ^a  

^a ZUSE INSTITUTE BERLIN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL MATHEMATICS; COMPUTATION THEORY; EIGENVALUES AND EIGENFUNCTIONS; HEURISTIC METHODS; OPTIMIZATION; PROBLEM SOLVING;

COMBINATORIAL OPTIMIZATION PROBLEMS; EIGENVALUE COMPUTATION; SEMIDEFINITE PROGRAMMING;

NUMERICAL METHODS;

EID: 29644441695     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10107-002-0354-6     Document Type: Article

References (21)

1. S. Benson, Y. Ye, and X. Zhang. Solving large-scale sparse semidefinite programs for combinatorial optimization. SIAM J. Optim., 10(2):443-461, 2000.
2. S. Burer and R. D. Monteiro. A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization. DOI 10.1007/s10107-002-0352-8
3. S. Burer, R. D. Monteiro, and Y. Zhang. Interior-point algorithms for semidefinite programming based on a nonlinear programming formulation. Computational Optimization and Applications, 22:49-79, 2002.
4. S. Burer, R. D. C. Monteiro, and Y. Zhang. Solving a class of semidefinite programs via nonlinear programming. Math. Programming, 93(1):97-122, June 2002.
5. A. Eisenblätter. Frequency Assignment in GSM Networks. PhD-Thesis, Technische Universität Berlin, Berlin, 2001. ISBN 3-89873-213-4, URL: ftp://ftp.zib.de/pub/zib-publications/books/PhD_eisenblaetter.ps.Z
6. M. X. Goemans. Semidefinite programming in combinatorial optimization. Math. Programming, 79:143-161, Oct. 1997.
7. nd edition, 1989.
8. C. Helmberg. Semidefinite programming for combinatorial optimization. Habilitationsschrift TU Berlin, Jan. 2000; ZIB-Report ZR 00-34, Konrad-Zuse-Zentrum für Informationstechnik Berlin, Takustraße 7, 14195 Berlin, Germany, Oct. 2000.
9. C. Helmberg. SBmethod - a C++implementation of the spectral bundle method. Manual to Version 1.1, ZIB-Report ZR 00-35, Konrad-Zuse-Zentrum für Informationstechnik Berlin, Takustraße 7, 14195 Berlin, Germany, Oct. 2000. URL: http://www.zib.de/helmberg/SBmethod
10. C. Helmberg. A cutting plane algorithm for large scale semidefinite relaxations. ZIB-Report ZR 01-26, Konrad-Zuse-Zentrum für Informationstechnik Berlin, Takustraße 7, 14195 Berlin, Germany, Oct. 2001.
11. C. Helmberg and K. C. Kiwiel. A spectral bundle method with bounds. DOI 10.1007/S101070100270
12. C. Helmberg and F. Rendl. A spectral bundle method for semidefinite programming. SIAM J. Optim., 10(3):673-696, 2000.
13. K. C. Kiwiel. Proximity control in bundle methods for convex nondifferentiable minimization. Math. Programmmg, 46:105-122, 1990.
14. A. S. Lewis and M. L. Overton. Eigenvalue optimization. Acta Numerica, pages 149-190, 1996.
15. L. Lovász. On the Shannon capacity of a graph. IEEE Transactions on Information Theory, IT-25(1):1-7, Jan. 1979.
16. H. D. Mittelmann. An independent benchmarking of SDP and SOCP solvers. DOI 10.1007/s10107-002-0355-5
17. M. V. Nayakkankuppam. Optimization Over Symmetric Cones. PhD-Thesis, Department of Computer Science, Graduate School of Arts and Science, New York University, Sept. 1999.
18. B. N. Parlett. The Symmetric Eigenvalue Problem, volume 20 of Classics in Applied Mathematics. SIAM, Philadelphia, 1998.
19. G. Pataki and S. Schmieta. The DIMACS library of mixed semidefinite-quadratic-linear programs. Draft manuscript. Computational Optimization Research Center, Columbia University, Nov. 1999. Available at http://dimacs.rutgers.edu/Challenges/Seventh/Instances/
20. Y. Saad. Numerical Methods for Large Eigenvalue Problems. Halsted Press, New York, 1992.
21. F. Schiller. Zur Berechnung und Abschätzung von Färbungszahlen und der v-Funktion von Graphen. Diplomarbeit, Technische Universität Berlin, Fachbereich Mathematik, Sekretariat MA 4-1, Straße des 17. Juni 136, 10623 Berlin, Germany, Nov. 1999.