{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,28]],"date-time":"2026-01-28T06:43:41Z","timestamp":1769582621806,"version":"3.49.0"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2020,10,12]],"date-time":"2020-10-12T00:00:00Z","timestamp":1602460800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,10,12]],"date-time":"2020-10-12T00:00:00Z","timestamp":1602460800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"name":"The first named author was supported by a Grant from the University of Isfahan."},{"name":"The second-named author was partially supported by a Grant from IPM","award":["99900416)."],"award-info":[{"award-number":["99900416)."]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2022,4]]},"DOI":"10.1007\/s10479-020-03808-0","type":"journal-article","created":{"date-parts":[[2020,10,12]],"date-time":"2020-10-12T05:02:26Z","timestamp":1602478946000},"page":"1123-1154","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["An inexact multiple proximal bundle algorithm for nonsmooth nonconvex multiobjective optimization problems"],"prefix":"10.1007","volume":"311","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1431-0520","authenticated-orcid":false,"given":"N.","family":"Hoseini Monjezi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2488-7892","authenticated-orcid":false,"given":"S.","family":"Nobakhtian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,10,12]]},"reference":[{"issue":"4","key":"3808_CR1","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. (2005). Proximal methods in vector optimization. SIAM Journal on Optimization, 15(4), 953\u2013970.","journal-title":"SIAM Journal on Optimization"},{"issue":"3","key":"3808_CR2","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1007\/s10589-012-9494-7","volume":"54","author":"JX Da Cruz Neto","year":"2013","unstructured":"Da Cruz Neto, J. X., Da Silva, G. J. P., Ferreira, O. P., & Lopes, J. O. (2013). A subgradient method for multiobjective optimization. Computational Optimization and Applications, 54(3), 461\u2013472.","journal-title":"Computational Optimization and Applications"},{"issue":"5\u20136","key":"3808_CR3","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1016\/j.crma.2012.03.014","volume":"350","author":"J-A D\u00e9sid\u00e9ri","year":"2012","unstructured":"D\u00e9sid\u00e9ri, J.-A. (2012). Multiple-gradient descent algorithm (MGDA) for multiobjective optimization. Comptes Rendus Mathematique, 350(5\u20136), 313\u2013318.","journal-title":"Comptes Rendus Mathematique"},{"key":"3808_CR4","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1007\/s10479-017-2751-5","volume":"271","author":"EK Doolittle","year":"2018","unstructured":"Doolittle, E. K., Kerivin, H. L. M., & Wiecek, M. M. (2018). Robust multiobjective optimization with application to Internet routing. Annals of Operations Research, 271, 487\u2013525.","journal-title":"Annals of Operations Research"},{"key":"3808_CR5","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/s10589-009-9288-8","volume":"46","author":"G Emiel","year":"2010","unstructured":"Emiel, G., & Sagastiz\u00e1bal, C. (2010). Incremental-like bundle methods with application to energy planning. Computational Optimization and Applications, 46, 305\u2013332.","journal-title":"Computational Optimization and Applications"},{"issue":"2","key":"3808_CR6","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. (2006). Approximate convexity in vector optimisation. Bulletin of the Australian Mathematical Society., 74(2), 207\u2013218.","journal-title":"Bulletin of the Australian Mathematical Society."},{"key":"3808_CR7","doi-asserted-by":"publisher","first-page":"673","DOI":"10.1080\/10556780410001689225","volume":"19","author":"M Haarala","year":"2004","unstructured":"Haarala, M., Miettinen, K., & M\u00e4kel\u00e4, M. M. (2004). New limited memory bundle method for large-scale nonsmooth optimization. Optimization Methods and Software, 19, 673\u2013692.","journal-title":"Optimization Methods and Software"},{"key":"3808_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. (2010). A redistributed proximal bundle method for nonconvex optimization. SIAM Journal on Optimization, 20, 2442\u20132473.","journal-title":"SIAM Journal on Optimization"},{"key":"3808_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. (2016). A proximal bundle method for nonsmooth nonconvex functions with inexact information. Computational Optimization and Applications, 63, 1\u201328.","journal-title":"Computational Optimization and Applications"},{"key":"3808_CR10","first-page":"57","volume":"60","author":"J-B Hiriart-Urruty","year":"1979","unstructured":"Hiriart-Urruty, J.-B. (1979). New concepts in nondifferentiable programming. Bulletin de la Societe Mathematique de France is a mathematics, 60, 57\u201385.","journal-title":"Bulletin de la Societe Mathematique de France is a mathematics"},{"key":"3808_CR11","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1023\/A:1011259017643","volume":"20","author":"M Hinterm\u00fcller","year":"2001","unstructured":"Hinterm\u00fcller, M. (2001). A proximal bundle method based on approximate subgradients. Computational Optimization and Applications, 20, 245\u2013266.","journal-title":"Computational Optimization and Applications"},{"key":"3808_CR12","doi-asserted-by":"publisher","unstructured":"Hoseini Monjezi, N., & Nobakhtian, S. (2020). A filter proximal bundle method for nonsmooth nonconvex constrained optimization. Journal of Global Optimization. https:\/\/doi.org\/10.1007\/s10898-020-00939-3.","DOI":"10.1007\/s10898-020-00939-3"},{"issue":"2","key":"3808_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. (2019). A new infeasible proximal bundle algorithm for nonsmooth nonconvex constrained optimization. Computational Optimization and Applications, 74(2), 443\u2013480.","journal-title":"Computational Optimization and Applications"},{"key":"3808_CR14","doi-asserted-by":"crossref","unstructured":"Jiao, L., & Lee, J. H. (2019). Finding efficient solutions in robust multiple objective optimization with SOS-convex polynomial data. Annals of Oeprations Research, 1\u201318.","DOI":"10.1007\/s10479-019-03216-z"},{"key":"3808_CR15","doi-asserted-by":"crossref","unstructured":"Jin, Y. (ed.) (2006). Multi-objective machine learning. Studies in computational intelligence (Vol. 16). Berlin: Springer.","DOI":"10.1007\/3-540-33019-4"},{"key":"3808_CR16","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0074500","volume-title":"Methods of descent for nondifferentiable optimization","author":"KC Kiwiel","year":"1985","unstructured":"Kiwiel, K. C. (1985). Methods of descent for nondifferentiable optimization. Berlin: Springer."},{"issue":"2","key":"3808_CR17","first-page":"119","volume":"8","author":"KC Kiwiel","year":"1985","unstructured":"Kiwiel, K. C. (1985). A descent method for nonsmooth convex multiobjective minimization. Large Scale System, 8(2), 119\u2013129.","journal-title":"Large Scale System"},{"key":"3808_CR18","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1007\/BF02191984","volume":"84","author":"KC Kiwiel","year":"1995","unstructured":"Kiwiel, K. C. (1995). Approximations in proximal bundle methods and decomposition of convex programs. Journal of Optimization Theory and Applications, 84, 529\u2013548.","journal-title":"Journal of Optimization Theory and Applications"},{"key":"3808_CR19","unstructured":"Lemar\u00e9chal, C. (1978). Bundle methods in nonsmooth optimization. In Nonsmooth Optimization (Laxenburg, 1977), C. Lemar\u00e9chal, R. Mifflin (eds.), IIASA Proc. Ser. 3, Pergamon Press, Oxford, 79\u2013102"},{"key":"3808_CR20","doi-asserted-by":"crossref","unstructured":"Lemar\u00e9chal, C. (2001). Lagrangian relaxation. In Computational combinatorial optimization, Lecture notes in computer science, 2241, Springer, Berlin, pp. 112\u2013156.","DOI":"10.1007\/3-540-45586-8_4"},{"key":"3808_CR21","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/s10479-010-0801-3","volume":"186","author":"S Liao","year":"2011","unstructured":"Liao, S., Hsieh, C., & Lin, Y. (2011). A multi-objective evolutionary optimization approach for an integrated location-inventory distribution network problem under vendor-managed inventory systems. Annals of Operations Research, 186, 213\u2013229.","journal-title":"Annals of Operations Research"},{"key":"3808_CR22","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1007\/s10898-017-0565-2","volume":"70","author":"J Lv","year":"2017","unstructured":"Lv, J., Pang, L. P., & Meng, F. Y. (2017). A proximal bundle method for constrained nonsmooth nonconvex optimization with inexact information. Journal of Global Optimization, 70, 517\u2013549.","journal-title":"Journal of Global Optimization"},{"key":"3808_CR23","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/978-1-4939-0808-0_17","volume-title":"Optimization in science and engineering","author":"MM M\u00e4kel\u00e4","year":"2014","unstructured":"M\u00e4kel\u00e4, M. M., Eronen, V.-P., & Karmitsa, N. (2014). On nonsmooth multiobjective optimality conditions with generalized convexities. In T. M. Rassias, C. A. Floudas, & S. Butenko (Eds.), Optimization in science and engineering (pp. 333\u2013357). New York, NY: Springer."},{"key":"3808_CR24","unstructured":"M\u00e4kel\u00e4, M. M., Karmitsa, N., & Wilppu, O. (2014). Multiobjective proximal bundle method for nonsmooth optimization. No. 1120. TUCS, Technical Report."},{"key":"3808_CR25","doi-asserted-by":"publisher","DOI":"10.1142\/1493","volume-title":"Nonsmooth optimization: analysis and algorithms with applications to optimal control","author":"MM M\u00e4kel\u00e4","year":"1992","unstructured":"M\u00e4kel\u00e4, M. M., & Neittaanm\u00e4ki, P. (1992). Nonsmooth optimization: analysis and algorithms with applications to optimal control. Singapore: World Scientific."},{"key":"3808_CR26","volume-title":"Nonlinear multiobjective optimization","author":"K Miettinen","year":"1999","unstructured":"Miettinen, K. (1999). Nonlinear multiobjective optimization. Berlin: Springer."},{"issue":"1","key":"3808_CR27","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. (2018). Multiple subgradient descent bundle method for convex nonsmooth multiobjective optimization. Optimization, 67(1), 139\u2013158.","journal-title":"Optimization"},{"key":"3808_CR28","unstructured":"Moreau, J. J., Panagiotopoulos, P. D., & Strang, G. (Eds.). (1988). Topics in nonsmooth mechanics. Basel: Birkh\u00e4user."},{"key":"3808_CR29","doi-asserted-by":"crossref","unstructured":"Noll, D. (2013). Bundle method for non-convex minimization with inexact subgradients and function values. In Computational and analytical mathematics, vol. 50, pp. 555\u2013592. Springer Proceedings in Mathematics.","DOI":"10.1007\/978-1-4614-7621-4_26"},{"key":"3808_CR30","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1007\/s11228-010-0159-3","volume":"18","author":"D Noll","year":"2010","unstructured":"Noll, D. (2010). Cutting plane oracles to minimize non-smooth non-convex functions. Set-Valued and Variational Analysis, 18, 531\u2013568.","journal-title":"Set-Valued and Variational Analysis"},{"issue":"6","key":"3808_CR31","doi-asserted-by":"publisher","first-page":"1180","DOI":"10.1080\/10556788.2013.871282","volume":"29","author":"W de Oliveira","year":"2014","unstructured":"de Oliveira, W., & Sagastiz\u00e1bal, C. (2014). Level bundle methods for oracles with on demand accuracy. Optimization Methods and Software, 29(6), 1180\u20131209.","journal-title":"Optimization Methods and Software"},{"key":"3808_CR32","doi-asserted-by":"crossref","unstructured":"Outrata, J., Koc\u0303vara, M., & Zowe, J. (1998). Nonsmooth approach to optimization problems with equilibrium constraints. Theory, Applications and Numerical Results, Kluwer, Dordrecht.","DOI":"10.1007\/978-1-4757-2825-5"},{"key":"3808_CR33","doi-asserted-by":"crossref","unstructured":"Ruszczy\u0144ski, A. (2003). Decomposition Methods. Handbooks in operations research and management science (Vol. 10). Amsterdam: Elsevier.","DOI":"10.1016\/S0927-0507(03)10003-5"},{"issue":"1","key":"3808_CR34","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/s10107-012-0570-7","volume":"134","author":"C Sagastiz\u00e1bal","year":"2012","unstructured":"Sagastiz\u00e1bal, C. (2012). Divide to conquer: decomposition methods for energy optimization. Mathematical Programming B, 134(1), 187\u2013222.","journal-title":"Mathematical Programming B"},{"key":"3808_CR35","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. (2003). On approximations with finite precision in bundle methods for nonsmooth optimization. Journal of Optimization Theory and Applications, 119, 151\u2013165.","journal-title":"Journal of Optimization Theory and Applications"},{"issue":"3","key":"3808_CR36","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1016\/j.ejor.2014.01.022","volume":"235","author":"S Qu","year":"2014","unstructured":"Qu, S., Liu, C., Goh, M., Li, Y., & Ji, Y. (2014). Nonsmooth multiobjective programming with quasi-Newton methods. European Journal of Operational Research, 235(3), 503\u2013510.","journal-title":"European Journal of Operational Research"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-020-03808-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10479-020-03808-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-020-03808-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,11]],"date-time":"2022-05-11T16:20:15Z","timestamp":1652286015000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10479-020-03808-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,10,12]]},"references-count":36,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,4]]}},"alternative-id":["3808"],"URL":"https:\/\/doi.org\/10.1007\/s10479-020-03808-0","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,10,12]]},"assertion":[{"value":"21 September 2020","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 October 2020","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}