{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,17]],"date-time":"2026-02-17T05:45:28Z","timestamp":1771307128457,"version":"3.50.1"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"2-4","license":[{"start":{"date-parts":[[2023,7,20]],"date-time":"2023-07-20T00:00:00Z","timestamp":1689811200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,7,20]],"date-time":"2023-07-20T00:00:00Z","timestamp":1689811200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"Natural Science Foundation of China","doi-asserted-by":"crossref","award":["12071108"],"award-info":[{"award-number":["12071108"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"Natural Science Foundation of China","doi-asserted-by":"crossref","award":["11671116"],"award-info":[{"award-number":["11671116"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"Natural Science Foundation of China","doi-asserted-by":"crossref","award":["11991020"],"award-info":[{"award-number":["11991020"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"Natural Science Foundation of China","doi-asserted-by":"crossref","award":["11631013"],"award-info":[{"award-number":["11631013"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"Natural Science Foundation of China","doi-asserted-by":"crossref","award":["11971372"],"award-info":[{"award-number":["11971372"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"Natural Science Foundation of China","doi-asserted-by":"crossref","award":["11991021"],"award-info":[{"award-number":["11991021"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Strategic Priority Research Program of Chinese Academy of Sciences","award":["XDA27000000"],"award-info":[{"award-number":["XDA27000000"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2023,11]]},"DOI":"10.1007\/s10898-023-01314-8","type":"journal-article","created":{"date-parts":[[2023,7,20]],"date-time":"2023-07-20T02:01:59Z","timestamp":1689818519000},"page":"1027-1053","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["IPRQP: a primal-dual interior-point relaxation algorithm for convex quadratic programming"],"prefix":"10.1007","volume":"87","author":[{"given":"Rui-Jin","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Xin-Wei","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Yu-Hong","family":"Dai","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,7,20]]},"reference":[{"issue":"2","key":"1314_CR1","doi-asserted-by":"publisher","first-page":"490","DOI":"10.1007\/s10957-019-01575-y","volume":"183","author":"G Banjac","year":"2019","unstructured":"Banjac, G., Goulart, P., Stellato, B., Boyd, S.: Infeasibility detection in the alternating direction method of multipliers for convex optimization. J. Optim. Theory Appl. 183(2), 490\u2013519 (2019)","journal-title":"J. Optim. Theory Appl."},{"key":"1314_CR2","unstructured":"Cartis, C., Gould, N.I.: Finding a point in the relative interior of a polyhedron (2007)"},{"issue":"4","key":"1314_CR3","doi-asserted-by":"publisher","first-page":"96-1","DOI":"10.1145\/3386569.3392486","volume":"39","author":"K Cheshmi","year":"2020","unstructured":"Cheshmi, K., Kaufman, D.M., Kamil, S., Dehnavi, M.M.: NASOQ: numerically accurate sparsity-oriented QP solver. ACM Trans. Graph. (TOG) 39(4), 96\u20131 (2020)","journal-title":"ACM Trans. Graph. (TOG)"},{"issue":"2","key":"1314_CR4","doi-asserted-by":"publisher","first-page":"1009","DOI":"10.3934\/jimo.2018190","volume":"16","author":"YH Dai","year":"2020","unstructured":"Dai, Y.H., Liu, X.W., Sun, J.: A primal-dual interior-point method capable of rapidly detecting infeasibility for nonlinear programs. J. Ind. Manag. Optim. 16(2), 1009\u20131035 (2020)","journal-title":"J. Ind. Manag. Optim."},{"key":"1314_CR5","unstructured":"Di\u00a0Gaspero, L.: Quadprog++: a C++ library for quadratic programming which implements the Goldfarb-Idnani active-set dual method (2016)"},{"issue":"2","key":"1314_CR6","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"ED Dolan","year":"2002","unstructured":"Dolan, E.D., More, J.J.: Benchmarking optimization software with performance profiles. Math. Program. 91(2), 201\u2013213 (2002)","journal-title":"Math. Program."},{"issue":"4","key":"1314_CR7","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/s12532-014-0071-1","volume":"6","author":"HJ Ferreau","year":"2014","unstructured":"Ferreau, H.J., Kirches, C., Potschka, A., Bock, H.G., Diehl, M.: qpOASES: a parametric active-set algorithm for quadratic programming. Math. Program. Comput. 6(4), 327\u2013363 (2014)","journal-title":"Math. Program. Comput."},{"issue":"2","key":"1314_CR8","doi-asserted-by":"publisher","first-page":"6563","DOI":"10.1016\/j.ifacol.2020.12.073","volume":"53","author":"G Frison","year":"2020","unstructured":"Frison, G., Diehl, M.: HPIPM: a high-performance quadratic programming framework for model predictive control. IFAC-PapersOnLine 53(2), 6563\u20136569 (2020)","journal-title":"IFAC-PapersOnLine"},{"issue":"1","key":"1314_CR9","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1145\/641876.641880","volume":"29","author":"EM Gertz","year":"2003","unstructured":"Gertz, E.M., Wright, S.J.: Object-oriented software for quadratic programming. ACM Trans. Math. Softw. (TOMS) 29(1), 58\u201381 (2003)","journal-title":"ACM Trans. Math. Softw. (TOMS)"},{"key":"1314_CR10","unstructured":"Gilbert, J.C., Joannopoulos, \u00c9.: OQLA\/QPALM\u2013convex quadratic optimization solvers using the augmented Lagrangian approach, with an appropriate behavior on infeasible or unbounded problems (2014)"},{"issue":"1","key":"1314_CR11","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/BF02680554","volume":"83","author":"J Gondzio","year":"1998","unstructured":"Gondzio, J.: Warm start of the primal\u2013dual method applied in the cutting-plane scheme. Math. Program. 83(1), 125\u2013143 (1998)","journal-title":"Math. Program."},{"issue":"2","key":"1314_CR12","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1007\/s10589-010-9361-3","volume":"51","author":"J Gondzio","year":"2012","unstructured":"Gondzio, J.: Matrix-free interior point method. Comput. Optim. Appl. 51(2), 457\u2013480 (2012)","journal-title":"Comput. Optim. Appl."},{"key":"1314_CR13","unstructured":"Gurobi Optimization, LLC: Gurobi Optimizer Reference Manual (2023). https:\/\/www.gurobi.com"},{"key":"1314_CR14","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/1130.003.0014","volume-title":"Solving the Quadratic Programming Problem Arising in Support Vector Classification","author":"L Kaufman","year":"1998","unstructured":"Kaufman, L.: Solving the Quadratic Programming Problem Arising in Support Vector Classification. MIT Press, Cambridge, MA (1998)"},{"issue":"4","key":"1314_CR15","doi-asserted-by":"publisher","first-page":"863","DOI":"10.1007\/s10013-018-0311-1","volume":"46","author":"D Kouzoupis","year":"2018","unstructured":"Kouzoupis, D., Frison, G., Zanelli, A., Diehl, M.: Recent advances in quadratic programming algorithms for nonlinear model predictive control. Vietnam J. Math. 46(4), 863\u2013882 (2018)","journal-title":"Vietnam J. Math."},{"issue":"5","key":"1314_CR16","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/0041-5553(80)90098-1","volume":"20","author":"MK Kozlov","year":"1980","unstructured":"Kozlov, M.K., Tarasov, S.P., Khachiyan, L.G.: The polynomial solvability of convex quadratic programming. USSR Comput. Math. Math. Phys. 20(5), 223\u2013228 (1980)","journal-title":"USSR Comput. Math. Math. Phys."},{"key":"1314_CR17","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2019.108801","volume":"113","author":"D Liao-McPherson","year":"2020","unstructured":"Liao-McPherson, D., Kolmanovsky, I.: FBstab: a proximally stabilized semismooth algorithm for convex quadratic programming. Automatica 113, 108801 (2020)","journal-title":"Automatica"},{"issue":"323","key":"1314_CR18","doi-asserted-by":"publisher","first-page":"1301","DOI":"10.1090\/mcom\/3487","volume":"89","author":"XW Liu","year":"2020","unstructured":"Liu, X.W., Dai, Y.H.: A globally convergent primal\u2013dual interior-point relaxation method for nonlinear programs. Math. Comput. 89(323), 1301\u20131329 (2020)","journal-title":"Math. Comput."},{"key":"1314_CR19","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/s00186-022-00797-7","volume":"96","author":"XW Liu","year":"2022","unstructured":"Liu, X.W., Dai, Y.H., Huang, Y.K.: A primal\u2013dual interior-point relaxation method with global and rapidly local convergence for nonlinear programs. Math. Methods Oper. Res. 96, 351\u2013382 (2022)","journal-title":"Math. Methods Oper. Res."},{"issue":"341","key":"1314_CR20","doi-asserted-by":"publisher","first-page":"1301","DOI":"10.1090\/mcom\/3799","volume":"92","author":"XW Liu","year":"2023","unstructured":"Liu, X.W., Dai, Y.H., Huang, Y.K., Sun, J.: A novel augmented Lagrangian method of multipliers for optimization with general inequality constraints. Math. Comput. 92(341), 1301\u20131330 (2023)","journal-title":"Math. Comput."},{"key":"1314_CR21","unstructured":"Maes, C., Saunders, M.: QPBLUR: a regularized active-set method for sparse convex quadratic programming. In: Householder Symposium XVIII on Numerical Linear Algebra, p. 148 (2011)"},{"issue":"1\u20134","key":"1314_CR22","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1080\/10556789908805768","volume":"11","author":"I Maros","year":"1999","unstructured":"Maros, I., M\u00e9sz\u00e1ros, C.: A repository of convex quadratic programming problems. Optim. Methods Softw. 11(1\u20134), 671\u2013681 (1999)","journal-title":"Optim. Methods Softw."},{"issue":"2","key":"1314_CR23","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1287\/mnsc.1.2.152","volume":"1","author":"AD Martin","year":"1955","unstructured":"Martin, A.D.: Mathematical programming of portfolio selections. Manag. Sci. 1(2), 152\u2013166 (1955)","journal-title":"Manag. Sci."},{"issue":"4","key":"1314_CR24","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1137\/0802028","volume":"2","author":"S Mehrotra","year":"1992","unstructured":"Mehrotra, S.: On the implementation of a primal\u2013dual interior point method. SIAM J. Optim. 2(4), 575\u2013601 (1992)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"1314_CR25","doi-asserted-by":"publisher","first-page":"1212","DOI":"10.1137\/S1052623497324242","volume":"10","author":"JE Mitchell","year":"2000","unstructured":"Mitchell, J.E.: Computational experience with an interior point cutting plane algorithm. SIAM J. Optim. 10(4), 1212\u20131227 (2000)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"1314_CR26","first-page":"65","volume":"1","author":"JE Mitchell","year":"2002","unstructured":"Mitchell, J.E.: Branch-and-cut algorithms for combinatorial optimization problems. Handb. Appl. Optim. 1(1), 65\u201377 (2002)","journal-title":"Handb. Appl. Optim."},{"key":"1314_CR32","unstructured":"Netlib (2011). http:\/\/netlib.org\/lp\/"},{"key":"1314_CR27","volume-title":"Numerical Optimization","author":"J Nocedal","year":"2006","unstructured":"Nocedal, J., Wright, S.: Numerical Optimization. Springer, New York (2006)"},{"issue":"4","key":"1314_CR28","doi-asserted-by":"publisher","first-page":"3355","DOI":"10.1109\/LRA.2019.2926664","volume":"4","author":"AG Pandala","year":"2019","unstructured":"Pandala, A.G., Ding, Y.R., Park, H.W.: qpSWIFT: a real-time sparse quadratic program solver for robotic applications. IEEE Robot. Autom. Lett. 4(4), 3355\u20133362 (2019)","journal-title":"IEEE Robot. Autom. Lett."},{"issue":"2","key":"1314_CR29","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/s10589-020-00240-9","volume":"78","author":"S Pougkakiotis","year":"2021","unstructured":"Pougkakiotis, S., Gondzio, J.: An interior point-proximal method of multipliers for convex quadratic programming. Comput. Optim. Appl. 78(2), 307\u2013351 (2021)","journal-title":"Comput. Optim. Appl."},{"issue":"4","key":"1314_CR30","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1007\/s12532-020-00179-2","volume":"12","author":"B Stellato","year":"2020","unstructured":"Stellato, B., Banjac, G., Goulart, P., Bemporad, A., Boyd, S.: OSQP: an operator splitting solver for quadratic programs. Math. Program. Comput. 12(4), 637\u2013672 (2020)","journal-title":"Math. Program. Comput."},{"key":"1314_CR31","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611971453","volume-title":"Primal\u2013Dual Interior-Point Methods","author":"SJ Wright","year":"1997","unstructured":"Wright, S.J.: Primal\u2013Dual Interior-Point Methods, vol. 54. SIAM, Philadelphia (1997)"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-023-01314-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10898-023-01314-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-023-01314-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,31]],"date-time":"2023-10-31T23:58:03Z","timestamp":1698796683000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10898-023-01314-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,20]]},"references-count":32,"journal-issue":{"issue":"2-4","published-print":{"date-parts":[[2023,11]]}},"alternative-id":["1314"],"URL":"https:\/\/doi.org\/10.1007\/s10898-023-01314-8","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,7,20]]},"assertion":[{"value":"31 August 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 June 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 July 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}