{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T00:42:31Z","timestamp":1772757751345,"version":"3.50.1"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2021,5,28]],"date-time":"2021-05-28T00:00:00Z","timestamp":1622160000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,5,28]],"date-time":"2021-05-28T00:00:00Z","timestamp":1622160000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"name":"The first-named author is grateful to National Elite Foundation of Iran for its financial support."}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Numer Algor"],"published-print":{"date-parts":[[2022,2]]},"DOI":"10.1007\/s11075-021-01128-3","type":"journal-article","created":{"date-parts":[[2021,5,28]],"date-time":"2021-05-28T17:02:24Z","timestamp":1622221344000},"page":"637-674","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["A proximal bundle-based algorithm for nonsmooth constrained multiobjective optimization problems with inexact data"],"prefix":"10.1007","volume":"89","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1431-0520","authenticated-orcid":false,"given":"N.","family":"Hoseini Monjezi","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2488-7892","authenticated-orcid":false,"given":"S.","family":"Nobakhtian","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,5,28]]},"reference":[{"key":"1128_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-08114-4","volume-title":"Introduction to nonsmooth optimization: theory, practice and software","author":"AM Bagirov","year":"2014","unstructured":"Bagirov, A.M., Karmitsa, N., M\u00e4kel\u00e4, M.M.: Introduction to nonsmooth optimization: theory, practice and software. Springer, New York (2014)"},{"key":"1128_CR2","doi-asserted-by":"publisher","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."},{"key":"1128_CR3","volume-title":"Nonsmooth analysis and control theory","author":"FH Clarke","year":"1998","unstructured":"Clarke, F.H., Ledyaev, Y.S., Stern, R.J., Wolenski, P.R.: Nonsmooth analysis and control theory. Springer, New York (1998)"},{"issue":"2","key":"1128_CR4","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":"1128_CR5","doi-asserted-by":"crossref","unstructured":"Gal, T., Hanne, T.: On the development and future aspects of vector optimization and MCDM. In: Cl\u00e1co, J. (ed.) Multicriteria analysis, pp 130\u2013145. Springer, Berlin (1997)","DOI":"10.1007\/978-3-642-60667-0_14"},{"key":"1128_CR6","doi-asserted-by":"publisher","first-page":"696","DOI":"10.1007\/s10957-020-01803-w","volume":"188","author":"B Gebken","year":"2021","unstructured":"Gebken, B., Peitz, S.: An efficient descent method for locally lipschitz multiobjective optimization problems. J. Optim. Theory Appl. 188, 696\u2013723 (2021)","journal-title":"J. Optim. Theory Appl."},{"key":"1128_CR7","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1017\/S0004972700035656","volume":"74","author":"A Gupta","year":"2006","unstructured":"Gupta, A., Mehra, A., Bhatia, D.: Approximate convexity in vector optimisation. Bull. Aust. Math. Soc. 74, 207\u2013218 (2006)","journal-title":"Bull. Aust. Math. Soc."},{"key":"1128_CR8","doi-asserted-by":"publisher","first-page":"2442","DOI":"10.1137\/090754595","volume":"20","author":"W Hare","year":"2010","unstructured":"Hare, W., Sagastiz\u00e1bal, C.: A redistributed proximal bundle method for nonconvex optimization. SIAM J. Optim. 20, 2442\u20132473 (2010)","journal-title":"SIAM J. Optim."},{"key":"1128_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10589-015-9762-4","volume":"63","author":"W Hare","year":"2016","unstructured":"Hare, W., Sagastiz\u00e1bal, C., Solodov, M.: A proximal bundle method for nonsmooth nonconvex functions with inexact information. Comput. Optim. Appl. 63, 1\u201328 (2016)","journal-title":"Comput. Optim. Appl."},{"key":"1128_CR10","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1023\/A:1011259017643","volume":"20","author":"M Hinterm\u00fcller","year":"2001","unstructured":"Hinterm\u00fcller, M.: A proximal bundle method based on approximate subgradients. Comput. Optim. Appl. 20, 245\u2013266 (2001)","journal-title":"Comput. Optim. Appl."},{"key":"1128_CR11","first-page":"57","volume":"60","author":"J-B Hiriart-Urruty","year":"1979","unstructured":"Hiriart-Urruty, J.-B.: New concepts in nondifferentiable programming. Bull. Soc. Math. France 60, 57\u201385 (1979)","journal-title":"Bull. Soc. Math. France"},{"key":"1128_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10898-020-00939-3","volume":"79","author":"N Hoseini Monjezi","year":"2021","unstructured":"Hoseini Monjezi, N., Nobakhtian, S.: A filter proximal bundle method for nonsmooth nonconvex constrained optimization. J. Glob. Optim. 79, 1\u201337 (2021)","journal-title":"J. Glob. Optim."},{"key":"1128_CR13","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1007\/s10589-019-00115-8","volume":"74","author":"N Hoseini Monjezi","year":"2019","unstructured":"Hoseini Monjezi, N., Nobakhtian, S.: A new infeasible proximal bundle algorithm for nonsmooth nonconvex constrained optimization. Comput. Optim. Appl. 74, 443\u2013480 (2019)","journal-title":"Comput. Optim. Appl."},{"key":"1128_CR14","doi-asserted-by":"publisher","unstructured":"Hoseini Monjezi, N., Nobakhtian, S.: An inexact multiple proximal bundle algorithm for nonsmooth nonconvex multiobjective optimization problems. Ann. Oper. Res. https:\/\/doi.org\/10.1007\/s10479-020-03808-0 (2020)","DOI":"10.1007\/s10479-020-03808-0"},{"key":"1128_CR15","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1007\/s10898-016-0488-3","volume":"68","author":"K Joki","year":"2017","unstructured":"Joki, K., Bagirov, A.M., Karmitsa, N., M\u00e4kel\u00e4, M.M.: A proximal bundle method for nonsmooth DC optimization utilizing nonconvex cutting planes. J. Global Optim. 68, 501\u2013535 (2017)","journal-title":"J. Global Optim."},{"issue":"2","key":"1128_CR16","doi-asserted-by":"publisher","first-page":"1892","DOI":"10.1137\/16M1115733","volume":"28","author":"K Joki","year":"2018","unstructured":"Joki, K., Bagirov, A.M., Karmitsa, N., M\u00e4kel\u00e4, M.M., Taheri, S.: Double bundle method for finding Clarke stationary points in nonsmooth DC programming. SIAM J. Optim. 28(2), 1892\u20131919 (2018)","journal-title":"SIAM J. Optim."},{"key":"1128_CR17","first-page":"119","volume":"8","author":"KC Kiwiel","year":"1985","unstructured":"Kiwiel, K.C.: A descent method for nonsmooth convex multiobjective minimization. Large Scale Syst. 8, 119\u2013129 (1985)","journal-title":"Large Scale Syst."},{"key":"1128_CR18","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1007\/BF02191984","volume":"84","author":"KC Kiwiel","year":"1995","unstructured":"Kiwiel, K.C.: Approximations in proximal bundle methods and decomposition of convex programs. J. Optim. Theory Appl. 84, 529\u2013548 (1995)","journal-title":"J. Optim. Theory Appl."},{"key":"1128_CR19","unstructured":"Lemar\u00e9chal, C.: Bundle methods in nonsmooth optimization. In: Lemar\u00e9chal, C., Mifflin, R. (eds.) Nonsmooth optimization (Laxenburg, 1977). IIASA Proc. Ser. 3, pp 79\u2013102. Pergamon Press, Oxford (1978)"},{"key":"1128_CR20","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/s11075-018-0490-6","volume":"80","author":"J Lv","year":"2019","unstructured":"Lv, J., Pang, L., Xu, N., Xiao, Z.: An infeasible bundle method for nonconvex constrained optimization with application to semi-infinite programming problems. Numer. Algor. 80, 397\u2013427 (2019)","journal-title":"Numer. Algor."},{"key":"1128_CR21","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1007\/s11075-019-00831-6","volume":"85","author":"J Lv","year":"2020","unstructured":"Lv, J., Xiao, Z., Pang, L.: An incremental bundle method for portfolio selection problem under second-order stochastic dominance. Numer. Algor. 85, 653\u2013681 (2020)","journal-title":"Numer. Algor."},{"key":"1128_CR22","unstructured":"M\u00e4kel\u00e4, M.M., Karmitsa, N., Wilppu, O.: Multiobjective proximal bundle method for nonsmooth optimization. No. 1120. TUCS, Technical Report (2014)"},{"key":"1128_CR23","volume-title":"Nonlinear multiobjective optimization","author":"K Miettinen","year":"1999","unstructured":"Miettinen, K.: Nonlinear multiobjective optimization. Springer Science & Business Media, Berlin (1999)"},{"key":"1128_CR24","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1080\/10556789308805533","volume":"2","author":"K Miettinen","year":"1993","unstructured":"Miettinen, K., M\u00e4kel\u00e4, M.M.: An interactive method for nonsmooth multiobjective optimization with an application to optimal control. Optim. Methods Softw. 2, 31\u201344 (1993)","journal-title":"Optim. Methods Softw."},{"key":"1128_CR25","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1080\/02331934.2017.1387259","volume":"67","author":"O Montonen","year":"2018","unstructured":"Montonen, O., Karmitsa, N., M\u00e4kel\u00e4, M.M.: Multiple subgradient descent bundle method for convex nonsmooth multiobjective optimization. Optimization 67, 139\u2013158 (2018)","journal-title":"Optimization"},{"key":"1128_CR26","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1007\/s11228-010-0159-3","volume":"18","author":"D Noll","year":"2010","unstructured":"Noll, D.: Cutting plane oracles to minimize non-smooth non-convex functions. Set-valued Var. Anal. 18, 531\u2013568 (2010)","journal-title":"Set-valued Var. Anal."},{"key":"1128_CR27","doi-asserted-by":"crossref","unstructured":"Noll, D.: Bundle method for non-convex minimization with inexact subgradients and function values. In: Computational and Analytical Mathematics, pp 555\u2013592. Springer, New York (2013)","DOI":"10.1007\/978-1-4614-7621-4_26"},{"key":"1128_CR28","doi-asserted-by":"crossref","unstructured":"de Oliveira, W., Solodov, M.: Bundle methods for inexact data. In: Numerical Nonsmooth Optimization, pp 417\u2013459. Springer, Cham (2020)","DOI":"10.1007\/978-3-030-34910-3_12"},{"key":"1128_CR29","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/s10107-012-0570-7","volume":"137","author":"C Sagastiz\u00e1bal","year":"2012","unstructured":"Sagastiz\u00e1bal, C.: Divide to conquer: decomposition methods for energy optimization. Math. Program. B. 137, 187\u2013222 (2012)","journal-title":"Math. Program. B."},{"key":"1128_CR30","doi-asserted-by":"publisher","first-page":"53","DOI":"10.2514\/1.46478","volume":"8","author":"V Sch\u00fctze","year":"2011","unstructured":"Sch\u00fctze, V., Coello, C.: Computing the set of epsilon-efficient solutions in multi-objective space mission design. J. Aerosp. Comput. Inf. Commun. 8, 53\u201370 (2011)","journal-title":"J. Aerosp. Comput. Inf. Commun."},{"key":"1128_CR31","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1023\/B:JOTA.0000005046.70410.02","volume":"119","author":"MV Solodov","year":"2003","unstructured":"Solodov, M.V.: On approximations with finite precision in bundle methods for nonsmooth optimization. J. Optim. Theory Appl. 119, 151\u2013165 (2003)","journal-title":"J. Optim. Theory Appl."},{"key":"1128_CR32","doi-asserted-by":"publisher","first-page":"669","DOI":"10.1057\/jors.1990.97","volume":"41","author":"DJ White","year":"1990","unstructured":"White, D.J.: A bibliography on the applications of mathematical programming multiple objective methods. J. Oper. Res. Soc. 41, 669\u2013691 (1990)","journal-title":"J. Oper. Res. Soc."}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-021-01128-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11075-021-01128-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-021-01128-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,11]],"date-time":"2022-01-11T08:19:02Z","timestamp":1641889142000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11075-021-01128-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,5,28]]},"references-count":32,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,2]]}},"alternative-id":["1128"],"URL":"https:\/\/doi.org\/10.1007\/s11075-021-01128-3","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,5,28]]},"assertion":[{"value":"4 October 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 April 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 May 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}