Abstract
Semidefinite relaxations of quadratic 0–1 programming or graph partitioning problems are well known to be of high quality. How- ever, solving them by primal-dual interior point methods can take much time even for problems of moderate size. Recently we proposed a spectral bundle method that allows to compute, within reasonable time, ap- proximate solutions to structured, large equality constrained semidefinite programs if the trace of the primal matrix variable is fixed. The latter property holds for the aforementioned applications. We extend the spec- tral bundle method so that it can handle inequality constraints without seriously increasing computation time. This makes it possible to apply cutting plane algorithms to semidefinite relaxations of real world sized instances. We illustrate the efficacy of the approach by giving some pre- liminary computational results.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
S. Benson, Y. Ye, and X. Zhang. Solving large-scale sparse semidefinite programs for combinatorial optimization. Working paper, Department of Management Science, University of Iowa, IA, 52242, USA, Sept. 1997.
M. X. Goemans and D. P. Williamson. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J. ACM, 42:1115–1145, 1995.
G. H. Golub and C. F. van Loan. Matrix Computations. The Johns Hopkins University Press, 2nd edition, 1989.
M. Grötschel, L. Lovász, and A. Schrijver. Polynomial algorithms for perfect graphs. Annals of Discrete Mathematics, 21:325–356, 1984.
C. Helmberg and F. Rendl. Solving quadratic (0,1)-problems by semidefinite programs and cutting planes. ZIB Preprint SC-95-35, Konrad-Zuse-Zentrum für Informationstechnik Berlin, Nov. 1995. To appear in Math. Programming.
C. Helmberg and F. Rendl. A spectral bundle method for semidefinite programming. ZIB Preprint SC-97-37, Konrad-Zuse-Zentrum für Informationstechnik Berlin, Aug. 1997.
K. C. Kiwiel. Proximity control in bundle methods for convex nondifferentiable minimization. Math. Programming, 46:105–122, 1990.
A. S. Lewis and M. L. Overton. Eigenvalue optimization. Acta Numerica, 149–190, 1996.
L. Lovász. On the Shannon capacity of a graph. IEEE Transactions on Information Theory, IT-25(1):1–7, 1979.
L. Lovász and A. Schrijver. Cones of matrices and set-functions and 0–1 optimization. SIAM J. Optim., 1(2):166–190, 1991.
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:121–152, 1992.
M. J. Todd, K. C. Toh, and R. H. Tütüncü. On the Nesterov-Todd direction in semidefinite programming. Technical Report TR 1154, School of Operations Research and Industrial Engineering, Cornell University, Ithaca, New York 14853, Mar. 1996.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Helmberg, C., Kiwiel, K.C., Rendl, F. (1998). Incorporating Inequality Constraints in the Spectral Bundle Method. In: Bixby, R.E., Boyd, E.A., Ríos-Mercado, R.Z. (eds) Integer Programming and Combinatorial Optimization. IPCO 1998. Lecture Notes in Computer Science, vol 1412. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-69346-7_32
Download citation
DOI: https://doi.org/10.1007/3-540-69346-7_32
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64590-0
Online ISBN: 978-3-540-69346-8
eBook Packages: Springer Book Archive