{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:26:01Z","timestamp":1740122761436,"version":"3.37.3"},"reference-count":50,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2021,1,2]],"date-time":"2021-01-02T00:00:00Z","timestamp":1609545600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,1,2]],"date-time":"2021-01-02T00:00:00Z","timestamp":1609545600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11871002","11671387","11688101"],"award-info":[{"award-number":["11871002","11671387","11688101"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"General Program of Science and Technology of Beijing Municipal Education Commission","award":["KM201810005004"],"award-info":[{"award-number":["KM201810005004"]}]},{"DOI":"10.13039\/501100010903","name":"Key Programme","doi-asserted-by":"publisher","award":["11531014"],"award-info":[{"award-number":["11531014"]}],"id":[{"id":"10.13039\/501100010903","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Beijing Natural Science Foundation","award":["Z190002"],"award-info":[{"award-number":["Z190002"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2021,4]]},"DOI":"10.1007\/s10589-020-00252-5","type":"journal-article","created":{"date-parts":[[2021,1,2]],"date-time":"2021-01-02T10:03:09Z","timestamp":1609581789000},"page":"825-851","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A proximal DC approach for quadratic assignment problem"],"prefix":"10.1007","volume":"78","author":[{"given":"Zhuoxuan","family":"Jiang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xinyuan","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4228-6700","authenticated-orcid":false,"given":"Chao","family":"Ding","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,1,2]]},"reference":[{"key":"252_CR1","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s10107-018-1235-y","volume":"169","author":"LTH An","year":"2018","unstructured":"An, L.T.H., Tao, P.D.: DC programming and DCA: thirty years of developments. Math. Program. 169, 5\u201368 (2018)","journal-title":"Math. Program."},{"key":"252_CR2","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1007\/s10898-011-9765-3","volume":"52","author":"LTH An","year":"2012","unstructured":"An, L.T.H., Tao, P.D., Huynh, V.N.: Exact penalty and error bounds in DC programming. J. Global Optim. 52, 509\u2013535 (2012)","journal-title":"J. Global Optim."},{"key":"252_CR3","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/s10107-003-0437-z","volume":"97","author":"K Anstreicher","year":"2003","unstructured":"Anstreicher, K.: Recent advances in the solution of quadratic assignment problems. Math. Program. 97, 27\u201342 (2003)","journal-title":"Math. Program."},{"key":"252_CR4","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1137\/S0895479898340299","volume":"22","author":"K Anstreicher","year":"2000","unstructured":"Anstreicher, K., Wolkowicz, H.: On Lagrangian relaxation of quadratic matrix constraints. SIAM J. Matrix Anal. Appl. 22, 41\u201355 (2000)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"252_CR5","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s10107-007-0133-5","volume":"116","author":"H Attouch","year":"2009","unstructured":"Attouch, H., Bolte, J.: On the convergence of the proximal algorithm for nonsmooth functions involving analytic features. Math. Program. 116, 5\u201316 (2009)","journal-title":"Math. Program."},{"key":"252_CR6","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1287\/moor.1100.0449","volume":"35","author":"H Attouch","year":"2010","unstructured":"Attouch, H., Bolte, J., Redont, P., Soubeyran, A.: Proximal alternating minimization and projection methods for nonconvex problems: an approach based on the Kurdyka\u2013\u0141ojasiewicz inequality. Math. Oper. Res. 35, 438\u2013457 (2010)","journal-title":"Math. Oper. Res."},{"key":"252_CR7","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718829","volume-title":"Lectures on modern convex optimization: analysis, algorithms, and engineering applications","author":"A Ben-Tal","year":"2001","unstructured":"Ben-Tal, A., Nemirovski, A.: Lectures on modern convex optimization: analysis, algorithms, and engineering applications, vol. 2. Society for Industrial Mathematics, Philadelphia (2001)"},{"key":"252_CR8","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1016\/j.orl.2016.03.002","volume":"44","author":"SJ Bi","year":"2016","unstructured":"Bi, S.J., Pan, S.H.: Error bounds for rank constrained optimization problems and applications. Oper. Res. Lett. 44, 336\u2013341 (2016)","journal-title":"Oper. Res. Lett."},{"key":"252_CR9","doi-asserted-by":"publisher","first-page":"1205","DOI":"10.1137\/050644641","volume":"17","author":"J Bolte","year":"2007","unstructured":"Bolte, J., Daniilidis, A., Lewis, A.S.: The \u0141ojasiewicz inequality for nonsmooth subanalytic functions with applications to subgradient dynamical systems. SIAM J. Optim. 17, 1205\u20131223 (2007)","journal-title":"SIAM J. Optim."},{"key":"252_CR10","doi-asserted-by":"publisher","first-page":"556","DOI":"10.1137\/060670080","volume":"18","author":"J Bolte","year":"2007","unstructured":"Bolte, J., Daniilidis, A., Lewis, A.S., Shiota, M.: Clarke subgradients of stratifiable functions. SIAM J. Optim. 18, 556\u2013572 (2007)","journal-title":"SIAM J. Optim."},{"key":"252_CR11","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1287\/moor.2015.0735","volume":"41","author":"J Bolte","year":"2016","unstructured":"Bolte, J., Pauwels, E.: Majorization-minimization procedures and convergence of SQP methods for semi-algebraic and tame programs. Math. Oper. Res. 41, 442\u2013465 (2016)","journal-title":"Math. Oper. Res."},{"key":"252_CR12","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/s10107-013-0701-9","volume":"146","author":"J Bolte","year":"2014","unstructured":"Bolte, J., Sabach, S., Teboulle, M.: Proximal alternating linearized minimization for nonconvex and nonsmooth problems. Math. Program. 146, 459\u2013494 (2014)","journal-title":"Math. Program."},{"key":"252_CR13","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1007\/s10107-008-0223-z","volume":"120","author":"S Burer","year":"2009","unstructured":"Burer, S.: On the copositive representation of binary and continuous nonconvex quadratic programs. Math. Program. 120, 479\u2013495 (2009)","journal-title":"Math. Program."},{"key":"252_CR14","doi-asserted-by":"publisher","first-page":"2741","DOI":"10.1007\/978-1-4419-7997-1_22","volume-title":"Handbook of Combinatorial Optimization","author":"P Burkard","year":"2013","unstructured":"Burkard, P.: Quadratic assignment problems. In: Pardalos, P.M., Du, D.Z., Graham, R.L. (eds.) Handbook of Combinatorial Optimization, pp. 2741\u20132814. Springer, New York (2013)"},{"key":"252_CR15","doi-asserted-by":"publisher","first-page":"572","DOI":"10.1006\/jcss.1998.1608","volume":"58","author":"F Buss","year":"1999","unstructured":"Buss, F., Frandsen, G.S., Shallit, J.O.: The computational complexity of some problems of linear algebra. J. Comput. Syst. Sci. 58, 572\u2013596 (1999)","journal-title":"J. Comput. Syst. Sci."},{"key":"252_CR16","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-87821-8","volume-title":"Implicit functions and solution mappings\u2014a view from variational analysis","author":"AL Dontchev","year":"2009","unstructured":"Dontchev, A.L., Rockafellar, R.T.: Implicit functions and solution mappings\u2014a view from variational analysis. Springer, Berlin (2009)"},{"key":"252_CR17","first-page":"345","volume-title":"The quadratic assignment problem, location science","author":"Z Drezner","year":"2015","unstructured":"Drezner, Z.: The quadratic assignment problem, location science, pp. 345\u2013363. Springer, New York (2015)"},{"key":"252_CR18","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/s10479-005-3444-z","volume":"139","author":"Z Drezner","year":"2005","unstructured":"Drezner, Z., Hahn, P., Taillard, \u00c9.D.: Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods. Oper. Res. 139, 65\u201394 (2005)","journal-title":"Oper. Res."},{"key":"252_CR19","series-title":"RAAG notes","volume-title":"An Introduction to o-minimal geometry","author":"M Coste","year":"1999","unstructured":"Coste, M.: An Introduction to o-minimal geometry. RAAG notes. Institut de Recherche Math\u00e9matiques de Rennes, Rennes (1999)"},{"key":"252_CR20","doi-asserted-by":"publisher","first-page":"391","DOI":"10.4208\/jcm.1708-m2017-0130","volume":"36","author":"T Fu","year":"2018","unstructured":"Fu, T., Ge, D., Ye, Y.: On doubly positive semidefinite programming relaxations. J. Comput. Math. 36, 391\u2013403 (2018)","journal-title":"J. Comput. Math."},{"key":"252_CR21","unstructured":"Gao, Y.: Structured low rank matrix optimization problems: a penalized approach. PhD thesis, National University of Singapore (2010)"},{"key":"252_CR22","unstructured":"Gao, Y., Sun, D.F.: A majorized penalty approach for calibrating rank constrained correlation matrix problems. http:\/\/www.mypolyuweb.hk\/~dfsun\/MajorPen_May5.pdf (Preprint) (2010)"},{"key":"252_CR23","unstructured":"Hahn, P., Anjos, M.: QAPLIB\u2014a quadratic assignment problem library. http:\/\/www.seas.upenn.edu\/qaplib"},{"key":"252_CR24","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511810817","volume-title":"Matrix analysis","author":"RA Horn","year":"1985","unstructured":"Horn, R.A., Johnson, C.R.: Matrix analysis. Cambridge Univeristy Press, New York (1985)"},{"key":"252_CR25","doi-asserted-by":"publisher","first-page":"1894","DOI":"10.1137\/080722059","volume":"19","author":"AD Ioffe","year":"2009","unstructured":"Ioffe, A.D.: An invitation to tame optimization. SIAM J. Optim. 19, 1894\u20131917 (2009)","journal-title":"SIAM J. Optim."},{"key":"252_CR26","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/s10107-015-0874-5","volume":"156","author":"S Kim","year":"2016","unstructured":"Kim, S., Kojima, M., Toh, K.C.: A Lagrangian-DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems. Math. Program. 156, 161\u2013187 (2016)","journal-title":"Math. Program."},{"key":"252_CR27","doi-asserted-by":"publisher","first-page":"53","DOI":"10.2307\/1907742","volume":"25","author":"TC Koopmans","year":"1957","unstructured":"Koopmans, T.C., Beckmann, M.J.: Assignment problems and the location of economics activities. Econometrica 25, 53\u201376 (1957)","journal-title":"Econometrica"},{"key":"252_CR28","doi-asserted-by":"publisher","first-page":"1641","DOI":"10.1137\/090771181","volume":"21","author":"Q Li","year":"2011","unstructured":"Li, Q., Qi, H.-D.: A sequential semismooth newton method for the nearest low-rank correlation matrix problem. SIAM J. Optim. 21, 1641\u20131666 (2011)","journal-title":"SIAM J. Optim."},{"key":"252_CR29","unstructured":"Lin, C.-J., Saigal, R.: On solving large-scale semidefinite programming problems a case study of quadratic assignment problem. Technical report, Department of Industrial and Operations Engineering, University of Michigan, Ann Arbor, MI (1997)"},{"key":"252_CR30","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/s10589-019-00067-z","volume":"73","author":"T Liu","year":"2019","unstructured":"Liu, T., Pong, T.K., Takeda, A.: A refined convergence analysis of with applications to simultaneous sparse recovery and outlier detection. Comput. Optim. Appl. 73, 69\u2013100 (2019)","journal-title":"Comput. Optim. Appl."},{"key":"252_CR31","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-4344-1","volume-title":"Algorithmic Algebra","author":"B Mishra","year":"1993","unstructured":"Mishra, B.: Algorithmic Algebra. Springer, New York (1993)"},{"key":"252_CR32","doi-asserted-by":"publisher","first-page":"533","DOI":"10.4153\/CJM-1965-053-6","volume":"17","author":"TS Motzkin","year":"1965","unstructured":"Motzkin, T.S., Straus, E.G.: Maxima for graphs and a new proof of a theorem of Turan. Can. J. Math. 17, 533\u2013540 (1965)","journal-title":"Can. J. Math."},{"key":"252_CR33","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/BF02592948","volume":"39","author":"KG Murty","year":"1987","unstructured":"Murty, K.G., Kabadi, S.N.: Some NP-complete problems in quadratic and nonlinear programming. Math. Program. 39, 117\u2013129 (1987)","journal-title":"Math. Program."},{"key":"252_CR34","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1137\/050637467","volume":"18","author":"J Povh","year":"2007","unstructured":"Povh, J., Rendl, F.: A copositive programming approach to graph partitioning. SIAM J. Optim. 18, 223\u2013241 (2007)","journal-title":"SIAM J. Optim."},{"key":"252_CR35","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/j.disopt.2009.01.002","volume":"6","author":"J Povh","year":"2009","unstructured":"Povh, J., Rendl, F.: Copositive and semidefinite relaxations of the quadratic assignment problem. Discr. Optim. 6, 231\u2013241 (2009)","journal-title":"Discr. Optim."},{"key":"252_CR36","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1137\/S1052623495288350","volume":"7","author":"M Ramana","year":"1997","unstructured":"Ramana, M., Tun\u00e7el, L., Wolkowicz, H.: Strong duality for semidefinite programming. SIAM J. Optim. 7, 641\u2013662 (1997)","journal-title":"SIAM J. Optim."},{"key":"252_CR37","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1007\/s10107-006-0038-8","volume":"109","author":"F Rendl","year":"2007","unstructured":"Rendl, F., Sotirov, R.: Bounds for the quadratic assignment problem using the bundle method. Math. Program. 109, 505\u2013524 (2007)","journal-title":"Math. Program."},{"key":"252_CR38","doi-asserted-by":"publisher","DOI":"10.1515\/9781400873173","volume-title":"Convex Analyis","author":"RT Rockafellar","year":"1970","unstructured":"Rockafellar, R.T.: Convex Analyis. Princeton University Press, Princeton (1970)"},{"key":"252_CR39","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1145\/321958.321975","volume":"23","author":"S Sahni","year":"1976","unstructured":"Sahni, S., Gonzalez, T.: P-complete approximation problems. J. ACM 23, 555\u2013565 (1976)","journal-title":"J. ACM"},{"key":"252_CR40","doi-asserted-by":"crossref","unstructured":"Sun, D.F., Toh, K.C., Yuan, Y.C., Zhao, X.Y.: SDPNAL+: A Matlab software for semidefinite programming with bound constraints (version 1.0), Optimization Methods and Software (in print) (2019)","DOI":"10.1080\/10556788.2019.1576176"},{"key":"252_CR41","first-page":"289","volume":"22","author":"DT Pham","year":"1997","unstructured":"Pham, D.T., Le Thi, H.A.: Convex analysis approach to DC programming: theory, algorithms and applications. ACTA Math. Vietnam. 22, 289\u2013355 (1997)","journal-title":"ACTA Math. Vietnam."},{"key":"252_CR42","doi-asserted-by":"publisher","first-page":"476","DOI":"10.1137\/S1052623494274313","volume":"8","author":"DT Pham","year":"1998","unstructured":"Pham, D.T., Le Thi, A.: ADC optimization algorithm for solving the trust-region subproblem. SIAM J. Optim. 8, 476\u2013505 (1998)","journal-title":"SIAM J. Optim."},{"key":"252_CR43","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1017\/S0962492901000071","volume":"10","author":"MJ Todd","year":"2001","unstructured":"Todd, M.J.: Semidefinite optimization. Acta Num. 10, 515\u2013560 (2001)","journal-title":"Acta Num."},{"key":"252_CR44","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1137\/1038003","volume":"38","author":"L Vandenberghe","year":"1996","unstructured":"Vandenberghe, L., Boyd, S.: Semidefinite programming. SIAM Rev. 38, 49\u201375 (1996)","journal-title":"SIAM Rev."},{"key":"252_CR45","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/s12532-010-0017-1","volume":"2","author":"ZW Wen","year":"2010","unstructured":"Wen, Z.W., Goldfarb, D., Yin, W.T.: Alternating direction augmented Lagrangian methods for semidefinite programming. Math. Program. Comput. 2, 203\u2013230 (2010)","journal-title":"Math. Program. Comput."},{"key":"252_CR46","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1007\/BF01456804","volume":"71","author":"H Weyl","year":"1912","unstructured":"Weyl, H.: Das asymptotische verteilungsgesetz der eigenwerte linearer partieller differentialgleichungen (mit einer anwendung auf die theorie der hohlraumstrahlung. Math. Ann. 71, 441\u2013479 (1912)","journal-title":"Math. Ann."},{"key":"252_CR47","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/s12532-015-0082-6","volume":"7","author":"LQ Yang","year":"2015","unstructured":"Yang, L.Q., Sun, D.F., Toh, K.C.: SDPNAL+: a majorized semismooth Newton-CG augmented lagrangian method for semidefinite programming with nonnegative constraints. Math. Program. Comput. 7, 331\u2013366 (2015)","journal-title":"Math. Program. Comput."},{"key":"252_CR48","doi-asserted-by":"crossref","unstructured":"Yoshise, A., Matsukawa, Y.: On optimization over the doubly nonnegative cone. In: Proceedings of 2010 IEEE Multi-conference on Systems and Control, pp. 13\u201319 (2010)","DOI":"10.1109\/CACSD.2010.5612811"},{"key":"252_CR49","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1023\/A:1009795911987","volume":"2","author":"Q Zhao","year":"1998","unstructured":"Zhao, Q., Karisch, S.E., Rendl, F., Wolkowicz, H.: Semidefinite programming relaxations for the quadratic assignment problem. J. Combin. Optim. 2, 71\u2013109 (1998)","journal-title":"J. Combin. Optim."},{"key":"252_CR50","doi-asserted-by":"publisher","first-page":"1737","DOI":"10.1137\/080718206","volume":"20","author":"XY Zhao","year":"2010","unstructured":"Zhao, X.Y., Sun, D.F., Toh, K.C.: A Newton-CG augmented lagrangian method for semidefinite programming. SIAM J. Optim. 20, 1737\u20131765 (2010)","journal-title":"SIAM J. Optim."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-020-00252-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-020-00252-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-020-00252-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,16]],"date-time":"2023-10-16T17:42:20Z","timestamp":1697478140000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-020-00252-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1,2]]},"references-count":50,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2021,4]]}},"alternative-id":["252"],"URL":"https:\/\/doi.org\/10.1007\/s10589-020-00252-5","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"type":"print","value":"0926-6003"},{"type":"electronic","value":"1573-2894"}],"subject":[],"published":{"date-parts":[[2021,1,2]]},"assertion":[{"value":"13 August 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 December 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 January 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}