{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:20:14Z","timestamp":1725488414936},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540645900"},{"type":"electronic","value":"9783540693468"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/3-540-69346-7_32","type":"book-chapter","created":{"date-parts":[[2007,8,2]],"date-time":"2007-08-02T11:51:29Z","timestamp":1186055489000},"page":"423-435","source":"Crossref","is-referenced-by-count":5,"title":["Incorporating Inequality Constraints in the Spectral Bundle Method"],"prefix":"10.1007","author":[{"given":"Christoph","family":"Helmberg","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Krzysztof C.","family":"Kiwiel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Franz","family":"Rendl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[1998,6,18]]},"reference":[{"key":"32_CR1","volume-title":"Solving large-scale sparse semidefinite programs for combinatorial optimization","author":"S. Benson","year":"1997","unstructured":"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."},{"key":"32_CR2","doi-asserted-by":"publisher","first-page":"1115","DOI":"10.1145\/227683.227684","volume":"42","author":"M. X. Goemans","year":"1995","unstructured":"M. X. Goemans and D. P. Williamson. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J. ACM, 42:1115\u20131145, 1995.","journal-title":"J. ACM"},{"key":"32_CR3","unstructured":"G. H. Golub and C. F. van Loan. Matrix Computations. The Johns Hopkins University Press, 2nd edition, 1989."},{"key":"32_CR4","first-page":"325","volume":"21","author":"M. Gr\u00f6tschel","year":"1984","unstructured":"M. Gr\u00f6tschel, L. Lov\u00e1sz, and A. Schrijver. Polynomial algorithms for perfect graphs. Annals of Discrete Mathematics, 21:325\u2013356, 1984.","journal-title":"Annals of Discrete Mathematics"},{"key":"32_CR5","unstructured":"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\u00fcr Informationstechnik Berlin, Nov. 1995. To appear in Math. Programming."},{"key":"32_CR6","unstructured":"C. Helmberg and F. Rendl. A spectral bundle method for semidefinite programming. ZIB Preprint SC-97-37, Konrad-Zuse-Zentrum f\u00fcr Informationstechnik Berlin, Aug. 1997."},{"key":"32_CR7","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/BF01585731","volume":"46","author":"K. C. Kiwiel","year":"1990","unstructured":"K. C. Kiwiel. Proximity control in bundle methods for convex nondifferentiable minimization. Math. Programming, 46:105\u2013122, 1990.","journal-title":"Math. Programming"},{"key":"32_CR8","doi-asserted-by":"crossref","unstructured":"A. S. Lewis and M. L. Overton. Eigenvalue optimization. Acta Numerica, 149\u2013190, 1996.","DOI":"10.1017\/S0962492900002646"},{"issue":"1","key":"32_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TIT.1979.1055985","volume":"IT-25","author":"L. Lov\u00e1sz","year":"1979","unstructured":"L. Lov\u00e1sz. On the Shannon capacity of a graph. IEEE Transactions on Information Theory, IT-25(1):1\u20137, 1979.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"2","key":"32_CR10","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1137\/0801013","volume":"1","author":"L. Lov\u00e1sz","year":"1991","unstructured":"L. Lov\u00e1sz and A. Schrijver. Cones of matrices and set-functions and 0\u20131 optimization. SIAM J. Optim., 1(2):166\u2013190, 1991.","journal-title":"SIAM J. Optim."},{"key":"32_CR11","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1137\/0802008","volume":"2","author":"H. Schramm","year":"1992","unstructured":"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\u2013152, 1992.","journal-title":"SIAM J. Optim."},{"key":"32_CR12","series-title":"Technical Report","volume-title":"On the Nesterov-Todd direction in semidefinite programming","author":"M. J. Todd","year":"1996","unstructured":"M. J. Todd, K. C. Toh, and R. H. T\u00fct\u00fcnc\u00fc. 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."}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-69346-7_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,17]],"date-time":"2019-02-17T17:00:16Z","timestamp":1550422816000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-69346-7_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540645900","9783540693468"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-69346-7_32","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1998]]}}}