{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T09:51:44Z","timestamp":1775037104413,"version":"3.50.1"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,11,15]],"date-time":"2025-11-15T00:00:00Z","timestamp":1763164800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,11,15]],"date-time":"2025-11-15T00:00:00Z","timestamp":1763164800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"National Key Research and Development Program of China","award":["2022YFA1003800"],"award-info":[{"award-number":["2022YFA1003800"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12201318"],"award-info":[{"award-number":["12201318"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","award":["63253105"],"award-info":[{"award-number":["63253105"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Optim Theory Appl"],"published-print":{"date-parts":[[2026,1]]},"DOI":"10.1007\/s10957-025-02883-2","type":"journal-article","created":{"date-parts":[[2025,11,15]],"date-time":"2025-11-15T01:44:19Z","timestamp":1763171059000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Vectorized Positive Semidefinite Penalty Method for Unconstrained Binary Quadratic Programming"],"prefix":"10.1007","volume":"208","author":[{"given":"Xinyue","family":"Huo","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4416-5021","authenticated-orcid":false,"given":"Ran","family":"Gu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,11,15]]},"reference":[{"issue":"3","key":"2883_CR1","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1007\/s10898-022-01268-3","volume":"86","author":"G Azuma","year":"2023","unstructured":"Azuma, G., Fukuda, M., Kim, S., Yamashita, M.: Exact SDP relaxations for quadratic programs with bipartite graph structures. J. Global Optim. 86(3), 671\u2013691 (2023). https:\/\/doi.org\/10.1007\/s10898-022-01268-3","journal-title":"J. Global Optim."},{"issue":"1","key":"2883_CR2","doi-asserted-by":"publisher","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\u20131 programming. Math. Program. 44(1), 127\u2013137 (1989). https:\/\/doi.org\/10.1007\/bf01587084","journal-title":"Math. Program."},{"issue":"1","key":"2883_CR3","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1137\/S1052623498336930","volume":"11","author":"A Beck","year":"2000","unstructured":"Beck, A., Teboulle, M.: Global optimality conditions for quadratic optimization problems with binary constraints. SIAM J. Optim. 11(1), 179\u2013188 (2000). https:\/\/doi.org\/10.1137\/S1052623498336930","journal-title":"SIAM J. Optim."},{"issue":"3","key":"2883_CR4","doi-asserted-by":"publisher","first-page":"1162","DOI":"10.1016\/j.engappai.2012.09.001","volume":"26","author":"U Benlic","year":"2013","unstructured":"Benlic, U., Hao, J.K.: Breakout local search for the Max-Cut problem. Eng. Appl. Artif. Intell. 26(3), 1162\u20131173 (2013). https:\/\/doi.org\/10.1016\/j.engappai.2012.09.001","journal-title":"Eng. Appl. Artif. Intell."},{"key":"2883_CR5","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/s10107-005-0637-9","volume":"109","author":"A Billionnet","year":"2007","unstructured":"Billionnet, A., Elloumi, S.: Using a mixed integer quadratic programming solver for the unconstrained quadratic 0\u20131 problem. Math. Program. 109, 55\u201368 (2007). https:\/\/doi.org\/10.1007\/s10107-005-0637-9","journal-title":"Math. Program."},{"issue":"3","key":"2883_CR6","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/bf02115753","volume":"33","author":"E Boros","year":"1991","unstructured":"Boros, E., Hammer, P.L.: The Max-Cut problem and quadratic 0\u20131 optimization; polyhedral aspects, relaxations and bounds. Ann. Oper. Res. 33(3), 151\u2013180 (1991). https:\/\/doi.org\/10.1007\/bf02115753","journal-title":"Ann. Oper. Res."},{"issue":"2","key":"2883_CR7","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/s10732-007-9009-3","volume":"13","author":"E Boros","year":"2007","unstructured":"Boros, E., Hammer, P.L., Tavares, G.: Local search heuristics for quadratic unconstrained binary optimization (QUBO). J. Heuristics 13(2), 99\u2013132 (2007). https:\/\/doi.org\/10.1007\/s10732-007-9009-3","journal-title":"J. Heuristics"},{"key":"2883_CR8","doi-asserted-by":"publisher","unstructured":"Cesarone, F., Scozzari, A., Tardella, F.: Linear vs. quadratic portfolio selection models with hard real-world constraints. Comput. Manag. Sci. 12(3), 345\u2013370 (2014). https:\/\/doi.org\/10.1007\/s10287-014-0210-1","DOI":"10.1007\/s10287-014-0210-1"},{"issue":"1","key":"2883_CR9","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/s00211-004-0569-y","volume":"100","author":"YH Dai","year":"2005","unstructured":"Dai, Y.H., Fletcher, R.: Projected barzilai-borwein methods for large-scale box-constrained quadratic programming. Numer. Math. 100(1), 21\u201347 (2005). https:\/\/doi.org\/10.1007\/s00211-004-0569-y","journal-title":"Numer. Math."},{"key":"2883_CR10","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1023\/A:1008282830093","volume":"10","author":"T Fujie","year":"1997","unstructured":"Fujie, T., Kojima, M.: Semidefinite programming relaxation for nonconvex quadratic programs. J. Global Optim. 10, 367\u2013380 (1997)","journal-title":"J. Global Optim."},{"key":"2883_CR11","doi-asserted-by":"publisher","unstructured":"Gu, R., Du, Q., Yuan, Y.x.: Positive semidefinite penalty method for quadratically constrained quadratic programming. IMA J. Numer. Anal. 41(4), 2488\u20132515 (2020). https:\/\/doi.org\/10.1093\/imanum\/draa031","DOI":"10.1093\/imanum\/draa031"},{"issue":"1","key":"2883_CR12","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/0377-2217(84)90055-9","volume":"15","author":"V Gulati","year":"1984","unstructured":"Gulati, V., Gupta, S., Mittal, A.: Unconstrained quadratic bivalent programming problem. European J. Oper. Res. 15(1), 121\u2013125 (1984). https:\/\/doi.org\/10.1016\/0377-2217(84)90055-9","journal-title":"European J. Oper. Res."},{"key":"2883_CR13","doi-asserted-by":"publisher","unstructured":"Krislock, N., Malick, J., Roupin, F.: Biqcrunch: A semidefinite branch-and-bound method for solving binary quadratic problems. ACM Trans. Math. Softw. 43, 32:1\u201332:23 (2017). https:\/\/doi.org\/10.1145\/3005345","DOI":"10.1145\/3005345"},{"key":"2883_CR14","doi-asserted-by":"publisher","unstructured":"Li, X.R., Huang, Y.K.: A note on r-linear convergence of nonmonotone gradient methods. J. Oper. Res. Soc. China pp. 1\u201313 (2023). https:\/\/doi.org\/10.1007\/s40305-023-00468-2","DOI":"10.1007\/s40305-023-00468-2"},{"issue":"4","key":"2883_CR15","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1109\/itsc.2001.948654","volume":"5","author":"WH Lin","year":"2004","unstructured":"Lin, W.H., Wang, C.: An enhanced 0\u20131 mixed-integer LP formulation for traffic signal control. IEEE Trans. Intell. Transp. Syst. 5(4), 238\u2013245 (2004). https:\/\/doi.org\/10.1109\/itsc.2001.948654","journal-title":"IEEE Trans. Intell. Transp. Syst."},{"key":"2883_CR16","doi-asserted-by":"publisher","unstructured":"Liu, H., Deng, K., Liu, H., Wen, Z.: An entropy-regularized admm for binary quadratic programming. J. Global Optim. 87 (2022). https:\/\/doi.org\/10.1007\/s10898-022-01144-0","DOI":"10.1007\/s10898-022-01144-0"},{"key":"2883_CR17","doi-asserted-by":"publisher","first-page":"1720","DOI":"10.4236\/jamp.2018.68147","volume":"06","author":"Z Liu","year":"2018","unstructured":"Liu, Z., Yu, Z., Wang, Y.: A continuous approach to binary quadratic problems. J. Appl. Math. Phys. 06, 1720\u20131732 (2018). https:\/\/doi.org\/10.4236\/jamp.2018.68147","journal-title":"J. Appl. Math. Phys."},{"key":"2883_CR18","doi-asserted-by":"publisher","first-page":"964","DOI":"10.1007\/s10957-018-1416-0","volume":"180","author":"H Luo","year":"2019","unstructured":"Luo, H., Bai, X., Peng, J.: Enhancing semidefinite relaxation for quadratically constrained quadratic programming via penalty methods. J. Optim. Theory Appl. 180, 964\u2013992 (2019). https:\/\/doi.org\/10.1007\/s10957-018-1416-0","journal-title":"J. Optim. Theory Appl."},{"key":"2883_CR19","doi-asserted-by":"publisher","unstructured":"Luo, Z.Q., Ma, W.K., So, A.M.C., Ye, Y., Zhang, S.: Semidefinite relaxation of quadratic optimization problems. IEEE Signal Process. Mag. 27(3), 20\u201334 (2010). https:\/\/doi.org\/10.1109\/msp.2010.936019","DOI":"10.1109\/msp.2010.936019"},{"issue":"2","key":"2883_CR20","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1023\/a:1017912624016","volume":"8","author":"P Merz","year":"2002","unstructured":"Merz, P., Freisleben, B.: Greedy and local search heuristics for unconstrained binary quadratic programming. J. Heuristics 8(2), 197\u2013213 (2002). https:\/\/doi.org\/10.1023\/a:1017912624016","journal-title":"J. Heuristics"},{"issue":"3","key":"2883_CR21","doi-asserted-by":"publisher","first-page":"792","DOI":"10.1007\/s10878-019-00517-8","volume":"39","author":"RK Nayak","year":"2020","unstructured":"Nayak, R.K., Mohanty, N.K.: Solution of boolean quadratic programming problems by two augmented lagrangian algorithms based on a continuous relaxation. J. Comb. Optim. 39(3), 792\u2013825 (2020). https:\/\/doi.org\/10.1007\/s10878-019-00517-8","journal-title":"J. Comb. Optim."},{"key":"2883_CR22","doi-asserted-by":"crossref","unstructured":"Nesterov, Y., Wolkowicz, H., Ye, Y.: Semidefinite programming relaxations of nonconvex quadratic optimization. In: Vandenberghe, L., Wolkowicz, H., Saigal, R. (eds.) Handbook of Semidefinite Programming: Theory, Algorithms, and Applications, pp. 361\u2013419. Springer (2000)","DOI":"10.1007\/978-1-4615-4381-7_13"},{"key":"2883_CR23","doi-asserted-by":"crossref","unstructured":"Nocedal, Jorge and Wright, Stephen J, Penalty and Augmented Lagrangian Methods. Numerical Optimization,497\u2013528 Springer ,New York, NY (2006). https:\/\/doi.org\/10.1007\/978-0-387-40065-5_17","DOI":"10.1007\/978-0-387-40065-5_17"},{"issue":"1","key":"2883_CR24","doi-asserted-by":"publisher","first-page":"2146","DOI":"10.1038\/s41598-022-06070-5","volume":"12","author":"H Oshiyama","year":"2022","unstructured":"Oshiyama, H., Ohzeki, M.: Benchmark of quantum-inspired heuristic solvers for quadratic unconstrained binary optimization. Sci. Rep. 12(1), 2146 (2022). https:\/\/doi.org\/10.1038\/s41598-022-06070-5","journal-title":"Sci. Rep."},{"issue":"2","key":"2883_CR25","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/0167-6377(92)90043-3","volume":"11","author":"PM Pardalos","year":"1992","unstructured":"Pardalos, P.M., Jha, S.: Complexity of uniqueness and local search in quadratic 0\u20131 programming. Oper. Res. Lett. 11(2), 119\u2013123 (1992). https:\/\/doi.org\/10.1016\/0167-6377(92)90043-3","journal-title":"Oper. Res. Lett."},{"key":"2883_CR26","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/bf02247879","volume":"45","author":"PM Pardalos","year":"1990","unstructured":"Pardalos, P.M., Rodgers, G.P.: Computational aspects of a branch and bound algorithm for quadratic zero-one programming. Computing 45, 131\u2013144 (1990). https:\/\/doi.org\/10.1007\/bf02247879","journal-title":"Computing"},{"key":"2883_CR27","doi-asserted-by":"crossref","unstructured":"Poljak, S., Wolkowicz, H.: Convex relaxations of (0,1)-quadratic programming. Math. Oper. Res. 20(3) (1995)","DOI":"10.1287\/moor.20.3.550"},{"key":"2883_CR28","unstructured":"Rinaldi, G.: Rudy. http:\/\/www-user.tu-chemnitz.de\/~helmberg\/rudy.tar.gz (1998)"},{"key":"2883_CR29","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/s10479-006-0107-7","volume":"149","author":"HD Sherali","year":"2007","unstructured":"Sherali, H.D.: Rlt: A unified approach for discrete and continuous nonconvex optimization. Ann. Oper. Res. 149, 185\u2013193 (2007). https:\/\/doi.org\/10.1007\/s10479-006-0107-7","journal-title":"Ann. Oper. Res."},{"key":"2883_CR30","doi-asserted-by":"crossref","unstructured":"Shi, J., Zhang, Q., Derbel, B., Liefooghe, A.: A parallel tabu search for the unconstrained binary quadratic programming problem. In: 2017 IEEE Congress on Evolutionary Computation (CEC), pp. 557\u2013564. IEEE (2017)","DOI":"10.1109\/CEC.2017.7969360"},{"issue":"3","key":"2883_CR31","doi-asserted-by":"publisher","first-page":"2169","DOI":"10.1137\/23M1561464","volume":"34","author":"T Tang","year":"2024","unstructured":"Tang, T., Toh, K.C.: A feasible method for general convex low-rank SDP problems. SIAM J. Optim. 34(3), 2169\u20132200 (2024)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"2883_CR32","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1016\/j.cie.2010.05.015","volume":"59","author":"RF Teixeira","year":"2010","unstructured":"Teixeira, R.F., Fernandes, F.C.F., Pereira, N.A.: Binary integer programming formulations for scheduling in market-driven foundries. Comput. Ind. Eng. 59(3), 425\u2013435 (2010). https:\/\/doi.org\/10.1016\/j.cie.2010.05.015","journal-title":"Comput. Ind. Eng."},{"issue":"2","key":"2883_CR33","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/s10107-002-0347-5","volume":"95","author":"RH 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(2), 189\u2013217 (2003). https:\/\/doi.org\/10.1007\/s10107-002-0347-5","journal-title":"Math. Program."},{"key":"2883_CR34","first-page":"395","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimziation Problems","author":"Y Wang","year":"2012","unstructured":"Wang, Y., L\u00fc, Z., Glover, F., Hao, J.K.: A multilevel algorithm for large unconstrained binary quadratic optimization. In: Beldiceanu, N., Jussien, N., Pinson, \u00c9. (eds.) Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimziation Problems, pp. 395\u2013408. Springer, Berlin, Heidelberg (2012)"},{"key":"2883_CR35","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/s11590-008-0105-6","volume":"3","author":"Y Xia","year":"2009","unstructured":"Xia, Y.: New optimality conditions for quadratic optimization problems with binary constraints. Optim. Lett. 3, 253\u2013263 (2009). https:\/\/doi.org\/10.1007\/s11590-008-0105-6","journal-title":"Optim. Lett."},{"key":"2883_CR36","doi-asserted-by":"crossref","unstructured":"Yuan, G., Ghanem, B.: An exact penalty method for binary optimization based on MPEC formulation. In: S.\u00a0Singh, S.\u00a0Markovitch (eds.) Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, vol.\u00a031, pp. 2867\u20132875. AAAI Press (2017)","DOI":"10.1609\/aaai.v31i1.10795"}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-025-02883-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10957-025-02883-2","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-025-02883-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T07:23:14Z","timestamp":1775028194000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10957-025-02883-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,15]]},"references-count":36,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,1]]}},"alternative-id":["2883"],"URL":"https:\/\/doi.org\/10.1007\/s10957-025-02883-2","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"value":"0022-3239","type":"print"},{"value":"1573-2878","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,11,15]]},"assertion":[{"value":"9 August 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 November 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 November 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"53"}}