{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T09:59:28Z","timestamp":1768471168893,"version":"3.49.0"},"reference-count":58,"publisher":"Springer Science and Business Media LLC","issue":"17-18","license":[{"start":{"date-parts":[[2024,7,26]],"date-time":"2024-07-26T00:00:00Z","timestamp":1721952000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,7,26]],"date-time":"2024-07-26T00:00:00Z","timestamp":1721952000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"SERB, India","award":["MTR\/2021\/000696"],"award-info":[{"award-number":["MTR\/2021\/000696"]}]},{"name":"SERB, India","award":["CRG\/2022\/001347"],"award-info":[{"award-number":["CRG\/2022\/001347"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2024,9]]},"DOI":"10.1007\/s00500-024-09806-9","type":"journal-article","created":{"date-parts":[[2024,7,26]],"date-time":"2024-07-26T21:05:15Z","timestamp":1722027915000},"page":"9609-9630","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["A nonmonotone conditional gradient method for multiobjective optimization problems"],"prefix":"10.1007","volume":"28","author":[{"given":"Ashutosh","family":"Upadhayay","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2419-7082","authenticated-orcid":false,"given":"Debdas","family":"Ghosh","sequence":"additional","affiliation":[]},{"family":"Jauny","sequence":"additional","affiliation":[]},{"given":"Jen-Chih","family":"Yao","sequence":"additional","affiliation":[]},{"given":"Xiaopeng","family":"Zhao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,7,26]]},"reference":[{"issue":"11","key":"9806_CR1","doi-asserted-by":"publisher","first-page":"2289","DOI":"10.1080\/02331934.2014.947500","volume":"64","author":"MAT Ansary","year":"2015","unstructured":"Ansary MAT, Panda G (2015) A modified quasi-Newton method for vector optimization problem. Optimization 64(11):2289\u20132306. https:\/\/doi.org\/10.1080\/02331934.2014.947500","journal-title":"Optimization"},{"issue":"3","key":"9806_CR2","doi-asserted-by":"publisher","first-page":"741","DOI":"10.1007\/s10589-020-00260-5","volume":"78","author":"PB Assun\u00e7\u00e3o","year":"2021","unstructured":"Assun\u00e7\u00e3o PB, Ferreira OP, Prudente LF (2021) Conditional gradient method for multiobjective optimization. Comput Optim Appl 78(3):741\u2013768. https:\/\/doi.org\/10.1007\/s10589-020-00260-5","journal-title":"Comput Optim Appl"},{"issue":"2","key":"9806_CR3","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1016\/j.ejor.2020.11.016","volume":"292","author":"C Audet","year":"2021","unstructured":"Audet C, Bigeon J, Cartier D, Le Digabel S, Salomon L (2021) Performance indicators in multiobjective optimization. Eur J Oper Res 292(2):397\u2013422. https:\/\/doi.org\/10.1016\/j.ejor.2020.11.016","journal-title":"Eur J Oper Res"},{"issue":"2","key":"9806_CR4","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/s001860300327","volume":"59","author":"A Beck","year":"2004","unstructured":"Beck A, Teboulle M (2004) A conditional gradient method with linear rate of convergence for solving convex linear systems. Math Methods Oper Res 59(2):235\u2013247. https:\/\/doi.org\/10.1007\/s001860300327","journal-title":"Math Methods Oper Res"},{"issue":"1","key":"9806_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1002\/9781118341704","volume":"16","author":"V Bhaskar","year":"2000","unstructured":"Bhaskar V, Gupta SK, Ray AK (2000) Applications of multiobjective optimization in chemical engineering. Rev Chem Eng 16(1):1\u201354. https:\/\/doi.org\/10.1002\/9781118341704","journal-title":"Rev Chem Eng"},{"issue":"4","key":"9806_CR6","doi-asserted-by":"publisher","first-page":"953","DOI":"10.1137\/S1052623403429093","volume":"15","author":"H Bonnel","year":"2005","unstructured":"Bonnel H, Iusem AN, Svaiter BF (2005) Proximal methods in vector optimization. SIAM J Optim 15(4):953\u2013970. https:\/\/doi.org\/10.1137\/S1052623403429093","journal-title":"SIAM J Optim"},{"key":"9806_CR7","doi-asserted-by":"publisher","first-page":"857","DOI":"10.1007\/s10589-023-00478-z","volume":"85","author":"W Chen","year":"2023","unstructured":"Chen W, Zhao Yang XY (2023) Conditional gradient method for vector optimization. Comput Optim Appl 85:857\u2013896. https:\/\/doi.org\/10.1007\/s10589-023-00478-z","journal-title":"Comput Optim Appl"},{"key":"9806_CR8","doi-asserted-by":"publisher","first-page":"3137","DOI":"10.1007\/s00500-017-2965-0","volume":"23","author":"T Chugh","year":"2019","unstructured":"Chugh T, Sindhya K, Hakanen J et al (2019) A survey on handling computationally expensive multiobjective optimization problems with evolutionary algorithms. Soft Comput 23:3137\u20133166. https:\/\/doi.org\/10.1007\/s00500-017-2965-0","journal-title":"Soft Comput"},{"issue":"16","key":"9806_CR9","doi-asserted-by":"publisher","first-page":"5268","DOI":"10.1016\/j.na.2011.04.067","volume":"74","author":"JB Cruz","year":"2011","unstructured":"Cruz JB, P\u00e9rez LL, Melo JG (2011) Convergence of the projected gradient method for quasiconvex multiobjective optimization. Nonlinear Anal 74(16):5268\u20135273. https:\/\/doi.org\/10.1016\/j.na.2011.04.067","journal-title":"Nonlinear Anal"},{"issue":"3","key":"9806_CR10","first-page":"311","volume":"21","author":"YH Dai","year":"2003","unstructured":"Dai YH, Ni Q (2003) Testing different conjugate gradient methods for large-scale unconstrained optimization. J Comput Math 21(3):311\u2013320","journal-title":"J Comput Math"},{"issue":"3","key":"9806_CR11","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1137\/S1052623496307510","volume":"8","author":"I Das","year":"1998","unstructured":"Das I, Dennis JE (1998) Normal-boundary intersection: a new method for generating the Pareto surface in nonlinear multicriteria optimization problems. SIAM J Optim 8(3):631\u2013657. https:\/\/doi.org\/10.1137\/S1052623496307510","journal-title":"SIAM J Optim"},{"issue":"2","key":"9806_CR12","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"ED Dolan","year":"2002","unstructured":"Dolan ED, Mor\u00e9 JJ (2002) Benchmarking optimization software with performance profiles. Math Prog 91(2):201\u2013213. https:\/\/doi.org\/10.1007\/s101070100263","journal-title":"Math Prog"},{"issue":"1","key":"9806_CR13","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/B:COAP.0000018877.86161.8b","volume":"28","author":"LMG Drummond","year":"2004","unstructured":"Drummond LMG, Iusem AN (2004) A projected gradient method for vector optimization problems. Comput Optim Appl 28(1):5\u201329. https:\/\/doi.org\/10.1023\/B:COAP.0000018877.86161.8b","journal-title":"Comput Optim Appl"},{"issue":"2","key":"9806_CR14","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1016\/j.cam.2004.06.018","volume":"175","author":"LMG Drummond","year":"2005","unstructured":"Drummond LMG, Svaiter BF (2005) A steepest descent method for vector optimization. J Comput Appl Math 175(2):395\u2013414. https:\/\/doi.org\/10.1016\/j.cam.2004.06.018","journal-title":"J Comput Appl Math"},{"issue":"6","key":"9806_CR15","doi-asserted-by":"publisher","first-page":"1365","DOI":"10.1007\/s11590-018-1353-8","volume":"13","author":"NS Fazzio","year":"2019","unstructured":"Fazzio NS, Schuverdt ML (2019) Convergence analysis of a nonmonotone projected gradient method for multiobjective optimization problems. Optim Lett 13(6):1365\u20131379. https:\/\/doi.org\/10.1007\/s11590-018-1353-8","journal-title":"Optim Lett"},{"issue":"11","key":"9806_CR16","doi-asserted-by":"publisher","first-page":"1442","DOI":"10.1287\/mnsc.20.11.1442","volume":"20","author":"PC Fishburn","year":"1974","unstructured":"Fishburn PC (1974) Exceptional paper-lexicographic orders, utilities and decision rules: A survey. Manag Sci 20(11):1442\u20131471. https:\/\/doi.org\/10.1287\/mnsc.20.11.1442","journal-title":"Manag Sci"},{"issue":"3","key":"9806_CR17","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1007\/s001860000043","volume":"51","author":"J Fliege","year":"2000","unstructured":"Fliege J, Svaiter BF (2000) Steepest descent methods for multicriteria optimization. Math Method Oper Res 51(3):479\u2013494. https:\/\/doi.org\/10.1007\/s001860000043","journal-title":"Math Method Oper Res"},{"issue":"2","key":"9806_CR18","doi-asserted-by":"publisher","first-page":"602","DOI":"10.1137\/08071692X","volume":"20","author":"J Fleige","year":"2009","unstructured":"Fleige J, Drummond LMG, Svaiter BF (2009) Newton\u2019s method for multiobjective optimization. SIAM J Optim 20(2):602\u2013626. https:\/\/doi.org\/10.1137\/08071692X","journal-title":"SIAM J Optim"},{"issue":"1\u20132","key":"9806_CR19","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1002\/nav.3800030109","volume":"3","author":"M Frank","year":"1956","unstructured":"Frank M, Wolfe P (1956) An algorithm for quadratic programming. Naval Res Logist Q 3(1\u20132):95\u2013110. https:\/\/doi.org\/10.1002\/nav.3800030109","journal-title":"Naval Res Logist Q"},{"issue":"3","key":"9806_CR20","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1007\/s10589-012-9501-z","volume":"54","author":"EH Fukuda","year":"2013","unstructured":"Fukuda EH, Drummond LMG (2013) Inexact projected gradient method for vector optimization. Comput Optim Appl 54(3):473\u2013493. https:\/\/doi.org\/10.1007\/s10589-012-9501-z","journal-title":"Comput Optim Appl"},{"issue":"3","key":"9806_CR21","doi-asserted-by":"publisher","first-page":"618","DOI":"10.1016\/0022-247X(68)90201-1","volume":"22","author":"AM Geoffrion","year":"1968","unstructured":"Geoffrion AM (1968) Proper efficiency and the theory of vector maximization. J Math Anal Appl 22(3):618\u2013630. https:\/\/doi.org\/10.1016\/0022-247X(68)90201-1","journal-title":"J Math Anal Appl"},{"issue":"8","key":"9806_CR22","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1016\/j.orl.2014.08.011","volume":"42","author":"D Ghosh","year":"2014","unstructured":"Ghosh D, Chakraborty D (2014) A new Pareto set generating method for multi-criteria optimization problems. Oper Res Lett 42(8):514\u2013521. https:\/\/doi.org\/10.1016\/j.orl.2014.08.011","journal-title":"Oper Res Lett"},{"issue":"2","key":"9806_CR23","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1007\/s12597-014-0178-1","volume":"52","author":"D Ghosh","year":"2015","unstructured":"Ghosh D, Chakraborty D (2015) A direction based classical method to obtain complete Pareto set of multi-criteria optimization problems. Opsearch 52(2):340\u2013366. https:\/\/doi.org\/10.1007\/s12597-014-0178-1","journal-title":"Opsearch"},{"issue":"3","key":"9806_CR24","doi-asserted-by":"publisher","first-page":"889","DOI":"10.1007\/s10589-019-00146-1","volume":"76","author":"MLN Goncalves","year":"2020","unstructured":"Goncalves MLN, Prudente LF (2020) On the extension of the Hager-Zhang conjugate gradient method for vector optimization. Comput Optim Appl 76(3):889\u2013916. https:\/\/doi.org\/10.1007\/s10589-019-00146-1","journal-title":"Comput Optim Appl"},{"key":"9806_CR25","first-page":"83","volume-title":"Mathematical programming: recent developments and applications","author":"A Griewank","year":"1989","unstructured":"Griewank A (1989) On automatic differentiation. In: Iri M, Tanabe K (eds) Mathematical programming: recent developments and applications. Kluwer, Dordrecht, pp 83\u2013108"},{"issue":"4","key":"9806_CR26","doi-asserted-by":"publisher","first-page":"707","DOI":"10.1137\/0723046","volume":"23","author":"L Grippo","year":"1986","unstructured":"Grippo L, Lampariello F, Lucidi S (1986) A nonmonotone line search technique for Newton\u2019s method. SIAM J Numer Anal 23(4):707\u2013716. https:\/\/doi.org\/10.1137\/0723046","journal-title":"SIAM J Numer Anal"},{"issue":"3","key":"9806_CR27","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1023\/A:1017536311488","volume":"110","author":"C Hillermeier","year":"2001","unstructured":"Hillermeier C (2001) Generalized homotopy approach to multiobjective optimization. J Optim Theory Appl 110(3):557\u2013583. https:\/\/doi.org\/10.1023\/A:1017536311488","journal-title":"J Optim Theory Appl"},{"issue":"5","key":"9806_CR28","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1109\/TEVC.2005.861417","volume":"10","author":"S Huband","year":"2006","unstructured":"Huband S, Hingston P, Barone L, While L (2006) A review of multiobjective test problems and a scalable test problem toolkit. IEEE Trans Evol Comput 10(5):477\u2013506. https:\/\/doi.org\/10.1109\/TEVC.2005.861417","journal-title":"IEEE Trans Evol Comput"},{"key":"9806_CR29","unstructured":"Jaggi M (2013) Revisiting Frank-Wolfe: projection-free sparse convex optimization. In: Dasgupta S, McAllester D (eds) Proceedings of the 30th International Conference on Machine Learning (ICML), vol 28, no 1, pp 427\u2013435. https:\/\/dl.acm.org\/doi\/10.5555\/3042817.3042867"},{"key":"9806_CR30","doi-asserted-by":"publisher","unstructured":"Jauny, Ghosh D, Ansari QH, Ehrgott M, Upadhayay A (2023) An infeasible interior-point technique to generate the nondominated set for multiobjective optimization problems. Comput Oper Res 155:106236. https:\/\/doi.org\/10.1016\/j.cor.2023.106236","DOI":"10.1016\/j.cor.2023.106236"},{"key":"9806_CR31","doi-asserted-by":"publisher","unstructured":"Jauny, Ghosh D, Upadhayay A (2022) A Newton-type globally convergent interior-point method to solve multi-objective optimization problems. J Comput Math. https:\/\/doi.org\/10.4208\/jcm.2204-m2021-0241","DOI":"10.4208\/jcm.2204-m2021-0241"},{"key":"9806_CR32","doi-asserted-by":"crossref","unstructured":"Jauny, Ghosh D, Upadhayay A, Ansari QH (2022a) A trust-region interior-point technique to solve multi-objective optimization problems and its application to a tuberculosis optimal control problem. J Nonlinear Var Anal 6(6):675\u2013691https:\/\/doi.org\/10.23952\/jnva.6.2022.6.06","DOI":"10.23952\/jnva.6.2022.6.06"},{"key":"9806_CR33","unstructured":"Jauny, Ghosh D, Upadhayay A, Ansari QH (2022b) A primal-dual interior-point technique to solve multi-objective optimization problems with an application to optimal control problem. J Nonlinear Convex Anal 23(11):2629\u20132647"},{"key":"9806_CR34","doi-asserted-by":"publisher","unstructured":"Jiang S, Cai Z, Zhang J, Ong YS (2011) Multiobjective optimization by decomposition with Pareto-adaptive weight vectors. In: 2011 seventh international conference on natural computation, vol 3. IEEE, pp 1260\u20131264. https:\/\/doi.org\/10.1109\/ICNC.2011.6022367","DOI":"10.1109\/ICNC.2011.6022367"},{"key":"9806_CR35","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1016\/j.cam.2013.11.007","volume":"261","author":"E Khorram","year":"2014","unstructured":"Khorram E, Khaledian K, Khaledyan M (2014) A numerical method for constructing the Pareto front for multi-objective optimization problems. J Comput Appl Math 261:158\u2013171. https:\/\/doi.org\/10.1016\/j.cam.2013.11.007","journal-title":"J Comput Appl Math"},{"issue":"2","key":"9806_CR36","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/s00158-004-0465-1","volume":"29","author":"IY Kim","year":"2005","unstructured":"Kim IY, De Weck OL (2005) Adaptive weighted-sum method for bi-objective optimization: pareto front generation. Struct Multidiscipl Optim 29(2):149\u2013158. https:\/\/doi.org\/10.1007\/s00158-004-0465-1","journal-title":"Struct Multidiscipl Optim"},{"issue":"12","key":"9806_CR37","doi-asserted-by":"publisher","first-page":"2275","DOI":"10.1080\/02331934.2018.1530235","volume":"67","author":"IV Konnov","year":"2018","unstructured":"Konnov IV (2018) Simplified versions of the conditional gradient method. Optimization 67(12):2275\u20132290. https:\/\/doi.org\/10.1080\/02331934.2018.1530235","journal-title":"Optimization"},{"issue":"2","key":"9806_CR38","doi-asserted-by":"publisher","first-page":"1379","DOI":"10.1137\/140992382","volume":"26","author":"G Lan","year":"2016","unstructured":"Lan G, Zhou Y (2016) Conditional gradient sliding for convex optimization. SIAM J Optim 26(2):1379\u20131409. https:\/\/doi.org\/10.1137\/140992382","journal-title":"SIAM J Optim"},{"issue":"3","key":"9806_CR39","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1162\/106365602760234108","volume":"10","author":"M Laumanns","year":"2022","unstructured":"Laumanns M, Thiele L, Deb K, Zitzler E (2022) Combining convergence and diversity in evolutionary multiobjective optimization. Evol Comput 10(3):263\u2013282. https:\/\/doi.org\/10.1162\/106365602760234108","journal-title":"Evol Comput"},{"issue":"5","key":"9806_CR40","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0041-5553(66)90114-5","volume":"6","author":"E Levitin","year":"1966","unstructured":"Levitin E, Polyak B (1966) Constrained minimization methods. USSR Comput Math Math Phys 6(5):1\u201350. https:\/\/doi.org\/10.1016\/0041-5553(66)90114-5","journal-title":"USSR Comput Math Math Phys"},{"issue":"3","key":"9806_CR41","doi-asserted-by":"publisher","first-page":"2690","DOI":"10.1137\/17M1126588","volume":"28","author":"LR Lucambio P\u00e9rez","year":"2018","unstructured":"Lucambio P\u00e9rez LR, Prudente LF (2018) Nonlinear conjugate gradient methods for vector optimization. SIAM J Optim 28(3):2690\u20132720. https:\/\/doi.org\/10.1137\/17M1126588","journal-title":"SIAM J Optim"},{"issue":"1","key":"9806_CR42","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1137\/110839072","volume":"55","author":"R Luss","year":"2013","unstructured":"Luss R, Teboulle M (2013) Conditional gradient algorithms for rank-one matrix approximations with a sparsity constraint. SIAM Rev 55(1):65\u201398. https:\/\/doi.org\/10.1137\/110839072","journal-title":"SIAM Rev"},{"issue":"6","key":"9806_CR43","doi-asserted-by":"publisher","first-page":"1223","DOI":"10.1080\/10556788.2020.1737691","volume":"35","author":"N Mahdavi-Amiri","year":"2020","unstructured":"Mahdavi-Amiri N, Salehi Sadaghiani F (2020) A superlinearly convergent nonmonotone quasi-Newton method for unconstrained multiobjective optimization. Optim Methods Softw 35(6):1223\u20131247. https:\/\/doi.org\/10.1080\/10556788.2020.1737691","journal-title":"Optim Methods Softw"},{"issue":"3","key":"9806_CR44","doi-asserted-by":"publisher","first-page":"662","DOI":"10.1016\/j.ejor.2007.05.015","volume":"188","author":"E Miglierina","year":"2008","unstructured":"Miglierina E, Molho E, Recchioni M (2008) Box-constrained multi-objective optimization: a gradient-like method without a priori scalarization. Eur J Oper Res 188(3):662\u2013682. https:\/\/doi.org\/10.1016\/j.ejor.2007.05.015","journal-title":"Eur J Oper Res"},{"issue":"1","key":"9806_CR45","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/s10898-019-00802-0","volume":"75","author":"K Mita","year":"2019","unstructured":"Mita K, Fukuda EH, Yamashita N (2019) Nonmonotone line searches for unconstrained multiobjective optimization problems. J Global Optim 75(1):63\u201390. https:\/\/doi.org\/10.1007\/s10898-019-00802-0","journal-title":"J Global Optim"},{"key":"9806_CR46","doi-asserted-by":"publisher","first-page":"765","DOI":"10.1016\/j.cam.2013.06.045","volume":"255","author":"\u017d Povalej","year":"2014","unstructured":"Povalej \u017d (2014) Quasi-Newton\u2019s method for multiobjective optimization. J Comput Appl Math 255:765\u2013777. https:\/\/doi.org\/10.1016\/j.cam.2013.06.045","journal-title":"J Comput Appl Math"},{"key":"9806_CR47","doi-asserted-by":"publisher","unstructured":"Preuss M, Naujoks B, Rudolph G (2006) Pareto set and EMOA behavior for simple multimodal multiobjective functions. In: Runarsson TP, Beyer H-G, Burke E, Merelo-Guerv\u00f3s JJ, Whitley LD, Yao X (eds) Proceedings of the ninth international conference on parallel problem solving from nature (PPSN IX). Lecture notes in computer science. Springer, Berlin, vol 4193, pp 513\u2013522. https:\/\/doi.org\/10.1007\/11844297_52","DOI":"10.1007\/11844297_52"},{"key":"9806_CR48","doi-asserted-by":"publisher","unstructured":"Qu S, Ji Y, Jiang J, Zhang Q (2017) Nonmonotone gradient methods for vector optimization with a portfolio optimization application. Eur J Oper Res 263(2):356\u2013366. https:\/\/doi.org\/10.1016\/j.ejor.2017.05.027","DOI":"10.1016\/j.ejor.2017.05.027"},{"issue":"4","key":"9806_CR49","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1007\/s10898-007-9265-7","volume":"41","author":"O Sch\u00fctze","year":"2008","unstructured":"Sch\u00fctze O, Laumanns M, Coello Coello CA, Dellnitz M, Talbi EG (2008) Convergence of stochastic search algorithms to finite size Pareto set approximations. J Glob Optim 41(4):559\u2013577. https:\/\/doi.org\/10.1007\/s10898-007-9265-7","journal-title":"J Glob Optim"},{"key":"9806_CR50","doi-asserted-by":"publisher","unstructured":"Sierra MR, Coello Coello AC (2005) Improving PSO-based multi-objective optimization using crowding, mutation and $$\\epsilon $$-dominance. In: Coello Coello CA, Aguirre AH, Zitzler E (eds) International conference on evolutionary multi-criteria optimization. Lecture notes in computer science, vol 3410. Springer, Berlin, pp 505\u2013519. https:\/\/doi.org\/10.1007\/978-3-540-31880-4_35","DOI":"10.1007\/978-3-540-31880-4_35"},{"key":"9806_CR51","doi-asserted-by":"crossref","unstructured":"Upadhayay A, Ghosh D, Jauny, Kishor N (2023) Cone method for uncertain multiobjective optimization problems with minmax robustness. In: Combinatorial optimization under uncertainty. CRC Press, Boca Raton, pp 141\u2013152","DOI":"10.1201\/9781003329039-8"},{"key":"9806_CR52","doi-asserted-by":"publisher","unstructured":"Upadhayay A, Ghosh D, Ansari QH, Jauny (2022) Augmented Lagrangian cone method for multiobjective optimization problems with an application to an optimal control problem. Optim Eng. https:\/\/doi.org\/10.1007\/s11081-022-09747-y","DOI":"10.1007\/s11081-022-09747-y"},{"issue":"2","key":"9806_CR53","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1080\/00207729608929211","volume":"27","author":"R Viennet","year":"1996","unstructured":"Viennet R, Fonteix C, Marc I (1996) Multicriteria Optimization Using Genetic Algorithm for Determining the Pareto Set. Int J Syst Sci 27(2):255\u2013260. https:\/\/doi.org\/10.1080\/00207729608929211","journal-title":"Int J Syst Sci"},{"issue":"3","key":"9806_CR54","doi-asserted-by":"publisher","first-page":"2388","DOI":"10.1137\/18M1191737","volume":"29","author":"J Wang","year":"2019","unstructured":"Wang J, Hu Y, Yu CKW, Li C, Yang X (2019) Extended Newton methods for multiobjective optimization: majorizing function technique and convergence analysis. SIAM J Optim 29(3):2388\u20132421. https:\/\/doi.org\/10.1137\/18M1191737","journal-title":"SIAM J Optim"},{"key":"9806_CR55","doi-asserted-by":"publisher","first-page":"2265","DOI":"10.1007\/s00500-014-1406-6","volume":"19","author":"B Xu","year":"2015","unstructured":"Xu B, Peng Z, Xiao F et al (2015) Dynamic deployment of virtual machines in cloud computing using multi-objective optimization. Soft Comput 19:2265\u20132273. https:\/\/doi.org\/10.1007\/s00500-014-1406-6","journal-title":"Soft Comput"},{"key":"9806_CR56","doi-asserted-by":"publisher","unstructured":"Yuan G, Lu X (2009) A modified PRP conjugate gradient method. Ann Oper Res 166(1):73\u201390. https:\/\/doi.org\/10.1007\/s10479-008-0420-4","DOI":"10.1007\/s10479-008-0420-4"},{"issue":"4","key":"9806_CR57","doi-asserted-by":"publisher","first-page":"1043","DOI":"10.1137\/S1052623403428208","volume":"14","author":"H Zhang","year":"2004","unstructured":"Zhang H, Hager WW (2004) A nonmonotone line search technique and its application to unconstrained optimization. SIAM J Optim 14(4):1043\u20131056. https:\/\/doi.org\/10.1137\/S1052623403428208","journal-title":"SIAM J Optim"},{"key":"9806_CR58","doi-asserted-by":"publisher","unstructured":"Zou W, Zhu Y, Chen H, Zhang B (2011) Solving multiobjective optimization problems using artificial bee colony algorithm. Discrete Dyn Nat Soc 2011:569784. https:\/\/doi.org\/10.1155\/2011\/569784","DOI":"10.1155\/2011\/569784"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-024-09806-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00500-024-09806-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-024-09806-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,17]],"date-time":"2024-10-17T19:21:56Z","timestamp":1729192916000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00500-024-09806-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,26]]},"references-count":58,"journal-issue":{"issue":"17-18","published-print":{"date-parts":[[2024,9]]}},"alternative-id":["9806"],"URL":"https:\/\/doi.org\/10.1007\/s00500-024-09806-9","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,7,26]]},"assertion":[{"value":"7 March 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 July 2024","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no conflict of interest to declare with respect to this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This article does not contain any studies with human participants performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}]}}