C. Helmberg, K.C. Kiwiel  Home/Search
Context Related
| zib.de/pub/zibpublicatio...SC9937.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: zib.de/helmberg/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Semidefinite relaxations of quadratic 0-1 programming or graph partitioning problems are well known to be of high quality. However, solving them by primaldual interior point methods can take much time even for problems of moderate size. The recent spectral bundle method of Helmberg and Rendl can solve quite efficiently large structured equality-constrained semidefinite programs if the trace of the primal matrix variable is fixed, as happens in many applications. We extend the method so that it... (Update)
Context of citations to this paper: More
...problems because of its aggregation possibilities. The method is due to Helmberg and Rendl [16] Good references include Helmberg et al. [16, 15, 17], Helmberg and Oustry [18] The following lemma, from Helmberg [15] indicates the equivalence between (SDP) and the eigenvalue...
...our code in ANSI C and compared it with the first order spectral bundle method (SBmethod v1.1. 1) of Helmberg, Rendl, and Kiwiel [16, 15]. The default parameters for the spectral bundle method were used, and all tests were run on an SGI Origin2000 with 16 300MHz R12000...
Cited by: More
Semidefinite and Cone Programming Bibliography/Comments - Wolkowicz (2004) (Correct)
B-388 Solving Large Scale Semidefinite Programs via an.. - Augmented Systems.. (Correct)
Linear Programming (LP) Approaches to Semidefinite Programming.. - Krishnan (Correct)
Active bibliography (related documents): More All
1.8: Semidefinite Programming - Helmberg (1999) (Correct)
0.5: A Semidefinite Programming Approach to the Quadratic.. - Helmberg, Rendl.. (2000) (Correct)
0.4: A Cutting Plane Algorithm for Large Scale Semidefinite Relaxations - Helmberg (2001) (Correct)
Similar documents based on text: More All
1.4: Numerical Evaluation of SBmethod - Helmberg (2001) (Correct)
0.8: SBmethod - A C++ Implementation of the Spectral Bundle Method.. - Helmberg (2000) (Correct)
0.8: A Spectral Bundle Method for Semidefinite Programming - Helmberg, Rendl (1997) (Correct)
Related documents from co-citation: More All
7: Solving Semidefinite Programs via Nonlinear Programming - Burer, Monteiro et al. - 1999
5: Improved approximation algorithms for MAX-k-CUT and MAX BISECTION - Frieze, Jerrum - 1996
5: A spectral bundle method for semidefinite programming - Helmberg, Rendl - 1997
BibTeX entry: (Update)
C. Helmberg and K.C. Kiwiel, \A Spectral Bundle Method with Bounds," Preprint SC 9937, Konrad-Zuse-Zentrum fuer Informationstechnik Berlin, 14195 Berlin, Germany, December 1999. http://citeseer.ist.psu.edu/helmberg99spectral.html More
@techreport{ helmberg99spectral,
author = "C. Helmberg and K. Kiwiel",
title = "A Spectral Bundle Method with Bounds",
number = "SC-99-37",
address = "Berlin",
year = "1999",
url = "citeseer.ist.psu.edu/helmberg99spectral.html" }
Citations (may not include all citations):2441 The Johns Hopkins University Press (context) - Golub, van Loan - 1989
640 Princeton University Press (context) - Rockafellar - 1970
415 Improved approximation algorithms for maximum cut and satisa.. - Goemans, Williamson - 1995
121 Self-scaled barriers and interior-point methods for convex p.. (context) - Nesterov, Todd - 1997
76 A version of the bundle idea for minimizing a nonsmooth func.. (context) - Schramm, Zowe - 1992
72 Cones of matrices and set-functions and 0-1 optimization (context) - Lov, Schrijver - 1991
60 IEEE Transactions on Information Theory (context) - Lov, the et al. - 1979
35 Polynomial algorithms for perfect graphs (context) - Gr, Lov et al. - 1984
22 Primal-dual interior-point methods for semidenite programmin.. (context) - Alizadeh, Haeberly et al. - 1998
15 A spectral bundle method for semidenite programming (context) - Helmberg, Rendl - 1997
13 the Nesterov-Todd direction in semidenite programming (context) - Todd, Toh et al. - 1998
11 Solving large-scale sparse semidenite programs for combinato.. (context) - Benson, Ye et al. - 1997
9 Bundle methods to minimize the maximum eigenvalue function - Helmberg, Oustry - 1999
8 Mixed linear and semidenite programming for combinatorial an.. (context) - Benson, Ye et al. - 1998
7 Proximity control in bundle methods for convex nondi erentia.. (context) - Kiwiel - 1990
6 volume 305 of Grundlehren der mathematischen Wissenschaften (context) - Hiriart-Urruty, Lemar et al. - 1993
5 problems by semidenite programs and cutting planes (context) - Helmberg, Rendl - 1998
5 point method for semidenite programming (context) - Helmberg, Rendl et al. - 1996
4 Incorporating inequality constraints in the spectral bundle .. - Helmberg, Kiwiel et al. - 1998
2 point methods for the monotone linear complementarity proble.. (context) - Kojima, Shindoh et al. - 1997
2 scale optimization of eigenvalues (context) - Overton - 1992
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.zib.de/helmberg/): More
An Interior Point Method for Semidefinite Programming and.. - Helmberg (1994) (Correct)
The m-Cost ATSP - Helmberg (1999) (Correct)
Incorporating Inequality Constraints in the Spectral Bundle .. - Helmberg, Kiwiel, Rendl (1998) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC