{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,31]],"date-time":"2025-03-31T14:24:34Z","timestamp":1743431074459},"reference-count":58,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2011,8,20]],"date-time":"2011-08-20T00:00:00Z","timestamp":1313798400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2013,2]]},"DOI":"10.1007\/s10107-011-0484-9","type":"journal-article","created":{"date-parts":[[2011,8,19]],"date-time":"2011-08-19T00:33:01Z","timestamp":1313713981000},"page":"91-129","source":"Crossref","is-referenced-by-count":890,"title":["Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward\u2013backward splitting, and regularized Gauss\u2013Seidel methods"],"prefix":"10.1007","volume":"137","author":[{"given":"Hedy","family":"Attouch","sequence":"first","affiliation":[]},{"given":"J\u00e9r\u00f4me","family":"Bolte","sequence":"additional","affiliation":[]},{"given":"Benar Fux","family":"Svaiter","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,8,20]]},"reference":[{"issue":"2","key":"484_CR1","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1137\/040605266","volume":"16","author":"P.-A. Absil","year":"2005","unstructured":"Absil P.-A., Mahony R., Andrews B.: Convergence of the iterates of descent methods for analytic cost functions. SIAM J. Optim. 16(2), 531\u2013547 (2005)","journal-title":"SIAM J. Optim."},{"key":"484_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1051\/proc:071701","volume":"17","author":"A. Aragon","year":"2007","unstructured":"Aragon A., Dontchev A., Geoffroy M.: Convergence of the proximal point method for metrically regular mappings. ESAIM Proc., EDP Sci., Les Ulis 17, 1\u20138 (2007)","journal-title":"ESAIM Proc., EDP Sci., Les Ulis"},{"key":"484_CR3","doi-asserted-by":"crossref","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. Ser. B 116, 5\u201316 (2009)","journal-title":"Math. Program. Ser. B"},{"key":"484_CR4","first-page":"485","volume":"15","author":"H. Attouch","year":"2008","unstructured":"Attouch H., Bolte J., Redont P., Soubeyran A.: Alternating proximal algorithms for weakly coupled convex minimization problems. Applications to dynamical games and PDE\u2019s. J. Convex Anal. 15, 485\u2013506 (2008)","journal-title":"J. Convex Anal."},{"issue":"2","key":"484_CR5","doi-asserted-by":"crossref","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\u2013Lojasiewicz inequality. Math. Oper. Res. 35(2), 438\u2013457 (2010)","journal-title":"Math. Oper. Res."},{"issue":"5","key":"484_CR6","doi-asserted-by":"crossref","first-page":"3246","DOI":"10.1137\/090754297","volume":"48","author":"H. Attouch","year":"2010","unstructured":"Attouch H., Brice\u00f1o-Arias L.M., Combettes P.L.: A parallel splitting method for coupled monotone inclusions. SIAM J. Control Optim. 48(5), 3246\u20133270 (2010)","journal-title":"SIAM J. Control Optim."},{"key":"484_CR7","doi-asserted-by":"crossref","unstructured":"Attouch, H., Soubeyran, A.: Local search proximal algorithms as decision dynamics with costs to move, Set Valued and Variational Analysis, Online First, 12 May 2010","DOI":"10.1007\/s11228-010-0139-7"},{"key":"484_CR8","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1007\/BF00940050","volume":"73","author":"A. Auslender","year":"1992","unstructured":"Auslender A.: Asymptotic properties of the Fenchel dual functional and applications to decomposition problems. J. Optim. Theory Appl. 73, 427\u2013449 (1992)","journal-title":"J. Optim. Theory Appl."},{"key":"484_CR9","doi-asserted-by":"crossref","unstructured":"Beck, A., Teboulle, M.: A Linearly Convergent Algorithm for Solving a Class of Nonconvex\/Affine Feasibility Problems, July 2010, to appear in the book Fixed-Point Algorithms for Inverse Problems in Science and Engineering, part of the Springer Verlag series Optimization and Its Applications. Available online http:\/\/ie.technion.ac.il\/Home\/Users\/becka.html","DOI":"10.1007\/978-1-4419-9569-8_3"},{"key":"484_CR10","unstructured":"Benedetti R., Risler J.-J.: Real Algebraic and Semialgebraic Sets. Hermann, \u00c9diteur des Sciences et des Arts, Paris (1990)"},{"key":"484_CR11","doi-asserted-by":"crossref","first-page":"629","DOI":"10.1007\/s00041-008-9035-z","volume":"14","author":"T. Blumensath","year":"2008","unstructured":"Blumensath T., Davis M.E.: Iterative Thresholding for Sparse Approximations. J. Fourier Anal. Appl. 14, 629\u2013654 (2008)","journal-title":"J. Fourier Anal. Appl."},{"key":"484_CR12","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/j.acha.2009.04.002","volume":"27","author":"T. Blumensath","year":"2009","unstructured":"Blumensath T., Blumensath T.: Iterative hard thresholding for compressed sensing. Appl. Comput. Harmon. Anal. 27, 265\u2013274 (2009)","journal-title":"Appl. Comput. Harmon. Anal."},{"key":"484_CR13","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03718-8","volume-title":"Real Algebraic Geometry, Ergebnisse der Mat., vol. 36","author":"J. Bochnak","year":"1998","unstructured":"Bochnak J., Coste M., Roy M.-F.: Real Algebraic Geometry, Ergebnisse der Mat., vol. 36. Springer, Berlin (1998)"},{"key":"484_CR14","doi-asserted-by":"crossref","unstructured":"Bolte, J., Combettes, P.L., Pesquet, J.-C.: Alternating proximal algorithm for blind image recovery. In: Proceedings of the IEEE International Conference on Image Processing. Hong-Kong, Sept 26\u201329 2010","DOI":"10.1109\/ICIP.2010.5652173"},{"issue":"4","key":"484_CR15","doi-asserted-by":"crossref","first-page":"1205","DOI":"10.1137\/050644641","volume":"17","author":"J. Bolte","year":"2006","unstructured":"Bolte J., Daniilidis , Lewis A.: The \u0141ojasiewicz inequality for nonsmooth subanalytic functions with applications to subgradient dynamical systems. SIAM J. Optim. 17(4), 1205\u20131223 (2006)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"484_CR16","doi-asserted-by":"crossref","first-page":"729","DOI":"10.1016\/j.jmaa.2005.07.068","volume":"321","author":"J. Bolte","year":"2006","unstructured":"Bolte J., Daniilidis A., Lewis A.: A nonsmooth Morse-Sard theorem for subanalytic functions. J. Math. Anal. Appl. 321(2), 729\u2013740 (2006)","journal-title":"J. Math. Anal. Appl."},{"issue":"2","key":"484_CR17","doi-asserted-by":"crossref","first-page":"556","DOI":"10.1137\/060670080","volume":"18","author":"J. Bolte","year":"2007","unstructured":"Bolte J., Daniilidis A., Lewis A., Shiota M.: Clarke subgradients of stratifiable functions. SIAM J. Optim. 18(2), 556\u2013572 (2007)","journal-title":"SIAM J. Optim."},{"key":"484_CR18","doi-asserted-by":"crossref","first-page":"3319","DOI":"10.1090\/S0002-9947-09-05048-X","volume":"362","author":"J. Bolte","year":"2010","unstructured":"Bolte J., Daniilidis A., Ley O., Mazet L.: Characterizations of \u0141ojasiewicz inequalities: subgradient flows, talweg, convexity. Trans. Am. Math. Soc. 362, 3319\u20133363 (2010)","journal-title":"Trans. Am. Math. Soc."},{"key":"484_CR19","unstructured":"Bredies, K., Lorenz, D.A.: Minimization of non-smooth, non-convex functionals by iterative thresholding, preprint available at http:\/\/www.uni-graz.at\/~bredies\/publications.html (2009)"},{"key":"484_CR20","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1007\/BF01584377","volume":"33","author":"J.V. Burke","year":"1985","unstructured":"Burke J.V.: Descent methods for composite nondifferentiable optimization problems. Math. Program. 33, 260\u2013279 (1985)","journal-title":"Math. Program."},{"key":"484_CR21","doi-asserted-by":"crossref","first-page":"707","DOI":"10.1109\/LSP.2007.898300","volume":"14","author":"R. Chartrand","year":"2007","unstructured":"Chartrand R.: Exact Reconstruction of Sparse Signals via Nonconvex Minimization. Signal Process. Lett. IEEE 14, 707\u2013710 (2007)","journal-title":"Signal Process. Lett. IEEE"},{"key":"484_CR22","doi-asserted-by":"crossref","first-page":"1017","DOI":"10.1016\/S0362-546X(03)00037-3","volume":"53","author":"R. Chill","year":"2003","unstructured":"Chill R., Jendoubi M.A.: Convergence to steady states in asymptotically autonomous semilinear evolution equations. Nonlinear Anal. 53, 1017\u20131039 (2003)","journal-title":"Nonlinear Anal."},{"key":"484_CR23","volume-title":"Nonsmooth Analysis and Control Theory, Graduate Texts in Mathematics, vol. 178","author":"F.H. Clarke","year":"1998","unstructured":"Clarke F.H., Ledyaev Y., Stern R.I., Wolenski P.R.: Nonsmooth Analysis and Control Theory, Graduate Texts in Mathematics, vol. 178. Springer, New York (1998)"},{"key":"484_CR24","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/S1570-579X(01)80010-0","volume-title":"Inherently Parallel Algorithms in Feasibility and Optimization and Their Applications","author":"P.L. Combettes","year":"2001","unstructured":"Combettes P.L.: Quasi-Fejerian analysis of some optimization algorithms. In: Butnariu, D., Censor, Y., Reich, S. (eds) Inherently Parallel Algorithms in Feasibility and Optimization and Their Applications, pp. 115\u2013152. Elsevier, New York (2001)"},{"key":"484_CR25","doi-asserted-by":"crossref","first-page":"1168","DOI":"10.1137\/050626090","volume":"4","author":"P.L. Combettes","year":"2005","unstructured":"Combettes P.L., Wajs V.R.: Signal recovery by proximal forward\u2013backward splitting. Multiscale Model. Simul. 4, 1168\u20131200 (2005)","journal-title":"Multiscale Model. Simul."},{"key":"484_CR26","unstructured":"Coste, M.: An introduction to o-minimal geometry, RAAG Notes, Institut de Recherche Math\u00e9matiques de Rennes, 81\u00a0pp., Nov 1999"},{"key":"484_CR27","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1090\/qam\/10667","volume":"2","author":"H.B. Curry","year":"1944","unstructured":"Curry H.B.: The method of steepest descent for non-linear minimization problems. Q. Appl. Math. 2, 258\u2013261 (1944)","journal-title":"Q. Appl. Math."},{"key":"484_CR28","doi-asserted-by":"crossref","unstructured":"Palis, J., De Melo, W.: Geometric theory of dynamical systems. An introduction. (Translated from the Portuguese by A. K. Manning). Springer, New York, Berlin (1982)","DOI":"10.1007\/978-1-4612-5703-5"},{"key":"484_CR29","doi-asserted-by":"crossref","first-page":"1289","DOI":"10.1109\/TIT.2006.871582","volume":"4","author":"D.L. Donoho","year":"2006","unstructured":"Donoho D.L.: Compressed Sensing. IEEE Trans. Inform. Theory 4, 1289\u20131306 (2006)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"484_CR30","doi-asserted-by":"crossref","unstructured":"van den Dries, L.: Tame Topology and o-minimal Structures. London Mathematical Society Lecture Note Series, vol. 248. Cambridge University Press, Cambridge, x+180\u00a0pp. (1998)","DOI":"10.1017\/CBO9780511525919"},{"key":"484_CR31","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1215\/S0012-7094-96-08416-1","volume":"84","author":"L. Dries van den","year":"1996","unstructured":"van den Dries L., Miller C.: Geometric categories and o-minimal structures. Duke Math. J. 84, 497\u2013540 (1996)","journal-title":"Duke Math. J."},{"issue":"4","key":"484_CR32","doi-asserted-by":"crossref","first-page":"587","DOI":"10.1080\/10556789908805730","volume":"10","author":"L. Grippo","year":"1999","unstructured":"Grippo L., Sciandrone M.: Globally convergent block-coordinate techniques for unconstrained optimization. Optim. Methods Softw. 10(4), 587\u2013637 (1999)","journal-title":"Optim. Methods Softw."},{"issue":"1\u20132","key":"484_CR33","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/s10107-007-0124-6","volume":"116","author":"W. Hare","year":"2009","unstructured":"Hare W., Sagastiz\u00e1bal C.: Computing proximal points of nonconvex functions. Math. Program. Ser. B 116(1\u20132), 221\u2013258 (2009)","journal-title":"Math. Program. Ser. B"},{"issue":"2","key":"484_CR34","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1006\/jdeq.1997.3393","volume":"144","author":"A. Haraux","year":"1999","unstructured":"Haraux A., Jendoubi M.A.: Convergence of solutions of second-order gradient-like systems with analytic nonlinearities. J. Differ. Equ. 144(2), 313\u2013320 (1999)","journal-title":"J. Differ. Equ."},{"key":"484_CR35","doi-asserted-by":"crossref","first-page":"675","DOI":"10.1016\/S0362-546X(00)00145-0","volume":"46","author":"S.-Z. Huang","year":"2001","unstructured":"Huang S.-Z., Taka\u010d P.: Convergence in gradient-like systems which are asymptotically autonomous and analytic. Nonlinear Anal., Ser. A Theory Methods 46, 675\u2013698 (2001)","journal-title":"Nonlinear Anal., Ser. A Theory Methods"},{"issue":"4","key":"484_CR36","doi-asserted-by":"crossref","first-page":"1097","DOI":"10.1137\/S1052623401399587","volume":"13","author":"A.N. 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), 1097\u20131894 (2003)","journal-title":"SIAM J. Optim."},{"key":"484_CR37","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1007\/s11228-006-0014-8","volume":"14","author":"A.Y. Kruger","year":"2006","unstructured":"Kruger A.Y.: About regularity of collections of sets. Set Valued Anal. 14, 187\u2013206 (2006)","journal-title":"Set Valued Anal."},{"key":"484_CR38","doi-asserted-by":"crossref","first-page":"769","DOI":"10.5802\/aif.1638","volume":"48","author":"K. Kurdyka","year":"1998","unstructured":"Kurdyka K.: On gradients of functions definable in o-minimal structures. Ann. Inst. Fourier 48, 769\u2013783 (1998)","journal-title":"Ann. Inst. Fourier"},{"issue":"13\u201314","key":"484_CR39","doi-asserted-by":"crossref","first-page":"1543","DOI":"10.1002\/mana.200410564","volume":"280","author":"C. Lageman","year":"2007","unstructured":"Lageman C.: Pointwise convergence of gradient-like systems. Math. Nachr. 280(13\u201314), 1543\u20131558 (2007)","journal-title":"Math. Nachr."},{"key":"484_CR40","doi-asserted-by":"crossref","first-page":"702","DOI":"10.1137\/S1052623401387623","volume":"13","author":"A.S. Lewis","year":"2003","unstructured":"Lewis A.S.: Active sets, nonsmoothness and sensitivity. SIAM J. Optim. 13, 702\u2013725 (2003)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"484_CR41","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1287\/moor.1070.0291","volume":"33","author":"A.S. Lewis","year":"2008","unstructured":"Lewis A.S., Malick J.: Alternating projection on manifolds. Math. Oper. Res. 33(1), 216\u2013234 (2008)","journal-title":"Math. Oper. Res."},{"key":"484_CR42","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1007\/s10208-008-9036-y","volume":"9","author":"A.S. Lewis","year":"2009","unstructured":"Lewis A.S., Luke D.R., Malick J.: Local linear convergence for alternating and averaged nonconvex projections. Found. Comput. Math. 9, 485\u2013513 (2009)","journal-title":"Found. Comput. Math."},{"key":"484_CR43","unstructured":"Lewis, A.S., Wright, S.J.: A proximal method for composite minimization, Optimization online 2008"},{"key":"484_CR44","unstructured":"\u0141ojasiewicz, S.: Une propri\u00e9t\u00e9 topologique des sous-ensembles analytiques r\u00e9els. In: Les \u00c9quations aux D\u00e9riv\u00e9es Partielles, \u00c9ditions du centre National de la Recherche Scientifique, Paris, pp. 87\u201389 (1963)"},{"key":"484_CR45","doi-asserted-by":"crossref","first-page":"1575","DOI":"10.5802\/aif.1384","volume":"43","author":"S. \u0141ojasiewicz","year":"1993","unstructured":"\u0141ojasiewicz S.: Sur la g\u00e9om\u00e9trie semi- et sous-analytique. Ann. Inst. Fourier 43, 1575\u20131595 (1993)","journal-title":"Ann. Inst. Fourier"},{"key":"484_CR46","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-31247-1","volume-title":"Variational Analysis and Generalized Differentiation. I. Basic Theory, Grundlehren der Mathematischen Wissenschaften, vol. 330","author":"B. Mordukhovich","year":"2006","unstructured":"Mordukhovich B.: Variational Analysis and Generalized Differentiation. I. Basic Theory, Grundlehren der Mathematischen Wissenschaften, vol. 330. Springer, Berlin (2006)"},{"issue":"1","key":"484_CR47","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1007\/s10107-006-0089-x","volume":"112","author":"Y. Nesterov","year":"2008","unstructured":"Nesterov Y.: Accelerating the cubic regularization of Newton\u2019s method on convex problems. Math. Program. Ser. B 112(1), 159\u2013181 (2008)","journal-title":"Math. Program. Ser. B"},{"key":"484_CR48","doi-asserted-by":"crossref","unstructured":"Nesterov, Y., Nemirovskii, A.: Interior-point polynomial algorithms in convex programming. SIAM Studies in Applied Mathematics, vol. 13, Philadelphia, PA (1994)","DOI":"10.1137\/1.9781611970791"},{"key":"484_CR49","volume-title":"Iterative Solutions of Nonlinear Equations in Several Variables","author":"J.M. Ortega","year":"1970","unstructured":"Ortega J.M., Rheinboldt W.C.: Iterative Solutions of Nonlinear Equations in Several Variables. Academic Press, New York (1970)"},{"key":"484_CR50","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1287\/moor.27.1.170.331","volume":"27","author":"T. Pennanen","year":"2002","unstructured":"Pennanen T.: Local convergence of the proximal point algorithm and multiplier methods without monotonicity. Math. Oper. Res. 27, 170\u2013191 (2002)","journal-title":"Math. Oper. Res."},{"key":"484_CR51","doi-asserted-by":"crossref","first-page":"5231","DOI":"10.1090\/S0002-9947-00-02550-2","volume":"352","author":"R.A. Poliquin","year":"2000","unstructured":"Poliquin R.A., Rockafellar R.T., Thibault L.: Local differentiability of distance functions. Trans. AMS 352, 5231\u20135249 (2000)","journal-title":"Trans. AMS"},{"key":"484_CR52","volume-title":"Variational Analysis, Grundlehren der Mathematischen Wissenschaften, vol. 317","author":"R.T. Rockafellar","year":"1998","unstructured":"Rockafellar R.T., Wets R.J.-B.: Variational Analysis, Grundlehren der Mathematischen Wissenschaften, vol. 317. Springer, Berlin (1998)"},{"key":"484_CR53","doi-asserted-by":"crossref","first-page":"525","DOI":"10.2307\/2006981","volume":"118","author":"L. Simon","year":"1983","unstructured":"Simon L.: Asymptotics for a class of non-linear evolution equations, with applications to geometric problems. Ann. Math. 118, 525\u2013571 (1983)","journal-title":"Ann. Math."},{"issue":"1","key":"484_CR54","first-page":"59","volume":"6","author":"M.V. Solodov","year":"1999","unstructured":"Solodov M.V., Svaiter B.F.: A hybrid projection-proximal point algorithm. J. Convex Anal. 6(1), 59\u201370 (1999)","journal-title":"J. Convex Anal."},{"key":"484_CR55","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1023\/A:1008777829180","volume":"7","author":"M.V. Solodov","year":"1999","unstructured":"Solodov M.V., Svaiter B.F.: A hybrid approximate extragradient-proximal point algorithm using the enlargement of a maximal monotone operator. Set Valued Anal. 7, 323\u2013345 (1999)","journal-title":"Set Valued Anal."},{"key":"484_CR56","doi-asserted-by":"crossref","first-page":"1013","DOI":"10.1081\/NFA-100108320","volume":"22","author":"M.V. Solodov","year":"2001","unstructured":"Solodov M.V., Svaiter B.F.: A unified framework for some inexact proximal point algorithms. Numer. Funct. Anal. Optim. 22, 1013\u20131035 (2001)","journal-title":"Numer. Funct. Anal. Optim."},{"key":"484_CR57","doi-asserted-by":"crossref","first-page":"1063","DOI":"10.1137\/0331048","volume":"31","author":"S.J. Wright","year":"1993","unstructured":"Wright S.J.: Identifiable surfaces in constrained optimization. SIAM J. Control Optim. 31, 1063\u20131079 (1993)","journal-title":"SIAM J. Control Optim."},{"key":"484_CR58","unstructured":"Wright, S.J.: Accelerated block-coordinate relaxation for regularized optimization, Optimization online 2010"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-011-0484-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-011-0484-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-011-0484-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,14]],"date-time":"2019-06-14T01:25:11Z","timestamp":1560475511000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-011-0484-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,8,20]]},"references-count":58,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2013,2]]}},"alternative-id":["484"],"URL":"https:\/\/doi.org\/10.1007\/s10107-011-0484-9","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,8,20]]}}}