{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,6]],"date-time":"2022-04-06T02:56:43Z","timestamp":1649213803481},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2015,3,19]],"date-time":"2015-03-19T00:00:00Z","timestamp":1426723200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2016,3]]},"DOI":"10.1007\/s11590-015-0873-8","type":"journal-article","created":{"date-parts":[[2015,3,18]],"date-time":"2015-03-18T09:29:48Z","timestamp":1426670988000},"page":"485-497","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["An augmented Lagrangian method for binary quadratic programming based on a class of continuous functions"],"prefix":"10.1007","volume":"10","author":[{"given":"Xuewen","family":"Mu","sequence":"first","affiliation":[]},{"given":"Wenlong","family":"Liu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,3,19]]},"reference":[{"key":"873_CR1","volume-title":"Semidefinite Programming for Combinatorial Optimization","author":"C Helmberg","year":"2000","unstructured":"Helmberg, C.: Semidefinite Programming for Combinatorial Optimization. Konrad-Zuse-Zentrum fur informationstechnik, Berlin (2000)"},{"key":"873_CR2","doi-asserted-by":"crossref","first-page":"1115","DOI":"10.1145\/227683.227684","volume":"42","author":"MX Goeman","year":"1995","unstructured":"Goeman, M.X., Williamson, D.P.: Improved approximation algorithms for maximum cut and satisfiably problem using semidefinite programming. J. ACM 42, 1115\u20131145 (1995)","journal-title":"J. ACM"},{"key":"873_CR3","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1287\/opre.36.3.493","volume":"36","author":"F Barahon","year":"1998","unstructured":"Barahon, F., Grotschel, M.: An application of combinatorial optimization to statiscal optimization and circuit layout design. Oper. Res. 36, 493\u2013513 (1998)","journal-title":"Oper. Res."},{"key":"873_CR4","doi-asserted-by":"crossref","first-page":"1442","DOI":"10.1109\/49.942507","volume":"19","author":"HT Peng","year":"2001","unstructured":"Peng, H.T., Rasmussen, L.K.: The application of semidefinite programming for detection in CDMA. IEEE Select. Commun. 19, 1442\u20131449 (2001)","journal-title":"IEEE Select. Commun."},{"key":"873_CR5","doi-asserted-by":"crossref","first-page":"2775","DOI":"10.1109\/TCOMM.2004.826410","volume":"52","author":"F Hasegawa","year":"2004","unstructured":"Hasegawa, F., Luo, J., Pattipati, K., Willett, P.: Speed and accuracy comparation of techniques to solve a binary programming problem with application to syschronous CDMA. IEEE Trans. Commun. 52, 2775\u20132780 (2004)","journal-title":"IEEE Trans. Commun."},{"key":"873_CR6","doi-asserted-by":"crossref","first-page":"1364","DOI":"10.1109\/TPAMI.2003.1240111","volume":"25","author":"J Keuchel","year":"2003","unstructured":"Keuchel, J., Schnorr, C., Schellewald, C., Cremers, D.: Binary partitioning, perceptual grouping, and restoration with semidefinite programming. IEEE Trans. Pattern Anal. Mach. Intell. 25, 1364\u20131379 (2003)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"873_CR7","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/j.cviu.2008.05.010","volume":"112","author":"C Olsson","year":"2008","unstructured":"Olsson, C., Eriksson, A.P., Kahl, F.: Improved spectral relaxation methods for binary quadratic optimization problems. Comput. Vis. Image Understand. 112, 3\u201313 (2008)","journal-title":"Comput. Vis. Image Understand."},{"key":"873_CR8","unstructured":"Wu, S.P., Boyd, S.: FIR filter design via semidefinite programming and spectral factorization. In: Proc. 35th Conf. Decision and Control, Kobe, pp. 271\u2013276 (1996)"},{"key":"873_CR9","first-page":"141","volume":"9","author":"M Peinadoo","year":"1998","unstructured":"Peinadoo, M., Homer, S.: Design and performance of parallel and distributed approximation algorithms for max-cut. J. Parallel Distrib. Comput. 9, 141\u2013160 (1998)","journal-title":"J. Parallel Distrib. Comput."},{"key":"873_CR10","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1080\/10556780108805818","volume":"15","author":"S Burer","year":"2001","unstructured":"Burer, S., Monteriro, R.D.C.: A projected gradient algorithm for solving the max-cut relaxation. Optim. Methods Softw. 15, 175\u2013200 (2001)","journal-title":"Optim. Methods Softw."},{"key":"873_CR11","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1137\/S1052623400382467","volume":"12","author":"S Burer","year":"2001","unstructured":"Burer, S., Monteriro, R.D.C., Zhang, Y.: Rank-two relaxation heuristics for MAX-CUT and other binary quadratic programs. SIAM J. Optim. 12, 503\u2013521 (2001)","journal-title":"SIAM J. Optim."},{"key":"873_CR12","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1080\/10556780410001647203","volume":"19","author":"H Liu","year":"2004","unstructured":"Liu, H., Wang, X., Liu, S.: Feasible direction algorithm for solving SDP relaxation of the quadratic $$\\{-1,1\\}$$ { - 1 , 1 } programming. Optim. Methods Softw. 19, 125\u2013136 (2004)","journal-title":"Optim. Methods Softw."},{"key":"873_CR13","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/s10589-008-9218-1","volume":"47","author":"W Murray","year":"2010","unstructured":"Murray, W., Ng, K.M.: An algorithm for nonlinear optimization problems with binary variables. Comput. Optim. Appl. 47, 257\u2013288 (2010)","journal-title":"Comput. Optim. Appl."},{"key":"873_CR14","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1007\/978-1-4899-0289-4_22","volume-title":"Nonlinear Optimization and Applications","author":"PM Pardalos","year":"1996","unstructured":"Pardalos, P.M.: Continuous approaches to discrete optimization problems. In: Di, G., Giannesi, F. (eds.) Nonlinear Optimization and Applications, pp. 313\u2013328. Plenum, New York (1996)"},{"key":"873_CR15","doi-asserted-by":"crossref","first-page":"550","DOI":"10.1287\/moor.20.3.550","volume":"3","author":"S Polijak","year":"1995","unstructured":"Polijak, S., Wolkowicz, H.: Convex relaxation of (0,1)-quadratic programming. Math. Oper. Res. 3, 550\u2013561 (1995)","journal-title":"Math. Oper. Res."},{"key":"873_CR16","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1007\/s10589-007-9110-4","volume":"41","author":"SH Pan","year":"2008","unstructured":"Pan, S.H., Tan, T., Jiang, Y.: A global continuation algorithm for solving binary quadratic programming problems. Comput. Optim. Appl. 41, 349\u2013362 (2008)","journal-title":"Comput. Optim. Appl."},{"key":"873_CR17","doi-asserted-by":"crossref","first-page":"3975","DOI":"10.1016\/j.amc.2012.10.033","volume":"219","author":"JS Chen","year":"2012","unstructured":"Chen, J.S., Li, J.F., Wu, J.: A continuation approach for solving binary quadratic program based on a class of NCP-functions. Appl. Math. Comput. 219, 3975\u20133992 (2012)","journal-title":"Appl. Math. Comput."},{"key":"873_CR18","unstructured":"Liu, W.L.: Studies on algorithms for some problems in the field of communication signal processing. Doctor Dissertation, Department of Mathematics of Dalian University of Technology (2004)"},{"key":"873_CR19","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1017\/S0962492901000071","volume":"10","author":"MJ Todd","year":"2001","unstructured":"Todd, M.J.: Semidefinite optimization. Acta Numer. 10, 515\u2013560 (2001)","journal-title":"Acta Numer."},{"key":"873_CR20","doi-asserted-by":"crossref","first-page":"746","DOI":"10.1137\/S1052623496304700","volume":"8","author":"F Alizadeh","year":"1998","unstructured":"Alizadeh, F., Haeberly, J.P., Overton, M.L.: Primal-dual interior point methods for semidefinite programming: convergence rates, stability, and numerical results. SIAM J. Optim. 8, 746\u2013768 (1998)","journal-title":"SIAM J. Optim."},{"key":"873_CR21","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1093\/imanum\/8.1.141","volume":"8","author":"J Barzilai","year":"1988","unstructured":"Barzilai, J., Borwein, J.M.: Two point step size gradient methods. IMA J. Numer. Anal. 8, 141\u2013148 (1988)","journal-title":"IMA J. Numer. Anal."},{"key":"873_CR22","volume-title":"Constrained Optimization and Lagrange Multiplier Methods","author":"DP Bertsekas","year":"1982","unstructured":"Bertsekas, D.P.: Constrained Optimization and Lagrange Multiplier Methods. Academic Press, New York (1982)"},{"key":"873_CR23","unstructured":"Rinaldi, G.: Rudy graph generator (1998). http:\/\/www-user.tu-chemnitz.de\/~helmberg\/rudy.tar.gz . Accessed 12 Jan 2014"},{"key":"873_CR24","doi-asserted-by":"crossref","first-page":"673","DOI":"10.1137\/S1052623497328987","volume":"10","author":"C Helmberg","year":"2000","unstructured":"Helmberg, C., Rendle, F.: A spectral bundle method for semidefinite programming. SIAM J. Optim. 10, 673\u2013695 (2000)","journal-title":"SIAM J. Optim."},{"key":"873_CR25","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1007\/s10732-005-3603-z","volume":"11","author":"H Alperin","year":"2005","unstructured":"Alperin, H., Nowak, I.: Lagrangian smoothing heuristics for max-cut. J. Heurist. 11, 447\u2013463 (2005)","journal-title":"J. Heurist."},{"key":"873_CR26","unstructured":"Choi, C., Ye, Y.: Solving sparse semidefinite programs using the dual scaling algorithm with an iterative solver. Working paper, Department of Management Science, University of Iowa, IA (2000)"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-015-0873-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-015-0873-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-015-0873-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,22]],"date-time":"2019-08-22T03:21:17Z","timestamp":1566444077000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-015-0873-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,3,19]]},"references-count":26,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016,3]]}},"alternative-id":["873"],"URL":"https:\/\/doi.org\/10.1007\/s11590-015-0873-8","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,3,19]]}}}