Incorporating inequality constraints in the spectral bundle method

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1412, Issue , 1998, Pages 423-435

  Helmberg, Christoph ^a   Kiwiel, Krzysztof C ^b   Rendl, Franz ^c  

^a ZUSE INSTITUTE BERLIN   (Germany)

^b SYSTEMS RESEARCH INSTITUTE   (Poland)

^c GRAZ UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION; CONSTRAINT THEORY; OPTIMIZATION;

APPROXIMATE SOLUTION; COMPUTATIONAL RESULTS; CUTTING PLANE ALGORITHMS; GRAPH PARTITIONING PROBLEMS; INEQUALITY CONSTRAINT; PRIMAL-DUAL INTERIOR POINT METHODS; SEMIDEFINITE PROGRAMS; SEMIDEFINITE RELAXATION;

INTEGER PROGRAMMING;

EID: 84958750751     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-69346-7_32     Document Type: Conference Paper

References (12)

1. S. Benson, Y. Ye, and X. Zhang. Solving large-scale sparse semide_nite programs for combinatorial optimization. Working paper, Department of Management Science, University of Iowa, IA, 52242, USA, Sept. 1997.
2. 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.
3. G. H. Golub and C. F. van Loan. Matrix Computations. The Johns Hopkins University Press, 2nd edition, 1989.
4. M. Grötschel, L. Lovász, and A. Schrijver. Polynomial algorithms for perfect graphs. Annals of Discrete Mathematics, 21:325-356, 1984.
5. 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.
6. C. Helmberg and F. Rendl. A spectral bundle method for semide finite programming. ZIB Preprint SC-97-37, Konrad-Zuse-Zentrum für Informationstechnik Berlin, Aug. 1997.
7. K. C. Kiwiel. Proximity control in bundle methods for convex nondifferentiable minimization. Math. Programming, 46:105-122, 1990.
8. A. S. Lewis and M. L. Overton. Eigenvalue optimization. Acta Numerica, 149-190, 1996.
9. L. Lovász. On the Shannon capacity of a graph. IEEE Transactions on Information Theory, IT-25(1):1-7, 1979.
10. L. Lovász and A. Schrijver. Cones of matrices and set-functions and 0-1 optimization. SIAM J. Optim., 1(2):166-190, 1991.
11. 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.
12. M. J. Todd, K. C. Toh, and R. H. Tütüncü. On the Nesterov-Todd direction in semide_nite programming. Technical Report TR 1154, School of Operations Research and Industrial Engineering, Cornell University, Ithaca, New York 14853, Mar. 1996.