{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:48:44Z","timestamp":1725490124842},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540435914"},{"type":"electronic","value":"9783540460435"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-46043-8_107","type":"book-chapter","created":{"date-parts":[[2007,8,27]],"date-time":"2007-08-27T16:57:11Z","timestamp":1188233831000},"page":"1058-1067","source":"Crossref","is-referenced-by-count":0,"title":["A Subspace Semidefinite Programming for Spectral Graph Partitioning"],"prefix":"10.1007","author":[{"given":"Suely","family":"Oliveira","sequence":"first","affiliation":[]},{"given":"David","family":"Stewart","sequence":"additional","affiliation":[]},{"given":"Takako","family":"Soma","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,4,10]]},"reference":[{"issue":"1","key":"107_CR1","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1137\/0805002","volume":"5","author":"F. Alizadeh","year":"1995","unstructured":"F. Alizadeh. Interior-point methods in semidefinite programming with applications to combinatorial optimization. SIAM Journal on Optimization, 5(1):13\u201351, 1995.","journal-title":"SIAM Journal on Optimization"},{"key":"107_CR2","volume-title":"Technical Report TR1997-737","author":"F. Alizadeh","year":"1997","unstructured":"F. Alizadeh, J.-P. A. Haeberly, M. V. Nayakkankuppam, M. L. Overton, and S. Schmieta. SDPpack user\u2019s guide \u2014 version 0.9 beta for Matlab 5.0. Technical Report TR1997-737, Computer Science Department, New York University, New York, NY, June 1997."},{"key":"107_CR3","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1090\/qam\/42792","volume":"9","author":"W. E. Arnoldi","year":"1951","unstructured":"W. E. Arnoldi. The principle of minimized iteration in the solution of the matrix eigenproblem. Quarterly Applied Mathematics, 9:17\u201329, 1951.","journal-title":"Quarterly Applied Mathematics"},{"issue":"1","key":"107_CR4","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1080\/10556789908805764","volume":"11","author":"B. Borchers","year":"1999","unstructured":"B. Borchers. CSDP, 2.3 User\u2019s Guide. Optimization Methods and Software, 11(1):597\u2013611, 1999.","journal-title":"Optimization Methods and Software"},{"issue":"1","key":"107_CR5","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1137\/0915004","volume":"15","author":"M. Crouzeix","year":"1994","unstructured":"M. Crouzeix, B. Philippe, and M. Sadkane. The Davidson method. SIAM J. Sci. Comput., 15(1):62\u201376, 1994.","journal-title":"SIAM J. Sci. Comput."},{"key":"107_CR6","first-page":"87","volume":"17","author":"E. R. Davidson","year":"1975","unstructured":"E. R. Davidson. The iterative calculation of a few of the lowest eigenvalues and corresponding eigenvectors of large real-symmetric matrices. J. Phys., 17:87\u201394, 1975.","journal-title":"J. Phys."},{"key":"107_CR7","volume-title":"Technical Report B","author":"K. Fujisawa","year":"1999","unstructured":"K. Fujisawa, M. Kojima, and K. Nakata. SDPA User\u2019s Manual \u2014 Version 4.50. Technical Report B, Department of Mathematical and Computing Science, Tokyo Institute of Technology, Tokyo, Japan, July 1999."},{"issue":"2","key":"107_CR8","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1137\/0806020","volume":"6","author":"C. Helmberg","year":"1996","unstructured":"C. Helmberg, F. Rendl, R. J. Vanderbei, and H. Wolkowicz. An interior-point method for semidefinite programming. SIAM J. Optim., 6(2):342\u2013361, 1996.","journal-title":"SIAM J. Optim."},{"key":"107_CR9","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1142\/S0129054199000162","volume":"10","author":"M. Holzrichter","year":"1999","unstructured":"M. Holzrichter and S. Oliveira. A graph based Davidson algorithm for the graph partitioning problem. International Journal of Foundations of Computer Science, 10:225\u2013246, 1999.","journal-title":"International Journal of Foundations of Computer Science"},{"key":"107_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"978","DOI":"10.1007\/BFb0097982","volume-title":"A graph based method for generating the Fiedler vector of irregular problems","author":"M. Holzrichter","year":"1999","unstructured":"M. Holzrichter and S. Oliveira. A graph based method for generating the Fiedler vector of irregular problems. In Lecture Notes in Computer Science, volume 1586, pages 978\u2013985. Springer, 1999. Proceedings of the 11th IPPS\/SPDP\u201999 workshops."},{"key":"107_CR11","doi-asserted-by":"crossref","first-page":"33","DOI":"10.6028\/jres.049.006","volume":"49","author":"C. Lanczos","year":"1952","unstructured":"C. Lanczos. Solution of systems of linear equations by minimized iterations. J. Research Nat\u2019l Bureau of Standards, 49:33\u201353, 1952.","journal-title":"J. Research Nat\u2019l Bureau of Standards"},{"key":"107_CR12","first-page":"219","volume":"63","author":"S. Oliveira","year":"1999","unstructured":"S. Oliveira. On the convergence rate of a preconditioned subspace eigensolver. Parallel Algorithms and Applications, 63:219\u2013231, 1999.","journal-title":"Parallel Algorithms and Applications"},{"key":"107_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"477","DOI":"10.1007\/3-540-45591-4_64","volume-title":"A multilevel algorithm for spectral partitioning with extended eigen-models","author":"S. Oliveira","year":"2000","unstructured":"S. Oliveira and T. Soma. A multilevel algorithm for spectral partitioning with extended eigen-models. In Lecture Notes in Computer Science, volume 1800, pages 477\u2013484. Springer, 2000. Proceedings of the 15th IPDPS 2000 workshops."},{"key":"107_CR14","unstructured":"B. N. Parlett. The Symmetric Eigenvalue Problem. Prentice-Hall, 1980."},{"issue":"1","key":"107_CR15","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/BF01100205","volume":"7","author":"S. Poljak","year":"1995","unstructured":"S. Poljak, F. Rendl, and H. Wolkowicz. A recipe for semidefinite relaxation for (0,1)-quadratic programming. J. Global Optim., 7(1):51\u201373, 1995.","journal-title":"J. Global Optim."},{"key":"107_CR16","doi-asserted-by":"crossref","unstructured":"M. V. Ramana. An exact duality theory for semidefinite programming and its complexity implications. Mathematical Programming, Ser. 1997.","DOI":"10.1007\/BF02614433"},{"key":"107_CR17","volume-title":"Technical report","author":"F. Rendl","year":"1994","unstructured":"F. Rendl. A Matlab toolbox for semidefinite programming. Technical report, Technische Universit\u00e4t Graz, Institut f\u00fcr Mathematik, Kopernikusgasse 24, A-8010 Graz, Austria, 1994."},{"key":"107_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1080\/10556789508805599","volume":"5","author":"F. Rendl","year":"1995","unstructured":"F. Rendl, R. J. Vanderbei, and H. Wolkowicz. Max-min eigenvalue problems, primal-dual interior point algorithms, and trust region subproblems. Optimization Methods and Software, 5:1\u201316, 1995.","journal-title":"Optimization Methods and Software"},{"key":"107_CR19","volume-title":"Numerical Methods for Large Eigenvalue Problems","author":"Y. Saad","year":"1992","unstructured":"Y. Saad. Numerical Methods for Large Eigenvalue Problems. Manchester University Press, Oxford Road, Manchester M13 9PL, UK, 1992."},{"issue":"2","key":"107_CR20","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1137\/S0895479894270427","volume":"17","author":"G. L. G. Sleijpen","year":"1996","unstructured":"G. L. G. Sleijpen and H. A. Van der Vorst. A Jacobi-Davidson iteration method for linear eigenvalue problems. SIAM J. Matrix Anal. Appl., 17(2):401\u2013425, 1996.","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"107_CR21","volume-title":"Technical report","author":"K. C. Toh","year":"1999","unstructured":"K. C. Toh, M. J. Todd, and P. H. T\u00fct\u00fcnc\u00fc. SDPT3 \u2014 a Matlab software package for semidefinite programming, version 2.1. Technical report, School of Operations Research and Industrial Engineering, Cornell University, Ithaca, NY, September 1999."},{"key":"107_CR22","first-page":"49","volume":"38","author":"L. Vandenberghe","year":"1996","unstructured":"L. Vandenberghe and S. Boyd. Semidefinite programming. SIAMReview, 38:49\u201395, 1996.","journal-title":"SIAMReview"},{"key":"107_CR23","volume-title":"Technical report","author":"L. Vandenberghe","year":"1998","unstructured":"L. Vandenberghe and S. Boyd. SP Software for semidefinite programming User\u2019s guide, version 1.0. Technical report, Information System Laboratory, Stanford University, Stanford, CA, November 1998."},{"key":"107_CR24","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/0024-3795(81)90143-9","volume":"40","author":"H. Wolkowicz","year":"1981","unstructured":"H. Wolkowicz. Some applications of optimization in matrix theory. Linear Algebra and its Applications, 40:101\u2013118, 1981.","journal-title":"Linear Algebra and its Applications"}],"container-title":["Lecture Notes in Computer Science","Computational Science \u2014 ICCS 2002"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46043-8_107","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T16:42:50Z","timestamp":1556815370000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46043-8_107"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540435914","9783540460435"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/3-540-46043-8_107","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}