A spectral bundle method for semidefinite programming

SIAM Journal on Optimization

Volumn 10, Issue 3, 2000, Pages 673-696

  Helmberg, C ^a   Rendl, F ^b  

^a ZUSE INSTITUTE BERLIN   (Germany)

^b UNIVERSITY OF KLAGENFURT   (Austria)

Author keywords

Convex optimization; Eigenvalue optimization; Large scale problems; Proximal bundle method; Semidefinite programming

Indexed keywords

EID: 0034415006     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1052623497328987     Document Type: Article

References (49)

1. F. ALIZADEH, Interior point methods in semidefinite programming with applications to combinatorial optimization, SIAM J. Optim., 5 (1995), pp. 13-51.
2. F. ALIZADEH, J.-P. A. HAEBERLY, AND M. L. OVERTON, Primal-dual interior-point methods for semidefinite programming: Convergence rates, stability and numerical results, SIAM J. Optim., 8 (1998), pp. 746-768.
3. J. BAGLAMA, D. CALVETTI, AND L. REICHEL, Iterative methods for the computation of a few eigenvalues of a large symmetric matrix, BIT, 36 (1996), pp. 400-421.
4. S. BENSON, Y. YE, AND X. ZHANG, Solving large-scale sparse semidefinite programs for combinatorial optimization, SIAM J. Optim., 10 (2000), pp. 443-461.
5. D. CALVETTI, L. REICHEL, AND D. SORENSEN, An implicitly restarted Lanczos method for large symmetric eigenvalue problems, Electron. Trans. Numer. Anal., 2 (1994), pp. 1-21.
6. J. CULLUM, W. E. DONATH, AND P. WOLFE, The minimization of certain nondifferentiable sums of eigenvalues of symmetric matrices, Math. Programming Stud., 3 (1975), pp. 35-55.
7. L. FAYBUSOVICH, Semidefinite programming: A path-following algorithm for a linear-quadratic functional, SIAM J. Optim., 6 (1996), pp. 1007-1024.
8. M. X. GOEMANS AND D. P. WILLIAMSON, Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming, J. Assoc. Comput. Mach., 42 (1995), pp. 1115-1145.
9. G. H. GOLUB AND C. F. VAN LOAN, Matrix Computations, 2nd ed., The Johns Hopkins University Press, Baltimore, MD, 1989.
10. R. G. GRIMES, J. G. LEWIS, AND H. D. SIMON, A shifted block Lanczos algorithm for solving sparse symmetric generalized eigenproblems, SIAM J. Matrix Anal. Appl., 15 (1994), pp. 228-272.
11. M. GRÖTSCHEL, L. LOVÁSZ, AND A. SCHRIJVER, Geometric Algorithms and Combinatorial Optimization, 2nd ed., Algorithms Combin., Springer-Verlag, Berlin, 1988.
12. C. HELMBERG, Fixing variables in semidefinite relaxations, in Algorithms - ESA'97, R. Burkard and G. Woeginger, eds., Lecture Notes in Comput. Sci. 1284, Springer, New York, 1997, pp. 259-270.
13. C. HELMBERG, K. C. KIWIEL, AND F. RENDL, Incorporating inequality constraints in the spectral bundle method, in Integer Programming and Combinatorial Optimization, R. E. Bixby, E. A. Boyd, and R. Z. Ríos-Mercado, eds., Lecture Notes in Comput. Sci. 1412, Springer, New York, 1998, pp. 423-435.
14. C. HELMBERG AND F. RENDL, Solving quadratic (0, 1)-problems by semidefinite programs and cutting planes, Math. Programming, 82 (1998), pp. 291-315.
15. C. HELMBERG, F. RENDL, R. J. VANDERBEI, AND H. WOLKOWICZ, An interior-point method for semidefinite programming, SIAM J. Optim., 6 (1996), pp. 342-361.
16. C. HELMBERG, F. RENDL, AND R. WEISMANTEL, Quadratic knapsack relaxations using cutting planes and semidefinite programming, in Integer Programming and Combinatorial Optimization, W. H. Cunningham, S. T. McCormick, and M. Queyranne, eds., Lecture Notes in Comput. Sci. 1084, Springer, New York, 1996, pp. 175-189.
17. J.-B. HIRIART-URRUTY AND C. LEMARÉCHAL, Convex Analysis and Minimization Algorithms I, Grundlehren Math. Wiss. 305, Springer-Verlag, Berlin, Heidelberg, 1993.
18. J.-B. HIRIART-URRUTY AND C. LEMARÉCHAL, Convex Analysis and Minimization Algorithms II, Grundlehren Math. Wiss. 306, Springer-Verlag, Berlin, Heidelberg, 1993.
19. F. JARRE, An interior-point method for minimizing the maximum eigenvalue of a linear combination of matrices, SIAM J. Control Optim., 31 (1993), pp. 1360-1377.
20. S. E. KARISCH, F. RENDL, AND J. CLAUSEN, Solving Graph Bisection Problems with Semidefinite Programming, Technical Report DIKU-TR-97/9, Department of Computer Science, University of Copenhagen, Denmark, July 1997; INFORMS J. Comput., to appear.
21. S. E. KARISCH, F. RENDL, AND J. CLAUSEN, Solving Graph Bisection Problems with Semidefinite Programming, Technical Report DIKU-TR-97/9, Department of Computer Science, University of Copenhagen, Denmark, July 1997; INFORMS J. Comput., to appear.
22. K. C. KIWIEL, Proximity control in bundle methods for convex nondifferentiable minimization, Math. Programming, 46 (1990), pp. 105-122.
23. P. KLEIN AND H.-I. LU, Efficient approximation algorithms for semidefinite programs arising from MAXCUT and COLORING, in Proceedings of the Symposium on the Theory of Computing, 1996, pp. 338-347.
24. M. KOJIMA, S. SHINDOH, AND S. HARA, Interior-point methods for the monotone linear complementarity problem in symmetric matrices, SIAM J. Optim., 7 (1997), pp. 86-125.
25. M. LAURENT, S. POLJAK, AND F. RENDL, Connections between semidefinite relaxations of the max-cut and stable set problems, Math. Programming, 77 (1997), pp. 225-246.
26. R. B. LEHOUCQ AND K. J. MASCHHOFF, Implementation of an Implicitly Restarted Block Arnoldi Method, Technical Report MCS-P649-0297, Argonne National Laboratory, Argonne, IL, 1997.
27. C. LEMARÉCHAL, F. OUSTRY, AND C. SAGASTIZÁBAL, The script U sign-Lagrangian of a Convex Function, Trans. Amer. Math. Soc., 352 (2000), pp. 711-729.
28. L. LOVÁSZ, On the Shannon capacity of a graph, IEEE Trans. Inform. Theory, IT-25 (1979), pp. 1-7.
29. L. LOVÁSZ AND A. SCHRIJVER, Cones of matrices and set-functions and 0-1 optimization, SIAM J. Optim., 1 (1991), pp. 166-190.
30. R. D. C. MONTEIRO, Polynomial convergence of primal-dual algorithms for semidefinite programming based on Monteiro and Zhang family of directions, SIAM J. Optim., 8 (1998), pp. 797-812.
31. R. B. MORGAN AND D. S. SCOTT, Preconditioning the Lanczos algorithm for sparse symmetric eigenvalue problems, SIAM J. Sci. Comput., 14 (1993), pp. 585-593.
32. Y. NESTEROV AND A. NEMIROVSKII, Interior-Point Polynomial Algorithms in Convex Programming, SIAM Stud. Appl. Math. 13, Philadelphia, 1994.
33. Y. NESTEROV AND M. J. TODD, Self-scaled barriers and interior-point methods for convex programming, Math. Oper. Res., 22 (1997), pp. 1-42.
34. F. OUSTRY, The script U sign-Lagrangian of the maximum eigenvalue function, SIAM J. Optim., 9 (1999), pp. 526-549.
35. F. OUSTRY, A Second-Order Bundle Method to Minimize the Maximum Eigenvalue Function, Technical Report, INRIA-ENSTA, France, November 1997; Math. Programming, submitted.
36. F. OUSTRY, A Second-Order Bundle Method to Minimize the Maximum Eigenvalue Function, Technical Report, INRIA-ENSTA, France, November 1997; Math. Programming, submitted.
37. M. L. OVERTON, Large-scale optimization of eigenvalues, SIAM J. Optim., 2 (1992), pp. 88-120.
38. G. PATAKI, On the rank of extreme matrices in semidefinite programming and the multiplicity of optimal eigenvalues, Math. Oper. Res., 23 (1998), pp. 339-358.
39. S. A. PLOTKIN, D. B. SHMOYS, AND E. TARDOS, Fast approximation algorithms for fractional packing and covering problems, Math. Oper. Res., 20 (1995), pp. 257-301.
40. E. POLAK AND Y. WARDI, Nondifferentiable optimization algorithm for designing control systems having singular value inequalities, Automatica, 18 (1982), pp. 267-283.
41. S. POLJAK AND F. RENDL, Node and edge relaxations of the max-cut problem, Computing, 52 (1994), pp. 123-137.
42. S. POLJAK AND F. RENDL, Nonpolyhedral relaxations of graph-bisection problems, SIAM J. Optim., 5 (1995), pp. 467-487.
43. R. T. ROCKAFELLAR, Convex Analysis, Princeton University Press, Princeton, NJ, 1970.
44. H. SCHRAMM AND J. ZOWE, A version of the bundle idea for minimizing a nonsmooth function: Conceptual idea, convergence analysis, numerical results, SIAM J. Optim., 2 (1992), pp. 121-152.
45. D. S. SCOTT, Implementing Lanczos-like algorithms on hypercube architectures, Comput. Phys. Comm., 53 (1989), pp. 271-281.
46. D. C. SORENSEN, Implicit application of polynomial filters in a k-step Arnoldi method, SIAM J. Matrix Anal. Appl., 13 (1992), pp. 357-385.
47. M. J. TODD, K. C. TOH, AND R. H. TÜTÜNCÜ, On the Nesterov-Todd direction in semidefinite programming, SIAM J. Optim., 8 (1998), pp. 769-796.
48. L. VANDENBERGHE AND S. BOYD, A primal-dual potential reduction method for problems involving matrix inequalities, Math. Programming Ser. B, 69 (1995), pp. 205-236.
49. S. ZHOU AND H. DAI, The block Chebyshev-Lanczos method for solving large symmetric eigen-value problems, J. Nanjing Aeronaut. Inst., 21 (1989), pp. 22-28.