{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,28]],"date-time":"2026-01-28T06:53:20Z","timestamp":1769583200196,"version":"3.49.0"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,11,23]],"date-time":"2015-11-23T00:00:00Z","timestamp":1448236800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Optim Theory Appl"],"published-print":{"date-parts":[[2016,4]]},"DOI":"10.1007\/s10957-015-0847-0","type":"journal-article","created":{"date-parts":[[2015,11,23]],"date-time":"2015-11-23T18:27:32Z","timestamp":1448303252000},"page":"280-289","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Proximal Point Algorithms for Multi-criteria Optimization with the Difference of Convex Objective Functions"],"prefix":"10.1007","volume":"169","author":[{"given":"Ying","family":"Ji","sequence":"first","affiliation":[]},{"given":"Mark","family":"Goh","sequence":"additional","affiliation":[]},{"given":"Robert","family":"de Souza","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,11,23]]},"reference":[{"key":"847_CR1","doi-asserted-by":"crossref","first-page":"527","DOI":"10.1007\/s10898-004-8318-4","volume":"33","author":"N Gadhi","year":"2005","unstructured":"Gadhi, N., Laghdir, M., Metrane, A.: Optimality conditions for D.C. vector optimization problems under reverse convex constraints. J. Glob. Optim. 33, 527\u2013540 (2005)","journal-title":"J. Glob. Optim."},{"key":"847_CR2","first-page":"41","volume":"59","author":"SJ Qu","year":"2013","unstructured":"Qu, S.J., Goh, M., Wu, S.Y., Souza, R.D.: Multiobjective DC programs with infinite convex constraints. J. Glob. Optim. 59, 41\u201358 (2013)","journal-title":"J. Glob. Optim."},{"key":"847_CR3","doi-asserted-by":"crossref","first-page":"273","DOI":"10.24033\/bsmf.1625","volume":"93","author":"JJ Moreau","year":"1965","unstructured":"Moreau, J.J.: Proximat\u00e9 et dualit\u00e9 dans un espace Hilbertien. Bull. Soc. Math. Fr. 93, 273\u2013299 (1965)","journal-title":"Bull. Soc. Math. Fr."},{"key":"847_CR4","doi-asserted-by":"crossref","first-page":"877","DOI":"10.1137\/0314056","volume":"14","author":"RT Rockafellar","year":"1976","unstructured":"Rockafellar, R.T.: Monotone operators and the proximal point algorithm. SIAM J. Control Optim. 14, 877\u2013898 (1976)","journal-title":"SIAM J. Control Optim."},{"key":"847_CR5","first-page":"154","volume":"4","author":"B Martinet","year":"1970","unstructured":"Martinet, B.: Regularisation, dinquations variationelles par approximations succesives. Rev. Fra. Inform. Rech. Op\u00e9r. 4, 154\u2013159 (1970)","journal-title":"Rev. Fra. Inform. Rech. Op\u00e9r."},{"key":"847_CR6","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1016\/j.ejor.2011.05.006","volume":"214","author":"KDV Villacorta","year":"2011","unstructured":"Villacorta, K.D.V., Oliveira, P.R.: An interior proximal method in vector optimization. Eur. J. Oper. Res. 214, 485\u2013492 (2011)","journal-title":"Eur. J. Oper. Res."},{"key":"847_CR7","doi-asserted-by":"crossref","first-page":"953","DOI":"10.1137\/S1052623403429093","volume":"15","author":"H Bonnel","year":"2005","unstructured":"Bonnel, H., Iusem, A.N., Svaiter, B.F.: Proximal methods in vector optimization. SIAM J. Optim. 15, 953\u2013970 (2005)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"847_CR8","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1007\/s11228-014-0279-2","volume":"22","author":"GC Bento","year":"2014","unstructured":"Bento, G.C., Cruz Neto, J.X., Soubeyran, A.: A proximal point-type method for multicriteria optimization. Set-valued Var. Anal. 22(3), 557\u2013573 (2014)","journal-title":"Set-valued Var. Anal."},{"key":"847_CR9","doi-asserted-by":"crossref","DOI":"10.1515\/9781400873173","volume-title":"Convex Analysis","author":"RT Rockafellar","year":"1970","unstructured":"Rockafellar, R.T.: Convex Analysis. Princeton University Press, Princeton (1970)"},{"key":"847_CR10","first-page":"279","volume":"12","author":"RS Burachik","year":"2005","unstructured":"Burachik, R.S., Jeyakumar, V.: A dual condition for the convex subdifferential sum formula with applications. J. Convex Anal. 12, 279\u2013290 (2005)","journal-title":"J. Convex Anal."},{"key":"847_CR11","volume-title":"Nonlinear Programming: A Unified Approach","author":"WI Zangwill","year":"1969","unstructured":"Zangwill, W.I.: Nonlinear Programming: A Unified Approach. Prentice-Hall, Englewood Cliffs (1969)"},{"issue":"4","key":"847_CR12","first-page":"451","volume":"21","author":"WY Sun","year":"2003","unstructured":"Sun, W.Y., Sampaio, R.J.B., Candido, M.A.B.: Proximal point algorithm for minimization of DC function. J. Comput. Math. 21(4), 451\u2013462 (2003)","journal-title":"J. Comput. Math."},{"issue":"4","key":"847_CR13","first-page":"475","volume":"24","author":"A Moudafi","year":"2006","unstructured":"Moudafi, A., Maing\u00e9, P.E.: On the convergence of an approximate proximal method for DC functions. J. Comput. Math. 24(4), 475\u2013480 (2006)","journal-title":"J. Comput. Math."},{"issue":"4","key":"847_CR14","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1002\/(SICI)1099-1158(199910)4:4<271::AID-IJFE110>3.0.CO;2-M","volume":"4","author":"S Hwang","year":"1999","unstructured":"Hwang, S., Satchell, S.E.: Modelling emerging market risk premia using higher moments. Int. J. Financ. Econ. 4(4), 271\u2013296 (1999)","journal-title":"Int. J. Financ. Econ."},{"key":"847_CR15","unstructured":"Parpas P., Rustem B.: Global optimization of the scenario generation and portfolio selection problems. In: Computation Science and Applications. Kluwer Academic, Norwell (2000)"},{"key":"847_CR16","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1016\/j.ejor.2007.06.034","volume":"190","author":"SJ Qu","year":"2008","unstructured":"Qu, S.J., Zhang, K.C., Wang, F.S.: A global optimization using linear relaxation for generalized geometric programming. Eur. J. Oper. Res. 190, 345\u2013356 (2008)","journal-title":"Eur. J. Oper. Res."}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-015-0847-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10957-015-0847-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-015-0847-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T09:58:45Z","timestamp":1559469525000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10957-015-0847-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,11,23]]},"references-count":16,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,4]]}},"alternative-id":["847"],"URL":"https:\/\/doi.org\/10.1007\/s10957-015-0847-0","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"value":"0022-3239","type":"print"},{"value":"1573-2878","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,11,23]]}}}