{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T23:44:34Z","timestamp":1778283874128,"version":"3.51.4"},"reference-count":59,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2022,3,22]],"date-time":"2022-03-22T00:00:00Z","timestamp":1647907200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,3,22]],"date-time":"2022-03-22T00:00:00Z","timestamp":1647907200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Prog. Comp."],"published-print":{"date-parts":[[2022,9]]},"DOI":"10.1007\/s12532-022-00218-0","type":"journal-article","created":{"date-parts":[[2022,3,22]],"date-time":"2022-03-22T17:04:48Z","timestamp":1647968688000},"page":"497-541","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":20,"title":["QPALM: a proximal augmented lagrangian method for nonconvex quadratic programs"],"prefix":"10.1007","volume":"14","author":[{"given":"Ben","family":"Hermans","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andreas","family":"Themelis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Panagiotis","family":"Patrinos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,3,22]]},"reference":[{"issue":"1","key":"218_CR1","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s10589-006-8717-1","volume":"36","author":"PA Absil","year":"2007","unstructured":"Absil, P.A., Tits, A.L.: Newton-KKT interior-point methods for indefinite quadratic programming. Comput. Optim. Appl. 36(1), 5\u201341 (2007)","journal-title":"Comput. Optim. Appl."},{"issue":"3","key":"218_CR2","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1145\/1024074.1024081","volume":"30","author":"PR Amestoy","year":"2004","unstructured":"Amestoy, P.R., Davis, T.A., Duff, I.S.: Algorithm 837: AMD, an approximate minimum degree ordering algorithm. ACM Trans. Math. Softw. (TOMS) 30(3), 381\u2013388 (2004)","journal-title":"ACM Trans. Math. Softw. (TOMS)"},{"issue":"2","key":"218_CR3","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":"218_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1017\/S0962492904000212","volume":"14","author":"M Benzi","year":"2005","unstructured":"Benzi, M., Golub, G.H., Liesen, J.: Numerical solution of saddle point problems. Acta Numer. 14, 1 (2005)","journal-title":"Acta Numer."},{"issue":"2","key":"218_CR5","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/BF00937167","volume":"29","author":"DP Bertsekas","year":"1979","unstructured":"Bertsekas, D.P.: Convexification procedures and decomposition methods for nonconvex optimization problems. J. Optim. Theory Appl. 29(2), 169\u2013197 (1979)","journal-title":"J. Optim. Theory Appl."},{"key":"218_CR6","volume-title":"Constrained Optimization and Lagrange Multiplier Methods. Computer Science and Applied Mathematics","author":"DP Bertsekas","year":"1982","unstructured":"Bertsekas, D.P.: Constrained Optimization and Lagrange Multiplier Methods. Computer Science and Applied Mathematics. Academic Press, Boston (1982)"},{"key":"218_CR7","unstructured":"Bertsekas, D.P.: Nonlinear Programming. Athena Scientific (2016)"},{"key":"218_CR8","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973365","volume-title":"Practical Augmented Lagrangian Methods for Constrained Optimization","author":"EG Birgin","year":"2014","unstructured":"Birgin, E.G., Mart\u00ednez, J.M.: Practical Augmented Lagrangian Methods for Constrained Optimization. Society for Industrial and Applied Mathematics, Philadelphia, PA (2014)"},{"issue":"4","key":"218_CR9","doi-asserted-by":"publisher","first-page":"1210","DOI":"10.1287\/moor.2017.0900","volume":"43","author":"J Bolte","year":"2018","unstructured":"Bolte, J., Sabach, S., Teboulle, M.: Nonconvex Lagrangian-based optimization: monitoring schemes and global convergence. Math. Operations Res. 43(4), 1210\u20131232 (2018)","journal-title":"Math. Operations Res."},{"issue":"2","key":"218_CR10","doi-asserted-by":"publisher","first-page":"682","DOI":"10.1287\/moor.2019.1008","volume":"45","author":"RI Bo\u0163","year":"2020","unstructured":"Bo\u0163, R.I., Nguyen, D.K.: The proximal alternating direction method of multipliers in the nonconvex setting: convergence analysis and rates. Math. Operations Res. 45(2), 682\u2013712 (2020)","journal-title":"Math. Operations Res."},{"issue":"2","key":"218_CR11","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/s10107-006-0080-6","volume":"113","author":"S Burer","year":"2008","unstructured":"Burer, S., Vandenbussche, D.: A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations. Math. Program. 113(2), 259\u2013282 (2008)","journal-title":"Math. Program."},{"issue":"1","key":"218_CR12","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/s12532-011-0033-9","volume":"4","author":"J Chen","year":"2012","unstructured":"Chen, J., Burer, S.: Globally solving nonconvex quadratic programming problems via completely positive programming. Math. Program. Comput. 4(1), 33\u201352 (2012)","journal-title":"Math. Program. Comput."},{"issue":"3","key":"218_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1391989.1391995","volume":"35","author":"Y Chen","year":"2008","unstructured":"Chen, Y., Davis, T.A., Hager, W.W., Rajamanickam, S.: Algorithm 887: CHOLMOD, supernodal sparse Cholesky factorization and update\/downdate. ACM Trans. Math. Softw. (TOMS) 35(3), 1\u201314 (2008)","journal-title":"ACM Trans. Math. Softw. (TOMS)"},{"issue":"2","key":"218_CR14","doi-asserted-by":"publisher","first-page":"731","DOI":"10.1137\/S0363012903427336","volume":"43","author":"PL Combettes","year":"2004","unstructured":"Combettes, P.L., Pennanen, T.: Proximal methods for cohypomonotone operators. SIAM J. Control Optim. 43(2), 731\u2013742 (2004)","journal-title":"SIAM J. Control Optim."},{"issue":"3","key":"218_CR15","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1016\/0024-3795(70)90002-9","volume":"3","author":"RW Cottle","year":"1970","unstructured":"Cottle, R.W., Habetler, G., Lemke, C.: On classes of copositive matrices. Linear Algebra Appl. 3(3), 295\u2013310 (1970)","journal-title":"Linear Algebra Appl."},{"issue":"4","key":"218_CR16","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1145\/1114268.1114277","volume":"31","author":"TA Davis","year":"2005","unstructured":"Davis, T.A.: Algorithm 849: a concise sparse Cholesky factorization package. ACM Trans. Math. Softw. (TOMS) 31(4), 587\u2013591 (2005)","journal-title":"ACM Trans. Math. Softw. (TOMS)"},{"key":"218_CR17","doi-asserted-by":"crossref","unstructured":"Davis, T.A.: Direct Methods for Sparse Linear Systems. Society for Industrial and Applied Mathematics (2006)","DOI":"10.1137\/1.9780898718881"},{"issue":"3","key":"218_CR18","doi-asserted-by":"publisher","first-page":"606","DOI":"10.1137\/S0895479897321076","volume":"20","author":"TA Davis","year":"1999","unstructured":"Davis, T.A., Hager, W.W.: Modifying a sparse Cholesky factorization. SIAM J. Matrix Anal. Appl. 20(3), 606\u2013627 (1999)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"4","key":"218_CR19","doi-asserted-by":"publisher","first-page":"997","DOI":"10.1137\/S0895479899357346","volume":"22","author":"TA Davis","year":"2001","unstructured":"Davis, T.A., Hager, W.W.: Multiple-rank modifications of a sparse Cholesky factorization. SIAM J. Matrix Anal. Appl. 22(4), 997\u20131013 (2001)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"3","key":"218_CR20","doi-asserted-by":"publisher","first-page":"621","DOI":"10.1137\/S089547980343641X","volume":"26","author":"TA Davis","year":"2005","unstructured":"Davis, T.A., Hager, W.W.: Row modifications of a sparse Cholesky factorization. SIAM J. Matrix Anal. Appl. 26(3), 621\u2013639 (2005)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"2","key":"218_CR21","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"ED Dolan","year":"2002","unstructured":"Dolan, E.D., Mor\u00e9, J.J.: Benchmarking optimization software with performance profiles. Math. Program. 91(2), 201\u2013213 (2002)","journal-title":"Math. Program."},{"key":"218_CR22","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-87821-8","volume-title":"Implicit Functions and Solution Mappings","author":"AL Dontchev","year":"2009","unstructured":"Dontchev, A.L., Rockafellar, R.T.: Implicit Functions and Solution Mappings, vol. 208. Springer, Berlin (2009)"},{"key":"218_CR23","volume-title":"Finite-Dimensional Variational Inequalities and Complementarity Problems","author":"F Facchinei","year":"2003","unstructured":"Facchinei, F., Pang, J.S.: Finite-Dimensional Variational Inequalities and Complementarity Problems, vol. II. Springer, Berlin (2003)"},{"issue":"4","key":"218_CR24","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":"218_CR25","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":"218_CR26","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)"},{"issue":"1","key":"218_CR27","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/s12532-014-0075-x","volume":"7","author":"PE Gill","year":"2015","unstructured":"Gill, P.E., Wong, E.: Methods for convex and general quadratic programming. Math. Program. Comput. 7(1), 71\u2013112 (2015)","journal-title":"Math. Program. Comput."},{"key":"218_CR28","volume-title":"Matrix Computations. Johns Hopkins Studies in the Mathematical Sciences","author":"GH Golub","year":"2013","unstructured":"Golub, G.H., Van Loan, C.F.: Matrix Computations. Johns Hopkins Studies in the Mathematical Sciences. Johns Hopkins University Press, Baltimore (2013)"},{"issue":"2","key":"218_CR29","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2950048","volume":"43","author":"N Gould","year":"2016","unstructured":"Gould, N., Scott, J.: A note on performance profiles for benchmarking software. ACM Trans. Math. Softw. (TOMS) 43(2), 1\u20135 (2016)","journal-title":"ACM Trans. Math. Softw. (TOMS)"},{"issue":"4","key":"218_CR30","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1145\/962437.962438","volume":"29","author":"NI Gould","year":"2003","unstructured":"Gould, N.I., Orban, D., Toint, P.L.: GALAHAD, a library of thread-safe fortran 90 packages for large-scale nonlinear optimization. ACM Trans. Math. Softw. (TOMS) 29(4), 353\u2013372 (2003)","journal-title":"ACM Trans. Math. Softw. (TOMS)"},{"issue":"3","key":"218_CR31","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1007\/s10589-014-9687-3","volume":"60","author":"NI Gould","year":"2015","unstructured":"Gould, N.I., Orban, D., Toint, P.L.: CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization. Comput. Optim. Appl. 60(3), 545\u2013557 (2015)","journal-title":"Comput. Optim. Appl."},{"key":"218_CR32","unstructured":"Gurobi\u00a0Optimization, L.: Gurobi optimizer reference manual (2018). http:\/\/www.gurobi.com"},{"key":"218_CR33","doi-asserted-by":"publisher","unstructured":"Hermans, B.: LADEL: Quasidefinite sparse LDL factorization package with rank 1 updates and (symmetric) row\/column additions and deletes (2022). https:\/\/doi.org\/10.5281\/zenodo.5939513","DOI":"10.5281\/zenodo.5939513"},{"key":"218_CR34","doi-asserted-by":"crossref","unstructured":"Hermans, B., Themelis, A., Patrinos, P.: QPALM: a Newton-type proximal augmented Lagrangian method for quadratic programs. In: 2019 IEEE 58th Conference on Decision and Control (CDC), pp. 4325\u20134330 (2019)","DOI":"10.1109\/CDC40024.2019.9030211"},{"key":"218_CR35","doi-asserted-by":"publisher","unstructured":"Hermans, B., Themelis, A., Patrinos, P.: QPALM (2022). https:\/\/doi.org\/10.5281\/zenodo.5939473","DOI":"10.5281\/zenodo.5939473"},{"issue":"4","key":"218_CR36","doi-asserted-by":"publisher","first-page":"1080","DOI":"10.1137\/S1052623401399587","volume":"13","author":"AN Iusem","year":"2003","unstructured":"Iusem, A.N., Pennanen, T., Svaiter, B.F.: Inexact variants of the proximal point algorithm without monotonicity. SIAM J. Optim. 13(4), 1080\u20131097 (2003)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"218_CR37","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1137\/S1064827500366124","volume":"23","author":"AV Knyazev","year":"2001","unstructured":"Knyazev, A.V.: Toward the optimal preconditioned eigensolver: locally optimal block preconditioned conjugate gradient method. SIAM J. Sci. Comput. 23(2), 517\u2013541 (2001)","journal-title":"SIAM J. Sci. Comput."},{"issue":"4","key":"218_CR38","doi-asserted-by":"publisher","first-page":"2566","DOI":"10.1137\/18M1171011","volume":"29","author":"W Kong","year":"2019","unstructured":"Kong, W., Melo, J.G., Monteiro, R.D.: Complexity of a quadratic penalty accelerated inexact proximal point method for solving linearly constrained nonconvex composite programs. SIAM J. Optim. 29(4), 2566\u20132593 (2019)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"218_CR39","doi-asserted-by":"publisher","first-page":"2434","DOI":"10.1137\/140998135","volume":"25","author":"G Li","year":"2015","unstructured":"Li, G., Pong, T.K.: Global convergence of splitting methods for nonconvex composite optimization. SIAM J. Optim. 25(4), 2434\u20132460 (2015)","journal-title":"SIAM J. Optim."},{"key":"218_CR40","unstructured":"Lin, Q., Ma, R., Xu, Y.: Inexact proximal-point penalty methods for non-convex optimization with non-convex constraints. arXiv preprint arXiv:1908.11518 (2019)"},{"issue":"1","key":"218_CR41","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/BF02096261","volume":"46","author":"ZQ Luo","year":"1993","unstructured":"Luo, Z.Q., Tseng, P.: Error bounds and convergence analysis of feasible descent methods: a general approach. Ann. Operations Res. 46(1), 157\u2013178 (1993)","journal-title":"Ann. Operations Res."},{"issue":"1\u20134","key":"218_CR42","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":"1\u20134","key":"218_CR43","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1080\/10556789908805758","volume":"11","author":"C M\u00e9sz\u00e1ros","year":"1999","unstructured":"M\u00e9sz\u00e1ros, C.: The BPMPD interior point solver for convex quadratic problems. Optim. Methods Softw. 11(1\u20134), 431\u2013449 (1999)","journal-title":"Optim. Methods Softw."},{"key":"218_CR44","unstructured":"MOSEK, A.: Mosek optimization toolbox for matlab. User\u2019s Guide and Reference Manual, Version 9.2.22 (2019). https:\/\/docs.mosek.com\/8.0\/toolbox\/index.html"},{"key":"218_CR45","volume-title":"Numerical Optimization","author":"J Nocedal","year":"2006","unstructured":"Nocedal, J., Wright, S.: Numerical Optimization. Springer Science & Business Media, Berlin (2006)"},{"issue":"9","key":"218_CR46","doi-asserted-by":"publisher","first-page":"1405","DOI":"10.1016\/j.automatica.2010.06.008","volume":"46","author":"P Patrinos","year":"2010","unstructured":"Patrinos, P., Sarimveis, H.: A new algorithm for solving convex parametric quadratic programs based on graphical derivatives of solution mappings. Automatica 46(9), 1405\u20131418 (2010)","journal-title":"Automatica"},{"key":"218_CR47","unstructured":"Polyak, B.T.: Introduction to optimization. Inc., Publications Division, New York 1 (1987)"},{"issue":"2","key":"218_CR48","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1287\/moor.1.2.97","volume":"1","author":"RT Rockafellar","year":"1976","unstructured":"Rockafellar, R.T.: Augmented Lagrangians and applications of the proximal point algorithm in convex programming. Math. Operations Res. 1(2), 97\u2013116 (1976)","journal-title":"Math. Operations Res."},{"key":"218_CR49","volume-title":"Variational Analysis","author":"RT Rockafellar","year":"2011","unstructured":"Rockafellar, R.T., Wets, R.J.: Variational Analysis, vol. 317. Springer Science & Business Media, Berlin (2011)"},{"key":"218_CR50","unstructured":"Ruiz, D.: A scaling algorithm to equilibrate both rows and columns norms in matrices. Tech. rep., Rutherford Appleton Laboratorie (2001)"},{"issue":"1","key":"218_CR51","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01100203","volume":"7","author":"HD Sherali","year":"1995","unstructured":"Sherali, H.D., Tuncbilek, C.H.: A reformulation-convexification approach for solving nonconvex quadratic programming problems. J. Global Optim. 7(1), 1\u201331 (1995)","journal-title":"J. Global Optim."},{"key":"218_CR52","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, 637\u2013672 (2020)","journal-title":"Math. Program. Comput."},{"key":"218_CR53","unstructured":"Sun, T., Jiang, H., Cheng, L., Zhu, W.: A convergence framework for inexact nonconvex and nonsmooth algorithms and its applications to several iterations. arXiv preprint arXiv:1709.04072 (2017)"},{"key":"218_CR54","volume-title":"Splitting Algorithms, Modern Operator Theory, and Applications","author":"A Themelis","year":"2019","unstructured":"Themelis, A., Ahookhosh, M., Patrinos, P.: On the acceleration of forward-backward splitting via an inexact Newton method. In: Luke, R., Bauschke, H., Burachik, R. (eds.) Splitting Algorithms, Modern Operator Theory, and Applications. Springer, Berlin (2019)"},{"issue":"1","key":"218_CR55","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1137\/18M1163993","volume":"30","author":"A Themelis","year":"2020","unstructured":"Themelis, A., Patrinos, P.: Douglas\u2013Rachford splitting and ADMM for nonconvex optimization: tight convergence results. SIAM J. Optim. 30(1), 149\u2013181 (2020)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"218_CR56","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1137\/0805005","volume":"5","author":"RJ Vanderbei","year":"1995","unstructured":"Vanderbei, R.J.: Symmetric quasidefinite matrices. SIAM J. Optim. 5(1), 100\u2013113 (1995)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"218_CR57","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/s10107-004-0559-y","volume":"106","author":"A W\u00e4chter","year":"2006","unstructured":"W\u00e4chter, A., Biegler, L.T.: On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming. Math. Program. 106(1), 25\u201357 (2006)","journal-title":"Math. Program."},{"issue":"1","key":"218_CR58","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1137\/0602010","volume":"2","author":"M Yannakakis","year":"1981","unstructured":"Yannakakis, M.: Computing the minimum fill-in is NP-complete. SIAM J. Algebra. Disc. Methods 2(1), 77\u201379 (1981)","journal-title":"SIAM J. Algebra. Disc. Methods"},{"issue":"1\u20133","key":"218_CR59","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/BF01580903","volume":"56","author":"Y Ye","year":"1992","unstructured":"Ye, Y.: On affine scaling algorithms for nonconvex quadratic programming. Math. Program. 56(1\u20133), 285\u2013300 (1992)","journal-title":"Math. Program."}],"container-title":["Mathematical Programming Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-022-00218-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12532-022-00218-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-022-00218-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,16]],"date-time":"2022-08-16T17:49:10Z","timestamp":1660672150000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12532-022-00218-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3,22]]},"references-count":59,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,9]]}},"alternative-id":["218"],"URL":"https:\/\/doi.org\/10.1007\/s12532-022-00218-0","relation":{},"ISSN":["1867-2949","1867-2957"],"issn-type":[{"value":"1867-2949","type":"print"},{"value":"1867-2957","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,3,22]]},"assertion":[{"value":"5 October 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 January 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 March 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}