(Enter summary)
Abstract: . Semidefinite relaxations of quadratic 0-1 programming or
graph partitioning problems are well known to be of high quality. However,
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, approximate
solutions to structured, large equality constrained semidefinite
programs if the trace of the primal matrix variable is fixed. The latter
property holds... (Update)
Context of citations to this paper: More
...convergence. Together with K.C. Kiwiel we are currently working on alternative methods for incorporating sign constraints on y [13]. The backbone of the method is an efficient routine for computing the maximal eigenvalue of huge structured symmetric matrices. Although...
.... hAm ; Xi 3 7 7 5 and A T y = m X i=1 y i A i ; A preliminary version of this paper appeared in the proceedings of IPCO 98 [7]. y Konrad Zuse Zentrum f ur Informationstechnik Berlin, Takustra e 7, D 14195 Berlin, Germany, helmberg zib.de, http: www.zib.de helmberg z...
Cited by: More
Semidefinite and Cone Programming Bibliography/Comments - Wolkowicz (2004)
(Correct)
Semidefinite Programming - Helmberg (1999)
(Correct)
A Spectral Bundle Method with Bounds - Helmberg, Kiwiel (1999)
(Correct)
Similar documents (at the sentence level):
32.5%: Incorporating Inequality Constraints in the Spectral Bundle.. - Helmberg Kiwiel (1998)
(Correct)
Active bibliography (related documents): More All
0.0: Semidefinite Optimization - Todd (2001)
(Correct)
0.0: DSDP5: Software for Semidefinite Programming - Benson, Ye (2005)
(Correct)
0.0: Optimizing dominant time constant in RC circuits - Vandenberghe, Boyd, Gamal (1996)
(Correct)
System load high. Please wait...
Timeout. Please try your query later.
Similar documents based on text: More All
0.9: A Spectral Bundle Method for Semidefinite Programming - Helmberg, Rendl (1997)
(Correct)
0.7: Numerical Evaluation of SBmethod - Helmberg (2001)
(Correct)
0.4: SBmethod - A C++ Implementation of the Spectral Bundle Method.. - Helmberg (2000)
(Correct)
Related documents from co-citation: More All
4: Cones of matrices and set-functions and 0-1 optimization (context) - Lov'asz, Schrijver - 1991
4: Improved approximation algorithms for maximum cut and satisfiability problems us..
- GOEMANS, WILLIAMSON - 1995
4: Polynomial convergence of primal-dual algorithms for semidefinite programming ba..
- Monteiro - 1996
BibTeX entry: (Update)
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'ios-Mercado, eds., vol. 1412 of Lecture Notes in Computer Science, Springer, June 1998, pp. 423--435. http://citeseer.ist.psu.edu/helmberg98incorporating.html More
@article{ helmberg98incorporating,
author = "Christoph Helmberg and Krzysztof C. Kiwiel and Franz Rendl",
title = "Incorporating Inequality Constraints in the Spectral Bundle Method",
journal = "Lecture Notes in Computer Science",
volume = "1412",
pages = "423--??",
year = "1998",
url = "citeseer.ist.psu.edu/helmberg98incorporating.html" }
Citations (may not include all citations):
71
Solving large-scale sparse semidefinite programs for combina..
- Benson, Ye et al. - 1997 ACM
Documents on the same site (http://www.zib.de/helmberg/index.html): More
An Interior Point Method for Semidefinite Programming and.. - Helmberg (1994)
(Correct)
The m-Cost ATSP - Helmberg (1999)
(Correct)
A Spectral Bundle Method with Bounds - Helmberg, Kiwiel (1999)
(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