{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,1]],"date-time":"2024-08-01T00:50:02Z","timestamp":1722473402159},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2009,3,10]],"date-time":"2009-03-10T00:00:00Z","timestamp":1236643200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2011,1]]},"DOI":"10.1007\/s10107-009-0275-8","type":"journal-article","created":{"date-parts":[[2009,3,9]],"date-time":"2009-03-09T16:09:56Z","timestamp":1236614996000},"page":"119-146","source":"Crossref","is-referenced-by-count":12,"title":["An unconstrained minimization method for solving low-rank SDP relaxations of the maxcut problem"],"prefix":"10.1007","volume":"126","author":[{"given":"Luigi","family":"Grippo","sequence":"first","affiliation":[]},{"given":"Laura","family":"Palagi","sequence":"additional","affiliation":[]},{"given":"Veronica","family":"Piccialli","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,3,10]]},"reference":[{"key":"275_CR1","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/BF01587084","volume":"44","author":"F. Barahona","year":"1989","unstructured":"Barahona F., J\u00fcnger M., Reinelt G.: Experiments in quadratic 0-1 programming. Math. Program. 44, 127\u2013137 (1989)","journal-title":"Math. Program."},{"key":"275_CR2","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/BF02574037","volume":"13","author":"A. Barvinok","year":"1995","unstructured":"Barvinok A.: Problems of distance geometry and convex properties of quadratic maps. Discrete Comput. Geometry 13, 189\u2013202 (1995)","journal-title":"Discrete Comput. Geometry"},{"issue":"2","key":"275_CR3","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1137\/S1052623497328008","volume":"10","author":"S.J. Benson","year":"2000","unstructured":"Benson S.J., Ye Y., Zhang X.: Solving large-scale sparse semidefinite programs for combinatorial optimization. SIAM J. Optim. 10(2), 443\u2013461 (2000)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"275_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1356052.1356057","volume":"34","author":"S.J. Benson","year":"2008","unstructured":"Benson S.J., Ye Y.: Algorithm 875: DSDP5\u2014software for semidefinite programming. ACM Trans. Math. Softw. 34(3), 1\u201320 (2008)","journal-title":"ACM Trans. Math. Softw."},{"key":"275_CR5","first-page":"51","volume":"72","author":"A. Ben-Tal","year":"1996","unstructured":"Ben-Tal A., Teboulle M.: Hidden convexity in some nonconvex quadratically constrained quadratic programming. Math. Program. 72, 51\u201363 (1996)","journal-title":"Math. Program."},{"key":"275_CR6","volume-title":"Nonlinear Programming","author":"D.P. Bertsekas","year":"1999","unstructured":"Bertsekas D.P.: Nonlinear Programming. Athena Scientific, Belmont (1999)"},{"issue":"2","key":"275_CR7","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1137\/S1052623400382467","volume":"12","author":"S. Burer","year":"2002","unstructured":"Burer S., Monteiro R.D.C., Zhang Y.: Rank-two relaxation heuristics for maxcut and other binary quadratic programs. SIAM J. Optim. 12(2), 503\u2013521 (2002)","journal-title":"SIAM J. Optim."},{"key":"275_CR8","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1080\/10556780108805818","volume":"15","author":"S. Burer","year":"2001","unstructured":"Burer S., Monteiro R.D.C.: A projected gradient algorithm for solving the maxcut SDP relaxation. Optim. Methods Softw. 15, 175\u2013200 (2001)","journal-title":"Optim. Methods Softw."},{"key":"275_CR9","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. Ser. B 95, 329\u2013357 (2003)","journal-title":"Math. Program. Ser. B"},{"key":"275_CR10","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1007\/s10107-004-0564-1","volume":"103","author":"S. Burer","year":"2005","unstructured":"Burer S., Monteiro R.D.C.: Local minima and convergence in low-rank semidefinite programming. Math. Program. Ser. A 103, 427\u2013444 (2005)","journal-title":"Math. Program. Ser. A"},{"issue":"3","key":"275_CR11","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1007\/BF01585184","volume":"62","author":"C. Delorme","year":"1993","unstructured":"Delorme C., Poljak S.: Laplacian eigenvalues and the maximum cut problem. Math. Program. 62(3), 557\u2013574 (1993)","journal-title":"Math. Program."},{"key":"275_CR12","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/0012-365X(90)90056-N","volume":"79","author":"C. De Simone","year":"1989","unstructured":"De Simone C.: The cut polytope and the Boolean quadric polytope. Discrete Appl. Math. 79, 71\u201375 (1989)","journal-title":"Discrete Appl. Math."},{"issue":"6","key":"275_CR13","doi-asserted-by":"crossref","first-page":"1333","DOI":"10.1137\/0327068","volume":"27","author":"G. Di Pillo","year":"1989","unstructured":"Di Pillo G., Grippo L.: Exact penalty functions in constrained optimization problems. SIAM J. Control Optim. 27(6), 1333\u20131360 (1989)","journal-title":"SIAM J. Control Optim."},{"key":"275_CR14","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"E.D. Dolan","year":"2002","unstructured":"Dolan E.D., Mor\u00e8 J.J.: Benchmarking optimization software with performance profile. Math. Program. Ser. A 91, 201\u2013213 (2002)","journal-title":"Math. Program. Ser. A"},{"key":"275_CR15","doi-asserted-by":"crossref","unstructured":"Fletcher, R.: A class of methods for nonlinear programming with termination and convergence properties. In: Abadie, J. (ed.) Integer and Nonlinear Programming, pp. 157\u2013173. North-Holland, Amsterdam (1970)","DOI":"10.1016\/B978-0-12-597050-1.50007-5"},{"key":"275_CR16","first-page":"267","volume-title":"High Performance Optimization.","author":"K. Fujisawa","year":"1999","unstructured":"Fujisawa K., Fukuda M., Kojima M., Nakata K.: Numerical evaluation of SDPA (Semidefinite Programming Algorithm). In: Frenk, H., Roos, K., Terlaky, T., Zhang, S.(eds) High Performance Optimization., pp. 267\u2013301. Kluwer, Dordrecht (1999)"},{"key":"275_CR17","first-page":"143","volume":"79","author":"M.X. Goemans","year":"1997","unstructured":"Goemans M.X.: Semidefinite programming in combinatorial optimization. Math. Program. 79, 143\u2013161 (1997)","journal-title":"Math. Program."},{"issue":"6","key":"275_CR18","doi-asserted-by":"crossref","first-page":"1115","DOI":"10.1145\/227683.227684","volume":"42","author":"M.X. Goemans","year":"1995","unstructured":"Goemans M.X., Williamson D.P.: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J. Assoc. Comput. Mach. 42(6), 1115\u20131145 (1995)","journal-title":"J. Assoc. Comput. Mach."},{"key":"275_CR19","unstructured":"Grippo, L., Palagi, L., Piccialli, V.: An unconstrained minimization method for solving low rank SDP relaxations of the maxcut problem. DIS Tech. Rep. 07-07, La Sapienza Universit\u00e0 di Roma (2007)"},{"key":"275_CR20","doi-asserted-by":"crossref","unstructured":"Grippo, L., Palagi, L., Piccialli, V.: Necessary and sufficient global optimality conditions for NLP reformulations of linear SDP problems. J. Glob. Optim. doi: 10.1007\/s10898-008-9328-4","DOI":"10.1007\/s10898-008-9328-4"},{"key":"275_CR21","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1023\/A:1020587701058","volume":"23","author":"L. Grippo","year":"2002","unstructured":"Grippo L., Sciandrone M.: Nonmonotone globalization techniques for the Barzilai-Borwein gradient method. Comput. Optim. Appl. 23, 143\u2013169 (2002)","journal-title":"Comput. Optim. Appl."},{"key":"275_CR22","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1007\/BF00927673","volume":"4","author":"M. Hestenes","year":"1969","unstructured":"Hestenes M.: Multiplier and gradient methods. J. Optim. Theory Appl. 4, 303\u2013320 (1969)","journal-title":"J. Optim. Theory Appl."},{"issue":"1","key":"275_CR23","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1006\/jpdc.1997.1381","volume":"46","author":"S. Homer","year":"1997","unstructured":"Homer S., Peinado M.: Design and performance of parallel and distributed approximation algorithms for maxcut. J. Parallel Distrib. Comput. 46(1), 48\u201361 (1997)","journal-title":"J. Parallel Distrib. Comput."},{"key":"275_CR24","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511810817","volume-title":"Matrix Analysis","author":"R.A. Horn","year":"1985","unstructured":"Horn R.A., Johnson C.R.: Matrix Analysis. Cambridge University Press, Cambridge (1985)"},{"key":"275_CR25","volume-title":"Topics in Matrix Analysis","author":"R.A. Horn","year":"1986","unstructured":"Horn R.A., Johnson C.R.: Topics in Matrix Analysis. Cambridge University Press, New York (1986)"},{"key":"275_CR26","first-page":"225","volume":"77","author":"M. Laurent","year":"1997","unstructured":"Laurent M., Poljak S., Rendl F.: Connections between semidefinite relaxations of the maxcut and stable set problems. Math. Program. 77, 225\u2013246 (1997)","journal-title":"Math. Program."},{"key":"275_CR27","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":"275_CR28","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1080\/10556789308805542","volume":"2","author":"J. Mor\u00e9","year":"1993","unstructured":"Mor\u00e9 J.: Generalization of the trust region problem. Optim. Methods Softw. 2, 189\u2013209 (1993)","journal-title":"Optim. Methods Softw."},{"key":"275_CR29","doi-asserted-by":"crossref","unstructured":"Nesterov, Yu., Nemirovskii, A.: Interior-Point Polynomial Algorithms in Convex Programming. Society for Industrial and Applied Mathematics (SIAM), Philadelphia (1994)","DOI":"10.1137\/1.9781611970791"},{"key":"275_CR30","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1287\/moor.23.2.339","volume":"23","author":"G. Pataki","year":"1998","unstructured":"Pataki G.: On the rank of extreme matrices in semidefinite programs and the multiplicity of optimal eigenvalues. Math. Oper. Res. 23, 339\u2013358 (1998)","journal-title":"Math. Oper. Res."},{"key":"275_CR31","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1007\/BF01100205","volume":"7","author":"S. Poljak","year":"1995","unstructured":"Poljak S., Rendl F., Wolkowicz H.: A recipe for semidefinite relaxation for 0-1 quadratic programming. J. Glob. Optim. 7, 51\u201373 (1995)","journal-title":"J. Glob. Optim."},{"key":"275_CR32","unstructured":"Poljak, S., Tuza, Z.: Maximum cuts and largest bipartite subgraphs. In: Combinatorial Optimization. In: Cook, W., Lov\u2019asz, L., Seymour, P. (eds.) DIMACS Series in Disc. Math. and Theor. Comp. Sci. AMS, Providence (1995)"},{"key":"275_CR33","first-page":"283","volume-title":"Optimization","author":"M.J.D. Powell","year":"1969","unstructured":"Powell M.J.D.: A method for nonlinear constraints in minimization problem. In: Fletcher, R.(eds) Optimization, pp. 283\u2013298. Academic Press, New York (1969)"},{"key":"275_CR34","unstructured":"Rinaldi, G.: Rudy (1998). http:\/\/www-user.tu-chemnitz.de\/~helmberg\/sdp_software.html"},{"issue":"2","key":"275_CR35","doi-asserted-by":"crossref","first-page":"286","DOI":"10.1137\/0805016","volume":"5","author":"R. Stern","year":"1995","unstructured":"Stern R., Wolkowicz H.: Indefinite trust region subproblems and nonsymmetric eigenvalue perturbations. SIAM J. Optim. 5(2), 286\u2013313 (1995)","journal-title":"SIAM J. Optim."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-009-0275-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-009-0275-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-009-0275-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T09:50:06Z","timestamp":1559123406000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-009-0275-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,3,10]]},"references-count":35,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2011,1]]}},"alternative-id":["275"],"URL":"https:\/\/doi.org\/10.1007\/s10107-009-0275-8","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,3,10]]}}}