{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,27]],"date-time":"2024-08-27T16:02:25Z","timestamp":1724774545290},"reference-count":58,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,1,20]],"date-time":"2022-01-20T00:00:00Z","timestamp":1642636800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,20]],"date-time":"2022-01-20T00:00:00Z","timestamp":1642636800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CIF2006762"],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000181","name":"Air Force Office of Scientific Research","doi-asserted-by":"publisher","award":["FA9550-18-1-0382"],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2023,4]]},"DOI":"10.1007\/s10107-021-01766-4","type":"journal-article","created":{"date-parts":[[2022,1,20]],"date-time":"2022-01-20T14:05:59Z","timestamp":1642687559000},"page":"1339-1380","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Linear-step solvability of some folded concave and singly-parametric sparse optimization problems"],"prefix":"10.1007","volume":"198","author":[{"given":"Andr\u00e9s","family":"G\u00f3mez","sequence":"first","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0002-7611-312X","authenticated-orcid":false,"given":"Ziyu","family":"He","sequence":"additional","affiliation":[]},{"given":"Jong-Shi","family":"Pang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,1,20]]},"reference":[{"key":"1766_CR1","doi-asserted-by":"crossref","unstructured":"Adler, I., Cottle, R.W., Pang, J.S.: Some LCPs solvable in strongly polynomial time with Lemke\u2019s algorithm. Math. Progr., Ser. A 160(1), 477\u2013493 (2016)","DOI":"10.1007\/s10107-016-0996-4"},{"issue":"3","key":"1766_CR2","doi-asserted-by":"crossref","first-page":"1637","DOI":"10.1137\/16M1084754","volume":"27","author":"M Ahn","year":"2017","unstructured":"Ahn, M., Pang, J.S., Xin, J.: Difference-of-convex learning: directional stationarity, optimality, and sparsity. SIAM J. Optim. 27(3), 1637\u20131665 (2017)","journal-title":"SIAM J. Optim."},{"key":"1766_CR3","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/s10107-018-1301-5","volume":"170","author":"A Atamt\u00fcrk","year":"2018","unstructured":"Atamt\u00fcrk, A., G\u00f3mez, A.: Strong formulations for quadratic optimzation with M-matrices and indicator variables. Math. Progr. Seri. B 170, 141\u2013176 (2018)","journal-title":"Math. Progr. Seri. B"},{"key":"1766_CR4","first-page":"1","volume":"22","author":"A Atamt\u00fcrk","year":"2021","unstructured":"Atamt\u00fcrk, A., G\u00f3mez, A., Han, S.: Sparse and smooth signal estimation: convexification of L0 formulations. J. Mach. Learn. Res. 22, 1\u201343 (2021)","journal-title":"J. Mach. Learn. Res."},{"issue":"1","key":"1766_CR5","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1007\/s10107-018-1248-6","volume":"175","author":"F Bach","year":"2019","unstructured":"Bach, F.: Submodular functions: from discrete to continuous domains. Math. Program. 175(1), 419\u2013459 (2019)","journal-title":"Math. Program."},{"key":"1766_CR6","volume-title":"Statistical Inference Under Order Restrictions: The Theory and Application of Order Regression","author":"RE Barlow","year":"1972","unstructured":"Barlow, R.E., Bartholomew, D., Bremmer, J.M., Brunk, H.D.: Statistical Inference Under Order Restrictions: The Theory and Application of Order Regression. Wiley, New York (1972)"},{"key":"1766_CR7","doi-asserted-by":"crossref","unstructured":"Bennett, K.P., Kunapuli, G., Hu, J., Pang, J.S.: Bilevel optimization and machine learning. In: Computational Intelligence: Research Frontiers. Lecture Notes in Computer Science, vol. 5050, pp. 25\u201347 (2008)","DOI":"10.1007\/978-3-540-68860-0_2"},{"key":"1766_CR8","unstructured":"Bertsimas, D., Cory-Wright, R.: A scalable algorithm for sparse portfolio selection. arXiv preprint (2018). arXiv:1811.00138"},{"issue":"1","key":"1766_CR9","doi-asserted-by":"crossref","first-page":"858","DOI":"10.1137\/18M1186009","volume":"58","author":"W Bian","year":"2020","unstructured":"Bian, W., Chen, X.: A smoothing proximal gradient algorithm for nonsmooth convex regression with cardinality penalty. SIAM J. Numer. Anal. 58(1), 858\u2013883 (2020)","journal-title":"SIAM J. Numer. Anal."},{"key":"1766_CR10","doi-asserted-by":"crossref","first-page":"629","DOI":"10.1007\/s00041-008-9035-z","volume":"14","author":"T Blumensath","year":"2008","unstructured":"Blumensath, T., Davies, M.E.: Iterative thresholding for sparse approximations. J. Four. Anal. Appl. 14, 629\u2013654 (2008)","journal-title":"J. Four. Anal. Appl."},{"issue":"7","key":"1766_CR11","doi-asserted-by":"crossref","first-page":"1852","DOI":"10.1109\/TBME.2018.2880428","volume":"66","author":"B Cai","year":"2018","unstructured":"Cai, B., Zhang, A., Stephen, J.M., Wilson, T.W., Calhoun, V.D., Wang, Y.P.: Capturing dynamic connectivity from resting state FMRI using time-varying graphical lasso. IEEE Trans. Biomed. Eng. 66(7), 1852\u20131862 (2018)","journal-title":"IEEE Trans. Biomed. Eng."},{"key":"1766_CR12","doi-asserted-by":"crossref","first-page":"877","DOI":"10.1007\/s00041-008-9045-x","volume":"14","author":"EJ Cand\u00e8s","year":"2008","unstructured":"Cand\u00e8s, E.J., Watkins, M.B., Boyd, S.P.: Enhancing sparsity by reweighted $$\\ell _1$$ minimization. J. Four. Anal. Appl. 14, 877\u2013905 (2008)","journal-title":"J. Four. Anal. Appl."},{"key":"1766_CR13","first-page":"263","volume":"7","author":"R Chandrasekaran","year":"1970","unstructured":"Chandrasekaran, R.: A special case of the complementary pivot problem. Opsearch 7, 263\u2013268 (1970)","journal-title":"Opsearch"},{"key":"1766_CR14","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1038\/nature12354","volume":"499","author":"TW Chen","year":"2013","unstructured":"Chen, T.W., Wardill, T., Sun, Y., Pulver, S., Renninger, S., Baohan, A., Schreiter, E.R., Kerr, R.A., Orger, M., Jayaraman, V.: Ultrasensitive fluorescent proteins for imaging neuronal activity. Nature 499, 295\u2013300 (2013)","journal-title":"Nature"},{"key":"1766_CR15","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/s10107-012-0569-0","volume":"134","author":"X Chen","year":"2012","unstructured":"Chen, X.: Smoothing methods for nonsmooth, novonvex minimization. Math. Progr. 134, 71\u201399 (2012)","journal-title":"Math. Progr."},{"key":"1766_CR16","unstructured":"Chen, Y., Ge, D., Wang, M., Wang, Z., Ye, Y., Yin, H.: Strong NP-hardness for sparse optimization with concave penalty functions. In: Proceedings of the 34 the International Conference on Machine Learning, Sydney, Australia, PMLR 70 (2017)"},{"key":"1766_CR17","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1007\/s10107-012-0613-0","volume":"143","author":"X Chen","year":"2014","unstructured":"Chen, X., Ge, D., Wang, Z., Ye, Y.: Complexity of unconstrained L2-Lp minimization. Math. Progr. 143, 371\u2013383 (2014)","journal-title":"Math. Progr."},{"key":"1766_CR18","doi-asserted-by":"crossref","first-page":"2832","DOI":"10.1137\/090761471","volume":"32","author":"X Chen","year":"2010","unstructured":"Chen, X., Xu, F., Ye, Y.: Lower bound theory of nonzero entries in solutions of $$\\ell _2$$-$$\\ell _p$$ minimization. SIAM J. Sci. Comput. 32, 2832\u20132852 (2010)","journal-title":"SIAM J. Sci. Comput."},{"key":"1766_CR19","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1007\/s10589-013-9553-8","volume":"59","author":"X Chen","year":"2014","unstructured":"Chen, X., Zhou, W.: Convergence of the reweighted $$\\ell _1$$ minimization algorithm for $$\\ell _2$$-$$\\ell _p$$ minimization. Comput. Optim. Appl. 59, 47\u201361 (2014)","journal-title":"Comput. Optim. Appl."},{"key":"1766_CR20","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1007\/BFb0120784","volume":"7","author":"RW Cottle","year":"1978","unstructured":"Cottle, R.W., Pang, J.S.: On solving linear complementarity problems as linear programs. Math. Progr. Study 7, 88\u2013107 (1978)","journal-title":"Math. Progr. Study"},{"key":"1766_CR21","doi-asserted-by":"crossref","unstructured":"Cottle, R.W., Pang, J.S., Stone, R.E.: The linear complementarity problem, vol. 60. SIAM Classics in Applied Mathematics, Philadelphia (2009) [Originally published by Academic Press, Boston (1992)]","DOI":"10.1137\/1.9780898719000"},{"key":"1766_CR22","first-page":"23","volume":"3","author":"RW Cottle","year":"1969","unstructured":"Cottle, R.W., Veinott, A.F., Jr.: Polyhedral sets having a least element. Math. Progr. 3, 23\u2013249 (1969)","journal-title":"Math. Progr."},{"key":"1766_CR23","doi-asserted-by":"crossref","first-page":"523","DOI":"10.1007\/s10957-020-01716-8","volume":"186","author":"Y Cui","year":"2020","unstructured":"Cui, Y., Chang, T.H., Hong, M., Pang, J.S.: A study of piecewise-linear quadratic programs. J. Optim. Theory Appl. 186, 523\u2013553 (2020)","journal-title":"J. Optim. Theory Appl."},{"key":"1766_CR24","doi-asserted-by":"crossref","unstructured":"Cui, Y., Pang, J.S.: Modern nonconvex and nondifferentiable optimization. In: Society for Industrial and Applied Mathematics. MOS-SIAM Series on Optimization, Philadelphia (2021)","DOI":"10.1137\/1.9781611976748"},{"issue":"1\u20132","key":"1766_CR25","first-page":"95","volume":"176","author":"H Dong","year":"2018","unstructured":"Dong, H., Ahn, M., Pang, J.S.: Structural properties of affine sparsity constraints. Math. Progr., Ser. B 176(1\u20132), 95\u2013135 (2018)","journal-title":"Math. Progr., Ser. B"},{"key":"1766_CR26","unstructured":"Dong, H., Chen, K., Linderoth, J.: Regularization vs. relaxation: a conic optimization perspective of statistical variable selection (2015). arXiv:1510.06083"},{"issue":"456","key":"1766_CR27","doi-asserted-by":"crossref","first-page":"1348","DOI":"10.1198\/016214501753382273","volume":"96","author":"J Fan","year":"2001","unstructured":"Fan, J., Li, R.: Variable selection via nonconcave penalized likelihood and its oracle properties. J. Am. Stat. Assoc. 96(456), 1348\u20131360 (2001)","journal-title":"J. Am. Stat. Assoc."},{"issue":"3","key":"1766_CR28","first-page":"819","volume":"42","author":"J Fan","year":"2014","unstructured":"Fan, J., Xue, L., Zou, H.: Strong oracle optimality of folded concave penalized estimation. Ann. Stat. 42(3), 819\u2013849 (2014)","journal-title":"Ann. Stat."},{"key":"1766_CR29","unstructured":"Fattahi, S., G\u00f3mez A.: Scalable inference of sparsely-changing Markov random fields with strong statistical guarantees. Forthcoming in NeurIPS (2021). https:\/\/proceedings.neurips.cc\/paper\/2021\/hash\/33853141e0873909be88f5c3e6144cc6-Abstract.html"},{"key":"1766_CR30","unstructured":"Gurobi Optimization, LLC. Gurobi Optimizer Reference Manual (2021). https:\/\/www.gurobi.com"},{"key":"1766_CR31","doi-asserted-by":"crossref","unstructured":"Hallac, D., Park, Y., Boyd, S., Leskovec, J.: Network inference via the time-varying graphical lasso. In: Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 205\u2013213 (2017)","DOI":"10.1145\/3097983.3098037"},{"key":"1766_CR32","doi-asserted-by":"crossref","unstructured":"Hastie, T., Tibshirani, R., Wainwright, M.: Statistical learning with sparsity: the Lasso and generalizations. In: Monographs on Statistics and Applied Probability, vol. 143. CRC Press (2015)","DOI":"10.1201\/b18401"},{"key":"1766_CR33","unstructured":"He, Z., Han, S., G\u00f3mez, A., Cui, Y., Pang, J.S.: Comparing solution paths of sparse quadratic minimization with a Stieltjes matrix. Department of Industrial and Systems Engineering, University of Southern California (2021)"},{"issue":"4","key":"1766_CR34","doi-asserted-by":"crossref","first-page":"2563","DOI":"10.1137\/15M1024081","volume":"27","author":"DS Hochbaum","year":"2017","unstructured":"Hochbaum, D.S., Lu, Ch.: A faster algorithm for solving a generalization of isotonic median regression and a class of fused Lasso problems. SIAM J. Optim. 27(4), 2563\u20132596 (2017)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"1766_CR35","doi-asserted-by":"crossref","first-page":"2457","DOI":"10.1214\/18-AOAS1162","volume":"12","author":"S Jewell","year":"2018","unstructured":"Jewell, S., Witten, D.: Exact spike train inference via $$\\ell 0$$ optimization. Ann. Appl. Stat. 12(4), 2457\u20132482 (2018)","journal-title":"Ann. Appl. Stat."},{"issue":"4","key":"1766_CR36","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1080\/10556780802102586","volume":"23","author":"G Kunapuli","year":"2008","unstructured":"Kunapuli, G., Bennett, K., Hu, J., Pang, J.S.: Classification model selection via bilevel programming. Optim. Methods Softw. 23(4), 475\u2013489 (2008)","journal-title":"Optim. Methods Softw."},{"key":"1766_CR37","doi-asserted-by":"crossref","unstructured":"Kunapuli, G., Bennett, K., Hu, J., Pang, J.S.: Bilevel model selection for support vector machines. In: Hansen, P., Pardolos, P. (eds.) CRM Proceedings and Lecture Notes. American Mathematical Society, vol. 45, pp. 129\u2013158 (2008)","DOI":"10.1090\/crmp\/045\/07"},{"issue":"3","key":"1766_CR38","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1007\/s13675-015-0041-z","volume":"3","author":"YC Lee","year":"2015","unstructured":"Lee, Y.C., Mitchell, J.E., Pang, J.S.: Global resolution of the support vector machine regression parameters selection problem with LPCC. EURO J. Comput. Optim. 3(3), 197\u2013261 (2015)","journal-title":"EURO J. Comput. Optim."},{"issue":"2","key":"1766_CR39","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/s10898-014-0228-5","volume":"62","author":"YC Lee","year":"2015","unstructured":"Lee, Y.C., Mitchell, J.E., Pang, J.S.: An algorithm for global solution to bi-parametric linear complementarity constrained linear programs. J. Glob. Optim. 62(2), 263\u2013297 (2015)","journal-title":"J. Glob. Optim."},{"issue":"1","key":"1766_CR40","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1016\/j.ejor.2014.11.031","volume":"244","author":"HA Le Thi","year":"2015","unstructured":"Le Thi, H.A., Pham Dinh, T., Vo, X.T.: DC approximation approaches for sparse optimization. Eur. J. Oper. Res. 244(1), 26\u201346 (2015)","journal-title":"Eur. J. Oper. Res."},{"key":"1766_CR41","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/s10107-017-1114-y","volume":"166","author":"H Liu","year":"2017","unstructured":"Liu, H., Yao, T., Li, R., Ye, Y.: Folded concave penalized sparse linear regression: sparsity, statistical performance, and algorithmic theory for local solutions. Math. Progr. 166, 207\u2013240 (2017)","journal-title":"Math. Progr."},{"issue":"1\u20132","key":"1766_CR42","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1007\/s10107-018-1318-9","volume":"176","author":"Z Lu","year":"2019","unstructured":"Lu, Z., Zhou, Z., Sun, Z.: Enhanced proximal DC algorithms with extrapolation for a class of structured nonsmooth DC minimization. Math. Progr. 176(1\u20132), 369\u2013401 (2019)","journal-title":"Math. Progr."},{"key":"1766_CR43","unstructured":"Mairal, J., Yu, B.: Complexity analysis of the Lasso regularization path. In: Proceedings of the 29th International Conference on Machine Learning, Edinburgh, Scotland, UK (2012)"},{"key":"1766_CR44","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/BF01580671","volume":"10","author":"OL Mangasarian","year":"1976","unstructured":"Mangasarian, O.L.: Linear complementarity problems solvable by a single linear program. Math. Progr. 10, 263\u2013270 (1976)","journal-title":"Math. Progr."},{"key":"1766_CR45","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/0024-3795(73)90006-2","volume":"6","author":"J Mor\u00e9","year":"1973","unstructured":"Mor\u00e9, J., Rheinboldt, W.C.: On P- and S-functions and related classes of nonlinear mappings. Linear Algebra Appl. 6, 45\u201368 (1973)","journal-title":"Linear Algebra Appl."},{"key":"1766_CR46","unstructured":"Mosek ApS. The MOSEK optimization toolbox for MATLAB manual. Version 9.3 (2019). http:\/\/docs.mosek.com\/9.3\/toolbox\/index.html"},{"issue":"1","key":"1766_CR47","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/19M1304799","volume":"14","author":"L Pan","year":"2021","unstructured":"Pan, L., Chen, X.: Group sparse optimization for images recovery using capped folded concave functions. SIAM J. Image Sci. 14(1), 1\u201325 (2021)","journal-title":"SIAM J. Image Sci."},{"key":"1766_CR48","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/BF01582097","volume":"16","author":"JS Pang","year":"1979","unstructured":"Pang, J.S.: On a class of least-element linear complementarity problems. Math. Progr. 16, 111\u2013126 (1979)","journal-title":"Math. Progr."},{"key":"1766_CR49","unstructured":"Pang, J.S.: Leaast-element complementarity theory. Ph.D. Thesis. Department of Operations Research, Stanford University (1976)"},{"key":"1766_CR50","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1007\/BFb0121072","volume":"25","author":"JS Pang","year":"1985","unstructured":"Pang, J.S., Chandrasekaran, R.: Linear complementarity problems solvable by a polynomially bounded pivoting algorithm. Math. Progr. Study 25, 13\u201327 (1985)","journal-title":"Math. Progr. Study"},{"key":"1766_CR51","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1287\/moor.2016.0795","volume":"42","author":"JS Pang","year":"2017","unstructured":"Pang, J.S., Razaviyayn, M., Alvarado, A.: Computing B-stationary points of nonsmooth dc programs. Math. Oper. Res. 42, 95\u2013118 (2017)","journal-title":"Math. Oper. Res."},{"key":"1766_CR52","doi-asserted-by":"crossref","first-page":"274","DOI":"10.1016\/0022-247X(70)90298-2","volume":"32","author":"WC Rheinboldt","year":"1970","unstructured":"Rheinboldt, W.C.: On M-functions and their applications to nonlinear Gauss-Seidel iterations and to network flows. J. Math. Anal. Appl. 32, 274\u2013307 (1970)","journal-title":"J. Math. Anal. Appl."},{"key":"1766_CR53","doi-asserted-by":"crossref","unstructured":"Rockafellar, R.T.: Convex Analysis. Princeton University Press (1970)","DOI":"10.1515\/9781400873173"},{"key":"1766_CR54","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/BF01585501","volume":"7","author":"A Tamir","year":"1974","unstructured":"Tamir, A.: Minimality and complementarity properties associated with Z-functions and M-functions. Math. Progr. 7, 17\u201331 (1974)","journal-title":"Math. Progr."},{"issue":"1","key":"1766_CR55","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1198\/TECH.2010.10111","volume":"53","author":"RJ Tibshirani","year":"2011","unstructured":"Tibshirani, R.J., Hoefling, H., Tibshirani, R.: Nearly-isotonic regression. Technometrics 53(1), 54\u201361 (2011)","journal-title":"Technometrics"},{"key":"1766_CR56","doi-asserted-by":"crossref","first-page":"3691","DOI":"10.1152\/jn.01073.2009","volume":"6","author":"JC Vogelstein","year":"2010","unstructured":"Vogelstein, J.C., Packer, A.M., Machado, T.A., Sippy, T., Babadi, B., Paninski, L.: Fast nonnegative deconvolution for spike train inference from population calcium imaging. J. Neurophysiol. 6, 3691\u20133704 (2010)","journal-title":"J. Neurophysiol."},{"key":"1766_CR57","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/BF01581726","volume":"80","author":"Y Ye","year":"1998","unstructured":"Ye, Y.: On the complexity of approximating a KKT point of quadratic programming. Math. Progr. 80, 195\u2013211 (1998)","journal-title":"Math. Progr."},{"issue":"2","key":"1766_CR58","doi-asserted-by":"crossref","first-page":"894","DOI":"10.1214\/09-AOS729","volume":"38","author":"C Zhang","year":"2010","unstructured":"Zhang, C.: Nearly unbiased variable selection under minimax concave penalty. Ann. Stat. 38(2), 894\u2013942 (2010)","journal-title":"Ann. Stat."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-021-01766-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10107-021-01766-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-021-01766-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,18]],"date-time":"2023-03-18T11:05:13Z","timestamp":1679137513000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10107-021-01766-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,1,20]]},"references-count":58,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,4]]}},"alternative-id":["1766"],"URL":"https:\/\/doi.org\/10.1007\/s10107-021-01766-4","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,1,20]]},"assertion":[{"value":"18 April 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 December 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 January 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}