<?xml version="1.0" encoding="utf-8"?>
<export-example>
  <doc>
    <id>425</id>
    <completedYear/>
    <publishedYear/>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>reportzib</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>1999-10-29</completedDate>
    <publishedDate>1999-10-29</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">A Spectral Bundle Method with Bounds</title>
    <abstract language="eng">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. 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 can handle inequality constraints without seriously increasing computation time. Encouraging preliminary computational results are reported.</abstract>
    <identifier type="serial">SC-99-37</identifier>
    <identifier type="opus3-id">426</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-4256</identifier>
    <enrichment key="SourceTitle">Appeared in: Mathematical Programming 93 (2002) 173-194</enrichment>
    <author>Christoph Helmberg</author>
    <author>K.C. Kiwiel</author>
    <series>
      <title>ZIB-Report</title>
      <number>SC-99-37</number>
    </series>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Eigenvalue optimization</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>convex optimization</value>
    </subject>
    <collection role="ddc" number="000">Informatik, Informationswissenschaft, allgemeine Werke</collection>
    <collection role="msc" number="52A41">Convex functions and convex programs [See also 26B25, 90C25]</collection>
    <collection role="msc" number="65F15">Eigenvalues, eigenvectors</collection>
    <collection role="msc" number="90C06">Large-scale problems</collection>
    <collection role="msc" number="90C25">Convex programming</collection>
    <collection role="institutes" number="">ZIB Allgemein</collection>
    <file>https://opus4.kobv.de/opus4-zib/files/425/SC_99_37.orig.Vers.ps</file>
    <file>https://opus4.kobv.de/opus4-zib/files/425/SC-99-37.ps</file>
    <file>https://opus4.kobv.de/opus4-zib/files/425/SC-99-37.pdf</file>
  </doc>
</export-example>
