{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,27]],"date-time":"2025-12-27T21:08:25Z","timestamp":1766869705389,"version":"3.37.3"},"reference-count":66,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2018,11,26]],"date-time":"2018-11-26T00:00:00Z","timestamp":1543190400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2018,11,26]],"date-time":"2018-11-26T00:00:00Z","timestamp":1543190400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100003593","name":"CNPq","doi-asserted-by":"crossref","award":["305462\/2014-8"],"award-info":[{"award-number":["305462\/2014-8"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100003593","name":"CNPq","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"crossref"}]},{"name":"CNPq - Ci\u00eancias sem Fronteiras","award":["203360\/2014-1"],"award-info":[{"award-number":["203360\/2014-1"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2020,6]]},"DOI":"10.1007\/s10479-018-3104-8","type":"journal-article","created":{"date-parts":[[2018,11,26]],"date-time":"2018-11-26T05:17:07Z","timestamp":1543209427000},"page":"313-339","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":17,"title":["A generalized proximal linearized algorithm for DC functions with application to the optimal size of the firm problem"],"prefix":"10.1007","volume":"289","author":[{"given":"J. X.","family":"Cruz Neto","sequence":"first","affiliation":[]},{"given":"P. R.","family":"Oliveira","sequence":"additional","affiliation":[]},{"given":"A.","family":"Soubeyran","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4053-8211","authenticated-orcid":false,"given":"J. C. O.","family":"Souza","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,11,26]]},"reference":[{"key":"3104_CR1","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1109\/TMI.2005.862740","volume":"25","author":"S Ahn","year":"2006","unstructured":"Ahn, S., Fessler, J. A., Blatt, D., & Hero, A. O. (2006). Convergent incremental optimization transfer algorithms: Application to tomography. IEEE Transactions on Medical Imaging, 25, 283\u2013296.","journal-title":"IEEE Transactions on Medical Imaging"},{"key":"3104_CR2","unstructured":"An, L. T. H., Ngai, H. V., & Pham, D. T. (2009). Convergence analysis of DC algorithm for DC programming with subanalytic data. Ann. Oper. Res., Technical Report, LMI, INSA-Rouen."},{"issue":"1\u20132","key":"3104_CR3","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/s10107-011-0484-9","volume":"137","author":"H Attouch","year":"2013","unstructured":"Attouch, H., Bolte, J., & Svaiter, B. F. (2013). Convergence of descent methods for semi-algebraic and tame problems: Proximal algorithms, forward\u2013backward splitting, and regularized Gauss\u2013Seidel methods. Mathematical Programming, 137(1\u20132), 91\u2013129.","journal-title":"Mathematical Programming"},{"key":"3104_CR4","doi-asserted-by":"publisher","first-page":"961","DOI":"10.1080\/02331931003770411","volume":"60","author":"M Ba\u010d\u00e1k","year":"2011","unstructured":"Ba\u010d\u00e1k, M., & Borwein, J. M. (2011). On difference convexity of locally Lipschitz functions. Optimization, 60, 961\u2013978.","journal-title":"Optimization"},{"key":"3104_CR5","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1007\/s10957-014-0569-8","volume":"164","author":"T Bao","year":"2015","unstructured":"Bao, T., Mordukhovich, B. S., & Soubeyran, A. (2015). Variational analysis in psychological modelling. Journal of Optimization Theory and Applications, 164, 290\u2013315.","journal-title":"Journal of Optimization Theory and Applications"},{"issue":"1\u20132","key":"3104_CR6","first-page":"53","volume":"269","author":"TQ Bao","year":"2016","unstructured":"Bao, T. Q., Cobza\u015f, S., & Soubeyran, A. (2016a). Variational principles, completeness and the existence of traps in behavioral sciences. Annals of Operations Research, 269(1\u20132), 53\u201379.","journal-title":"Annals of Operations Research"},{"issue":"12","key":"3104_CR7","doi-asserted-by":"publisher","first-page":"2049","DOI":"10.1080\/02331934.2016.1228062","volume":"65","author":"TQ Bao","year":"2016","unstructured":"Bao, T. Q., Khanh, P. Q., & Soubeyran, A. (2016b). Variational principles with generalized distances and the modelization of organizational change. Optimization, 65(12), 2049\u20132066.","journal-title":"Optimization"},{"issue":"1","key":"3104_CR8","doi-asserted-by":"publisher","first-page":"810","DOI":"10.1137\/140975589","volume":"26","author":"GC Bento","year":"2016","unstructured":"Bento, G. C., Cruz Neto, J. X., Lopes, J., Soares, Jr P., & Soubeyran, A. (2016). Generalized proximal distances for bilevel equilibrium problems. SIAM Journal on Optimization, 26(1), 810\u2013830.","journal-title":"SIAM Journal on Optimization"},{"key":"3104_CR9","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1007\/s10957-015-0711-2","volume":"166","author":"GC Bento","year":"2015","unstructured":"Bento, G. C., & Soubeyran, A. (2015a). Generalized inexact proximal algorithms: Routines formation with resistance to change, following worthwhile changes. Journal of Optimization Theory and Applications, 166, 172\u2013187.","journal-title":"Journal of Optimization Theory and Applications"},{"key":"3104_CR10","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1007\/s11228-015-0319-6","volume":"23","author":"GC Bento","year":"2015","unstructured":"Bento, G. C., & Soubeyran, A. (2015b). A generalized inexact proximal point method for nonsmooth functions that satisfies Kurdyka-\u0141ojasiewicz inequality. Set-Valued and Variational Analysis, 23, 501\u2013517.","journal-title":"Set-Valued and Variational Analysis"},{"issue":"4","key":"3104_CR11","doi-asserted-by":"publisher","first-page":"1205","DOI":"10.1137\/050644641","volume":"17","author":"J Bolte","year":"2007","unstructured":"Bolte, J., Daniliidis, A., & Lewis, A. (2007). \u0141ojasiewicz inequality for nonsmooth subanalytic functions with applications to subgradient dynamic systems. SIAM Optimization, 17(4), 1205\u20131223.","journal-title":"SIAM Optimization"},{"key":"3104_CR12","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/s10107-013-0701-9","volume":"146","author":"J Bolte","year":"2014","unstructured":"Bolte, J., Sabach, S., & Teboulle, M. (2014). Proximal alternating linearized minimization for nonconvex and nonsmooth problems. Mathematical Programming, 146, 459\u2013494.","journal-title":"Mathematical Programming"},{"key":"3104_CR13","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/S0304-3975(02)00692-8","volume":"305","author":"V Brattka","year":"2003","unstructured":"Brattka, V. (2003). Recursive quasi-metric spaces. Theoretical Computer Science, 305, 17\u201342.","journal-title":"Theoretical Computer Science"},{"issue":"4","key":"3104_CR14","doi-asserted-by":"publisher","first-page":"816","DOI":"10.1287\/moor.26.4.816.10011","volume":"26","author":"RS Burachik","year":"2001","unstructured":"Burachik, R. S., & Svaiter, B. F. (2001). A relative error tolerance for a family of generalized proximal point methods. Mathematics of Operations Research, 26(4), 816\u2013831.","journal-title":"Mathematics of Operations Research"},{"key":"3104_CR15","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1137\/0803026","volume":"3","author":"G Chen","year":"1993","unstructured":"Chen, G., & Teboulle, M. (1993). Convergence analysis of proximal-like optimization algorithm using Bregman functions. SIAM Journal on Optimization, 3, 538\u2013543.","journal-title":"SIAM Journal on Optimization"},{"issue":"2","key":"3104_CR16","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1016\/j.ejor.2009.03.045","volume":"201","author":"JX Cruz Neto","year":"2010","unstructured":"Cruz Neto, J. X., Oliveira, P. R., Souza, S. D. S., & Soubeyran, A. (2010). A proximal algorithm with separable Bregman distances for quasiconvex optimization over the nonnegative orthant. European Journal of Operation Research, 201(2), 365\u2013376.","journal-title":"European Journal of Operation Research"},{"key":"3104_CR17","doi-asserted-by":"publisher","first-page":"1413","DOI":"10.1002\/cpa.20042","volume":"57","author":"I Daubechies","year":"2004","unstructured":"Daubechies, I., Defrise, M., & De Mol, C. (2004). An iterative thresholding algorithm for linear inverse problems with a sparsity constraint. Communications on Pure and Applied Mathematics, 57, 1413\u20131457.","journal-title":"Communications on Pure and Applied Mathematics"},{"key":"3104_CR18","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1287\/moor.18.1.202","volume":"18","author":"J Eckstein","year":"1993","unstructured":"Eckstein, J. (1993). Nonlinear proximal point algorithms using Bregman functions, with applications to convex programming. Mathematics of Operations Research, 18, 202\u2013226.","journal-title":"Mathematics of Operations Research"},{"key":"3104_CR19","doi-asserted-by":"publisher","first-page":"2835","DOI":"10.1088\/0031-9155\/44\/11\/311","volume":"44","author":"H Erdogan","year":"1999","unstructured":"Erdogan, H., & Fessler, J. A. (1999). Ordered subsets algorithms for transmission tomography. Physics in Medicine and Biology, 44, 2835\u20132851.","journal-title":"Physics in Medicine and Biology"},{"key":"3104_CR20","doi-asserted-by":"publisher","first-page":"139","DOI":"10.2307\/2007918","volume":"50","author":"E Fern\u00e1ndez Cara","year":"1988","unstructured":"Fern\u00e1ndez Cara, E., & Moreno, C. (1988). Critical point approximation through exact regularization. Mathematics of Computation, 50, 139\u2013153.","journal-title":"Mathematics of Computation"},{"key":"3104_CR21","doi-asserted-by":"publisher","first-page":"874","DOI":"10.1007\/s10957-014-0642-3","volume":"165","author":"P Frankel","year":"2015","unstructured":"Frankel, P., Garrigos, G., & Peypouquet, J. (2015). Splitting methods with variable metric for Kurdyka\u2013\u0141ojasiewicz functions and general convergence rates. Journal of Optimization Theory and Applications, 165, 874\u2013900.","journal-title":"Journal of Optimization Theory and Applications"},{"key":"3104_CR22","doi-asserted-by":"publisher","first-page":"4686","DOI":"10.1109\/TSP.2009.2026004","volume":"57","author":"G Gasso","year":"2009","unstructured":"Gasso, G., Rakotomamonjy, A., & Canu, S. (2009). Recovering sparse signals with non-convex penalties and DC programming. IEEE Transactions on Signal Processing, 57, 4686\u20134698.","journal-title":"IEEE Transactions on Signal Processing"},{"key":"3104_CR23","unstructured":"Georgeff, M., Pell, B., Pollack, M., Tambe, M., & Wooldridge, M. (1998). The belief\u2013desire\u2013intention model of agency. In International workshop on agent theories, architectures, and languages (pp. 1\u201310). Berlin, Heidelberg: Springer."},{"key":"3104_CR24","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/s10107-012-0530-2","volume":"141","author":"D Goldfarb","year":"2013","unstructured":"Goldfarb, D., Ma, S., & Scheinberg, K. (2013). Fast alternating linearization methods for minimizing the sum of two convex functions. Mathematical Programming, 141, 349\u2013382.","journal-title":"Mathematical Programming"},{"key":"3104_CR25","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/s10107-007-0124-6","volume":"116","author":"W Hare","year":"2009","unstructured":"Hare, W., & Sagastiz\u00e1bal, C. (2009). Computing proximal points of nonconvex functions. Mathematical Programming, 116, 221\u2013258.","journal-title":"Mathematical Programming"},{"key":"3104_CR26","doi-asserted-by":"publisher","first-page":"707","DOI":"10.2140\/pjm.1959.9.707","volume":"9","author":"P Hartman","year":"1959","unstructured":"Hartman, P. (1959). On functions representable as a difference of convex functions. Pacific Journal of Mathematics, 9, 707\u2013713.","journal-title":"Pacific Journal of Mathematics"},{"key":"3104_CR27","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/978-3-642-45610-7_3","volume":"256","author":"JB Hiriart-Urruty","year":"1986","unstructured":"Hiriart-Urruty, J. B. (1986). Generalized differentiability, duality and optimization for problems dealing with diference of convex functions, convexity and duality in optimization. Lecture Notes in Economics and Mathematical Systems, 256, 37\u201370.","journal-title":"Lecture Notes in Economics and Mathematical Systems"},{"issue":"1","key":"3104_CR28","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1023\/A:1021765131316","volume":"103","author":"R Horst","year":"1999","unstructured":"Horst, R., & Thoai, N. V. (1999). DC programming: Overview. Journal of Optimization Theory and Applications, 103(1), 1\u201343.","journal-title":"Journal of Optimization Theory and Applications"},{"key":"3104_CR29","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1023\/A:1008321423879","volume":"13","author":"A Kaplan","year":"1998","unstructured":"Kaplan, A., & Tichatschke, R. (1998). Proximal point methods and nonconvex optimization. Journal of Global Optimization, 13, 389\u2013406.","journal-title":"Journal of Global Optimization"},{"key":"3104_CR30","doi-asserted-by":"publisher","first-page":"1142","DOI":"10.1137\/S0363012995281742","volume":"35","author":"KC Kiwiel","year":"1997","unstructured":"Kiwiel, K. C. (1997). Proximal minimization methods with generalized Bregman functions. SIAM Journal on Control and Optimization, 35, 1142\u20131168.","journal-title":"SIAM Journal on Control and Optimization"},{"issue":"3","key":"3104_CR31","doi-asserted-by":"publisher","first-page":"668","DOI":"10.1137\/S1052623495288064","volume":"9","author":"KC Kiwiel","year":"1999","unstructured":"Kiwiel, K. C., Rosa, C. H., & Ruszczyski, A. (1999). Proximal decomposition via alternating linearization. SIAM Journal on Optimization, 9(3), 668\u2013689.","journal-title":"SIAM Journal on Optimization"},{"key":"3104_CR32","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/j.tcs.2006.07.050","volume":"365","author":"HPA K\u00fcnzi","year":"2006","unstructured":"K\u00fcnzi, H. P. A., Pajoohesh, H., & Schellekens, M. P. (2006). Partial quasi-metrics. Theoretical Computer Science, 365, 237\u2013246.","journal-title":"Theoretical Computer Science"},{"key":"3104_CR33","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1080\/10618600.2000.10474858","volume":"9","author":"K Lange","year":"2000","unstructured":"Lange, K., Hunter, D. R., & Yang, I. (2000). Optimization transfer using surrogate objective functions. Journal of Computational and Graphical Statistics, 9, 1\u201320.","journal-title":"Journal of Computational and Graphical Statistics"},{"key":"3104_CR34","unstructured":"Lee, D. D. & Seung, H. S. (2001). Algorithms for non-negative matrix factorization. In Advances in NIPS."},{"issue":"1","key":"3104_CR35","first-page":"1","volume":"20","author":"A Lhilali Alaoui","year":"1996","unstructured":"Lhilali Alaoui, A. (1996). Caract\u00e9risation des fonctions D.C. Annales des sciences Math\u00e9matiques du Qu\u00e9bec, 20(1), 1\u201313.","journal-title":"Annales des sciences Math\u00e9matiques du Qu\u00e9bec"},{"issue":"2","key":"3104_CR36","doi-asserted-by":"publisher","first-page":"829","DOI":"10.1137\/140957639","volume":"25","author":"J Mairal","year":"2015","unstructured":"Mairal, J. (2015). Incremental majorization\u2013minimization optimization with application to large-scale machine learning. SIAM Journal on Optimization, 25(2), 829\u2013855.","journal-title":"SIAM Journal on Optimization"},{"key":"3104_CR37","first-page":"19","volume":"11","author":"J Mairal","year":"2010","unstructured":"Mairal, J., Bach, F., Ponce, J., & Sapiro, G. (2010). Online learning for matrix factorization and sparse coding. Journal of Machine Learning Research, 11, 19\u201360.","journal-title":"Journal of Machine Learning Research"},{"key":"3104_CR38","first-page":"154","volume":"4","author":"B Martinet","year":"1970","unstructured":"Martinet, B. (1970). R\u00e9gularisation d\u2019in\u00e9quations variationelles par approximations successives. Revue Fran\u00e7aise d\u2019informatique Recherche Op\u00e9rationnelle, 4, 154\u2013159.","journal-title":"Revue Fran\u00e7aise d\u2019informatique Recherche Op\u00e9rationnelle"},{"key":"3104_CR39","doi-asserted-by":"publisher","first-page":"1235","DOI":"10.1090\/S0002-9947-96-01543-7","volume":"348","author":"BS Mordukhovich","year":"1996","unstructured":"Mordukhovich, B. S., & Shao, Y. (1996). Nonsmooth sequential analysis in asplund spaces. Transactions of the American Mathematical Society, 348, 1235\u20131280.","journal-title":"Transactions of the American Mathematical Society"},{"key":"3104_CR40","doi-asserted-by":"publisher","first-page":"1383","DOI":"10.1080\/02331934.2011.564623","volume":"61","author":"FG Moreno","year":"2012","unstructured":"Moreno, F. G., Oliveira, P. R., & Soubeyran, A. (2012). A proximal point algorithm with quasi distance. Application to habit\u2019s formation. Optimization, 61, 1383\u20131403.","journal-title":"Optimization"},{"key":"3104_CR41","first-page":"475","volume":"24","author":"A Moudafi","year":"2006","unstructured":"Moudafi, A., & Maing\u00e9, P.-E. (2006). On the convergence of an approximate proximal method for d.c. functions. Journal of Computational Mathematics, 24, 475\u2013480.","journal-title":"Journal of Computational Mathematics"},{"key":"3104_CR42","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1080\/02331930903500282","volume":"59","author":"LD Muu","year":"2010","unstructured":"Muu, L. D., & Quoc, T. D. (2010). One step from DC optimization to DC mixed variational inequalities. Optimization, 59, 63\u201376.","journal-title":"Optimization"},{"key":"3104_CR43","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1007\/s10898-007-9156-y","volume":"39","author":"S Pan","year":"2007","unstructured":"Pan, S., & Chen, J. S. (2007). Entropy-like proximal algorithms based on a second-order homogeneous distance function for quasi-convex programming. Journal of Global Optimization, 39, 555\u2013575.","journal-title":"Journal of Global Optimization"},{"key":"3104_CR44","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1016\/j.ejor.2011.07.019","volume":"216","author":"EA Papa Quiroz","year":"2012","unstructured":"Papa Quiroz, E. A., & Oliveira, P. R. (2012). An extension of proximal methods for quasiconvex minimization on the nonnegative orthant. European Journal of Operational Research, 216, 26\u201332.","journal-title":"European Journal of Operational Research"},{"key":"3104_CR45","first-page":"289","volume":"22","author":"DT Pham","year":"1997","unstructured":"Pham, D. T., & An, L. T. H. (1997). Convex analysis approach to DC programming: Theory, algorithms and applications. ACTA Mathematica Vietnamica, 22, 289\u2013355.","journal-title":"ACTA Mathematica Vietnamica"},{"key":"3104_CR46","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/s10479-004-5022-1","volume":"133","author":"DT Pham","year":"2005","unstructured":"Pham, D. T., An, L. T. H., & Akoa, F. (2005). The DC (difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems. Annals of Operations Research, 133, 23\u201346.","journal-title":"Annals of Operations Research"},{"key":"3104_CR47","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1016\/S0304-0208(08)72402-2","volume":"129","author":"DT Pham","year":"1986","unstructured":"Pham, D. T., & Souad, E. B. (1986). Algorithms for solving a class of nonconvex optimization problems: Methods of subgradient. Fermat Days 85: Mathematics for Optimization, 129, 249\u2013271.","journal-title":"Fermat Days 85: Mathematics for Optimization"},{"key":"3104_CR48","unstructured":"Polyak, B. T. (1978). Subgradient methods: A survey of Soviet research. In Nonsmooth optimization: Proceedings of the IIASA workshop March (pp. 5\u201330)."},{"issue":"2","key":"3104_CR49","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/s10107-016-1021-7","volume":"157","author":"M Razaviyayn","year":"2016","unstructured":"Razaviyayn, M., Sanjabi, M., & Luo, Z.-Q. (2016). A stochastic successive minimization method for nonsmooth nonconvex optimization with applications to transceiver design in wireless communication networks. Mathematical Programming, 157(2), 515\u2013545.","journal-title":"Mathematical Programming"},{"key":"3104_CR50","doi-asserted-by":"publisher","first-page":"877","DOI":"10.1137\/0314056","volume":"14","author":"RT Rockafellar","year":"1976","unstructured":"Rockafellar, R. T. (1976). Monotone operators and the proximal point algorithm. SIAM Journal on Control and Optimization, 14, 877\u2013898.","journal-title":"SIAM Journal on Control and Optimization"},{"key":"3104_CR51","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02431-3","volume-title":"Variational analysis","author":"RT Rockafellar","year":"1998","unstructured":"Rockafellar, R. T., & Wets, R. J.-B. (1998). Variational analysis. Berlin: Springer."},{"key":"3104_CR52","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/S0022-247X(03)00285-3","volume":"283","author":"S Romaguera","year":"2003","unstructured":"Romaguera, S., & Sanchis, M. (2003). Applications of utility functions defined on quasi-metric spaces. Journal of Mathematical Analysis and Applications, 283, 219\u2013235.","journal-title":"Journal of Mathematical Analysis and Applications"},{"issue":"1","key":"3104_CR53","doi-asserted-by":"publisher","first-page":"99","DOI":"10.2307\/1884852","volume":"69","author":"HA Simon","year":"1955","unstructured":"Simon, H. A. (1955). A behavioral model of rational choice. The Quarterly Journal of Economics, 69(1), 99\u2013118.","journal-title":"The Quarterly Journal of Economics"},{"key":"3104_CR54","volume-title":"Variational rationality, a theory of individual stability and change: Worthwhile and ambidextry behaviors","author":"A Soubeyran","year":"2009","unstructured":"Soubeyran, A. (2009). Variational rationality, a theory of individual stability and change: Worthwhile and ambidextry behaviors. Marseille: GREQAM, Aix Marseillle University. (Preprint)."},{"key":"3104_CR55","volume-title":"Variational rationality and the \u201cunsatisfied man\u201d: Routines and the course pursuit between aspirations, capabilities and beliefs","author":"A Soubeyran","year":"2010","unstructured":"Soubeyran, A. (2010). Variational rationality and the \u201cunsatisfied man\u201d: Routines and the course pursuit between aspirations, capabilities and beliefs. Marseille: GREQAM, Aix Marseillle University. (Preprint)."},{"key":"3104_CR56","volume-title":"Variational rationality. A theory of worthwhile stay and change approach-avoidance transitions ending in traps","author":"A Soubeyran","year":"2016","unstructured":"Soubeyran, A. (2016). Variational rationality. A theory of worthwhile stay and change approach-avoidance transitions ending in traps. Marseille: GREQAM, Aix Marseillle University. (Preprint)."},{"key":"3104_CR57","volume-title":"Variational rationality 1.a. Proximal dynamics and stationary traps: When is it worthwhile to move?","author":"A Soubeyran","year":"2018","unstructured":"Soubeyran, A. (2018a). Variational rationality 1.a. Proximal dynamics and stationary traps: When is it worthwhile to move?. Marseille: GREQAM-AMSE, Aix-Marseille University. (Preprint)."},{"key":"3104_CR58","volume-title":"Variational rationality 1.b. The formation of preferences and intentions","author":"A Soubeyran","year":"2018","unstructured":"Soubeyran, A. (2018b). Variational rationality 1.b. The formation of preferences and intentions. Marseille: GREQAM-AMSE, Aix-Marseille University. (Preprint)."},{"issue":"4","key":"3104_CR59","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1007\/s10898-015-0282-7","volume":"63","author":"JCO Souza","year":"2015","unstructured":"Souza, J. C. O., & Oliveira, P. R. (2015). A proximal point algorithm for DC functions on Hadamard manifolds. Journal of Global Optimization, 63(4), 797\u2013810.","journal-title":"Journal of Global Optimization"},{"key":"3104_CR60","first-page":"451","volume":"21","author":"W Sun","year":"2003","unstructured":"Sun, W., Sampaio, R. J. B., & Candido, M. A. B. (2003). Proximal point algorithm for minimization of DC Functions. Journal of Computational Mathematics, 21, 451\u2013462.","journal-title":"Journal of Computational Mathematics"},{"key":"3104_CR61","doi-asserted-by":"publisher","first-page":"177","DOI":"10.24033\/msmf.269","volume":"60","author":"JF Toland","year":"1979","unstructured":"Toland, J. F. (1979). On subdifferential calculus and duality in nonconvex optimization. Bulletin Soci\u00e9t\u00e9 Math\u00e9matique de France, M\u00e9moire, 60, 177\u2013183.","journal-title":"Bulletin Soci\u00e9t\u00e9 Math\u00e9matique de France, M\u00e9moire"},{"key":"3104_CR62","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1287\/moor.8.2.231","volume":"8","author":"J-P Vial","year":"1983","unstructured":"Vial, J.-P. (1983). Strong and weak convexity of sets and functions. Mathematics of Operations Research, 8, 231\u2013259.","journal-title":"Mathematics of Operations Research"},{"issue":"4","key":"3104_CR63","first-page":"405","volume":"30","author":"A Yassine","year":"2001","unstructured":"Yassine, A., Alaa, N., & Lhilali Alaoui, A. (2001). Convergence of Toland\u2019s critical points for sequences of D.C. functions and application to the resolution of semilinear elliptic problems. Control and Cybernetics, 30(4), 405\u2013417.","journal-title":"Control and Cybernetics"},{"issue":"4","key":"3104_CR64","doi-asserted-by":"publisher","first-page":"915","DOI":"10.1162\/08997660360581958","volume":"15","author":"A Yuille","year":"2003","unstructured":"Yuille, A., & Rangarajan, A. (2003). The concave\u2013convex procedure. Neural Computation, 15(4), 915\u2013936.","journal-title":"Neural Computation"},{"key":"3104_CR65","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/5804.001.0001","volume-title":"Reasoning about rational agents","author":"M Wooldridge","year":"2000","unstructured":"Wooldridge, M. (2000). Reasoning about rational agents. Cambridge: The MIT Press."},{"issue":"5","key":"3104_CR66","doi-asserted-by":"publisher","first-page":"2413","DOI":"10.1137\/090766930","volume":"20","author":"A Zaslavski","year":"2010","unstructured":"Zaslavski, A. (2010). Convergence of a proximal point method in the presence of computational errors in Hilbert spaces. SIAM Journal on Optimization, 20(5), 2413\u20132421.","journal-title":"SIAM Journal on Optimization"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-018-3104-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-018-3104-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-018-3104-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,12]],"date-time":"2024-07-12T19:05:38Z","timestamp":1720811138000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-018-3104-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,11,26]]},"references-count":66,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2020,6]]}},"alternative-id":["3104"],"URL":"https:\/\/doi.org\/10.1007\/s10479-018-3104-8","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"type":"print","value":"0254-5330"},{"type":"electronic","value":"1572-9338"}],"subject":[],"published":{"date-parts":[[2018,11,26]]},"assertion":[{"value":"26 November 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}