{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T03:09:52Z","timestamp":1761620992041},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2008,6,4]],"date-time":"2008-06-04T00:00:00Z","timestamp":1212537600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2010,5]]},"DOI":"10.1007\/s10589-008-9187-4","type":"journal-article","created":{"date-parts":[[2008,6,3]],"date-time":"2008-06-03T15:16:13Z","timestamp":1212506173000},"page":"1-29","source":"Crossref","is-referenced-by-count":8,"title":["A parallel interior point decomposition algorithm for\u00a0block angular semidefinite programs"],"prefix":"10.1007","volume":"46","author":[{"given":"Kartik Krishnan","family":"Sivaramakrishnan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,6,4]]},"reference":[{"key":"9187_CR1","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1137\/S1052623497328008","volume":"10","author":"S. Benson","year":"2000","unstructured":"Benson, S., Ye, Y., Zhang, X.: Solving large scale sparse semidefinite programs for combinatorial optimization. SIAM J. Optim. 10, 443\u2013461 (2000)","journal-title":"SIAM J. Optim."},{"key":"9187_CR2","volume-title":"Nonlinear Programming","author":"D.P. Bertsekas","year":"1999","unstructured":"Bertsekas, D.P.: Nonlinear Programming, 2nd edn. Athena Scientific, Belmont (1999)","edition":"2"},{"key":"9187_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/978-1-4613-8369-7_1","volume-title":"Graph Theory and Sparse Matrix Computation","author":"J.R.S. Blair","year":"1993","unstructured":"Blair, J.R.S., Peyton, B.: An introduction to chordal graphs and clique trees. In: George, A., Gilbert, J.R., Liu, J.W.H. (eds.) Graph Theory and Sparse Matrix Computation, pp. 1\u201329. Springer, New York (1993)"},{"key":"9187_CR4","doi-asserted-by":"crossref","first-page":"613","DOI":"10.1080\/10556789908805765","volume":"11\u201312","author":"B. Borchers","year":"1999","unstructured":"Borchers, B.: CSDP, a C library for semidefinite programming. Optim. Methods Softw. 11\u201312, 613\u2013623 (1999). Available at https:\/\/projects.coin-or.org\/Csdp\/","journal-title":"Optim. Methods Softw."},{"key":"9187_CR5","first-page":"683","volume":"11","author":"B. Borchers","year":"1999","unstructured":"Borchers, B.: SDPLIB 1.2. A library of semidefinite programming test problems, Optim. Methods Softw. 11, 683\u2013690 (1999). Available at http:\/\/infohost.nmt.edu\/~sdplib\/","journal-title":"A library of semidefinite programming test problems, Optim. Methods Softw."},{"key":"9187_CR6","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1007\/s10589-007-9030-3","volume":"37","author":"B. Borchers","year":"2007","unstructured":"Borchers, B., Young, J.: Implementation of a primal-dual method for SDP on a shared memory parallel architecture. Comput. Optim. Appl. 37, 355\u2013369 (2007)","journal-title":"Comput. Optim. Appl."},{"key":"9187_CR7","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1007\/s10107-002-0352-8","volume":"95","author":"S. Burer","year":"2003","unstructured":"Burer, S., Monteiro, R.D.C.: A nonlinear programming algorithm for solving semidefinite programs via low rank factorization. Math. Program. 95, 329\u2013357 (2003)","journal-title":"Math. Program."},{"key":"9187_CR8","unstructured":"ILOG CPLEX: High performance software for mathematical programming. http:\/\/www.ilog.com\/products\/cplex\/"},{"key":"9187_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/b105286","volume-title":"Aspects of Semidefinite Programming: Interior Point Algorithms and Selected Applications","author":"E. Klerk de","year":"2002","unstructured":"de Klerk, E.: Aspects of Semidefinite Programming: Interior Point Algorithms and Selected Applications. Kluwer Academic, Dordrecht (2002)"},{"key":"9187_CR10","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1080\/10556780512331319523","volume":"21","author":"K. Fujisawa","year":"2006","unstructured":"Fujisawa, K., Fukuda, M., Nakata, K.: Preprocessing sparse semidefinite programs via matrix completion. Optim. Methods Softw. 21, 17\u201339 (2006)","journal-title":"Optim. Methods Softw."},{"key":"9187_CR11","doi-asserted-by":"crossref","first-page":"647","DOI":"10.1137\/S1052623400366218","volume":"11","author":"M. Fukuda","year":"2000","unstructured":"Fukuda, M., Kojima, M., Murota, K., Nakata, K.: Exploiting sparsity in semidefinite programming via matrix completion I: general framework. SIAM J. Optim. 11, 647\u2013674 (2000)","journal-title":"SIAM J. Optim."},{"key":"9187_CR12","doi-asserted-by":"crossref","first-page":"1115","DOI":"10.1145\/227683.227684","volume":"42","author":"M. Goemans","year":"1995","unstructured":"Goemans, M., Williamson, D.P.: Improved approximation algorithms for max cut and satisfiability problems using semidefinite programming. J. Assoc. Comput. Mach. 42, 1115\u20131145 (1995)","journal-title":"J. Assoc. Comput. Mach."},{"key":"9187_CR13","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/0024-3795(84)90207-6","volume":"58","author":"R. Grone","year":"1984","unstructured":"Grone, R., Johnson, C.R., S\u00e1, E.M., Wolkowicz, H.: Positive definite completions of partial Hermitian matrices. Linear Algebra Appl. 58, 109\u2013124 (1984)","journal-title":"Linear Algebra Appl."},{"key":"9187_CR14","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1007\/s10107-002-0354-6","volume":"95","author":"C. Helmberg","year":"2003","unstructured":"Helmberg, C.: Numerical evaluation of spectral bundle method. Math. Program. 95, 381\u2013406 (2003)","journal-title":"Math. Program."},{"key":"9187_CR15","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/s101070100270","volume":"93","author":"C. Helmberg","year":"2002","unstructured":"Helmberg, C., Kiwiel, K.C.: A spectral bundle method with bounds. Math. Program. 93, 173\u2013194 (2002)","journal-title":"Math. Program."},{"key":"9187_CR16","doi-asserted-by":"crossref","first-page":"673","DOI":"10.1137\/S1052623497328987","volume":"10","author":"C. Helmberg","year":"2000","unstructured":"Helmberg, C., Rendl, F.: A spectral bundle method for semidefinite programming. SIAM J. Optim. 10, 673\u2013696 (2000)","journal-title":"SIAM J. Optim."},{"key":"9187_CR17","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-06409-2","volume-title":"Convex Analysis and Minimization Algorithms, vol.\u00a0II","author":"J.B. Hiriart-Urruty","year":"1993","unstructured":"Hiriart-Urruty, J.B., Lemar\u00e9chal, C.: Convex Analysis and Minimization Algorithms, vol.\u00a0II. Springer, Berlin (1993)"},{"key":"9187_CR18","doi-asserted-by":"crossref","first-page":"320","DOI":"10.1007\/BF02591907","volume":"27","author":"K.C. Kiwiel","year":"1983","unstructured":"Kiwiel, K.C.: An aggregate subgradient method for nonsmooth convex minimization. Math. Program. 27, 320\u2013341 (1983)","journal-title":"Math. Program."},{"key":"9187_CR19","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/BF01585731","volume":"46","author":"K.C. Kiwiel","year":"1990","unstructured":"Kiwiel, K.C.: Proximity control in bundle methods for convex nondifferentiable optimization. Math. Program. 46, 105\u2013122 (1990)","journal-title":"Math. Program."},{"key":"9187_CR20","doi-asserted-by":"crossref","unstructured":"Langbort, C., D\u2019Andrea, R., Xiao, L., Boyd, S.: A decomposition approach to distributed analysis of networked systems. In: Proceedings of the 43rd IEEE Conference on Decision and Control, pp.\u00a03980\u20133985","DOI":"10.1109\/CDC.2004.1429372"},{"key":"9187_CR21","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1137\/050622067","volume":"18","author":"S. Mehrotra","year":"2007","unstructured":"Mehrotra, S., \u00d6zevin, M.G.: Decomposition based interior point methods for two-stage stochastic semidefinite programming. SIAM J. Optim. 18, 206\u2013222 (2007)","journal-title":"SIAM J. Optim."},{"key":"9187_CR22","unstructured":"Karypis, G., Kumar, V.: METIS\u2014A software package for partitioning unstructured graphs, partitioning meshes, and computing fill-reducing orderings of sparse matrices, version 4.0. Department of Computer Science, University of Minnesota (1998). Available at http:\/\/glaros.dtc.umn.edu\/gkhome\/views\/metis"},{"key":"9187_CR23","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1007\/s10107-003-0451-1","volume":"97","author":"R.D.C. Monteiro","year":"2003","unstructured":"Monteiro, R.D.C.: First and second order methods for semidefinite programming. Math. Program. 97, 209\u2013244 (2003)","journal-title":"Math. Program."},{"key":"9187_CR24","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1007\/s10107-002-0351-9","volume":"95","author":"K. Nakata","year":"2003","unstructured":"Nakata, K., Fujisawa, K., Fukuda, M., Kojima, M., Murota, K.: Exploiting sparsity in semidefinite programming via matrix completion II: Implementation and numerical results. Math. Program. 95, 303\u2013327 (2003)","journal-title":"Math. Program."},{"key":"9187_CR25","doi-asserted-by":"crossref","first-page":"477","DOI":"10.1007\/s10107-006-0032-1","volume":"109","author":"M.V. Nayakkankuppam","year":"2007","unstructured":"Nayakkankuppam, M.V.: Solving large-scale semidefinite programs in parallel. Math. Program. 109, 477\u2013504 (2007)","journal-title":"Math. Program."},{"key":"9187_CR26","doi-asserted-by":"crossref","DOI":"10.1007\/3-7643-7374-1","volume-title":"Relaxation and Decomposition Methods for Mixed Integer Nonlinear Programming","author":"I. Nowak","year":"2005","unstructured":"Nowak, I.: Relaxation and Decomposition Methods for Mixed Integer Nonlinear Programming. Birkh\u00e4user, Basel (2005)"},{"key":"9187_CR27","volume-title":"Parallel Programming with MPI","author":"P.S. Pacheco","year":"1997","unstructured":"Pacheco, P.S.: Parallel Programming with MPI. Morgan Kaufmann, San Mateo (1997)"},{"key":"9187_CR28","doi-asserted-by":"crossref","DOI":"10.1515\/9781400841059","volume-title":"Nonlinear Optimization","author":"A. Ruszczy\u0144ski","year":"2006","unstructured":"Ruszczy\u0144ski, A.: Nonlinear Optimization. Princeton University Press, Princeton (2006)"},{"key":"9187_CR29","series-title":"Handbooks in Operations Research and Management Science","volume-title":"Stochastic Programming","year":"2003","unstructured":"Ruszczy\u0144ski, A., Shapiro, A. (eds.): Stochastic Programming. Handbooks in Operations Research and Management Science, vol.\u00a010. Elsevier, Amsterdam (2003)"},{"key":"9187_CR30","doi-asserted-by":"crossref","first-page":"625","DOI":"10.1080\/10556789908805766","volume":"11\u201312","author":"J.F. Sturm","year":"1999","unstructured":"Sturm, J.F.: Using SeDuMi 1.02, a Matlab toolbox for optimization over symmetric cones. Optim. Methods Softw. 11\u201312, 625\u2013653 (1999). Available at http:\/\/sedumi.mcmaster.ca\/","journal-title":"Optim. Methods Softw."},{"key":"9187_CR31","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/s10107-002-0347-5","volume":"95","author":"R.H. T\u00fct\u00fcnc\u00fc","year":"2003","unstructured":"T\u00fct\u00fcnc\u00fc, R.H., Toh, K.C., Todd, M.J.: Solving semidefinite-quadratic-linear programs using SDPT3. Math. Program. 95, 189\u2013217 (2003). Available at http:\/\/www.math.nus.edu.sg\/~mattohkc\/sdpt3.html","journal-title":"Math. Program."},{"key":"9187_CR32","unstructured":"SPOOLES 2.2: Sparse Object Oriented Linear Equations Solver. Available at http:\/\/www.netlib.org\/linalg\/spooles\/spooles.2.2.html"},{"key":"9187_CR33","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1137\/050623802","volume":"17","author":"H. Waki","year":"2006","unstructured":"Waki, H., Kim, S., Kojima, M., Muramatsu, M.: Sums of squares and semidefinite programming for polynomial optimization problems with structured sparsity. SIAM J. Optim. 17, 218\u2013242 (2006)","journal-title":"SIAM J. Optim."},{"key":"9187_CR34","doi-asserted-by":"crossref","first-page":"1053","DOI":"10.1016\/S0167-8191(03)00087-5","volume":"29","author":"M. Yamashita","year":"2003","unstructured":"Yamashita, M., Fujisawa, K., Kojima, M.: SDPARA: SemiDefinite Programming Algorithm PARAllel version. Parallel Comput. 29, 1053\u20131067 (2003). Available at http:\/\/grid.r.dendai.ac.jp\/sdpa\/sdpa.6.00\/sdpara.index.html","journal-title":"Parallel Comput."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-008-9187-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-008-9187-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-008-9187-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,11]],"date-time":"2021-09-11T14:36:45Z","timestamp":1631371005000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-008-9187-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,6,4]]},"references-count":34,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2010,5]]}},"alternative-id":["9187"],"URL":"https:\/\/doi.org\/10.1007\/s10589-008-9187-4","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,6,4]]}}}