{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T20:20:34Z","timestamp":1760473234934,"version":"3.37.3"},"reference-count":43,"publisher":"EDP Sciences","issue":"4","license":[{"start":{"date-parts":[[2024,7,2]],"date-time":"2024-07-02T00:00:00Z","timestamp":1719878400000},"content-version":"vor","delay-in-days":1,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Oper. Res."],"accepted":{"date-parts":[[2024,1,30]]},"published-print":{"date-parts":[[2024,7]]},"abstract":"<jats:p>In order to increase the probability of applying more recent information, a forgetting factor is embedded in the nonmonotone line search technique for minimization of the multiobjective problem concerning the partial order induced by a closed, convex, and pointed cone. The method is shown to be globally convergent without convexity assumption on the objective function. Moreover, to improve behavior of the classical steepest descent method, an accelerated scheme is presented. Ultimately, computational advantages of the algorithms are depicted on a class of standard test problems.<\/jats:p>","DOI":"10.1051\/ro\/2024030","type":"journal-article","created":{"date-parts":[[2024,2,1]],"date-time":"2024-02-01T09:05:54Z","timestamp":1706778354000},"page":"2783-2795","source":"Crossref","is-referenced-by-count":2,"title":["Accelerated nonmonotone line search technique for multiobjective optimization"],"prefix":"10.1051","volume":"58","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8828-0227","authenticated-orcid":false,"given":"Zohre","family":"Aminifard","sequence":"first","affiliation":[]},{"given":"Saman","family":"Babaie-Kafaki","sequence":"additional","affiliation":[]},{"given":"Fereidoun","family":"Habibian-Dehkordi","sequence":"additional","affiliation":[]},{"given":"Maria","family":"Toofan","sequence":"additional","affiliation":[]}],"member":"250","published-online":{"date-parts":[[2024,7,2]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","first-page":"478","DOI":"10.1016\/j.apm.2011.07.021","volume":"36","author":"Ahookhoosh","year":"2012","journal-title":"Appl. Math. Model."},{"key":"R2","doi-asserted-by":"crossref","first-page":"1527","DOI":"10.1007\/s11075-022-01477-7","volume":"93","author":"Aminifard","year":"2023","journal-title":"Numer. Algorithms"},{"key":"R3","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/s11075-006-9023-9","volume":"42","author":"Andrei","year":"2006","journal-title":"Numer. Algorithms"},{"key":"R4","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/s11075-007-9152-9","volume":"47","author":"Andrei","year":"2008","journal-title":"Numer. Algorithms"},{"key":"R5","doi-asserted-by":"crossref","first-page":"2289","DOI":"10.1080\/02331934.2014.947500","volume":"64","author":"Ansary","year":"2015","journal-title":"Optimization"},{"key":"R6","doi-asserted-by":"crossref","first-page":"1196","DOI":"10.1137\/S1052623497330963","volume":"10","author":"Birgin","year":"2000","journal-title":"SIAM J. Optim."},{"key":"R7","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1023\/A:1022614029984","volume":"96","author":"Carrizosa","year":"1998","journal-title":"J. Optim. Theory Appl."},{"key":"R8","doi-asserted-by":"crossref","first-page":"912","DOI":"10.1016\/j.camwa.2011.11.057","volume":"63","author":"Chiandussi","year":"2012","journal-title":"Comput. Math. Appl."},{"key":"R9","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1007\/s10589-012-9495-6","volume":"54","author":"Chuong","year":"2013","journal-title":"Comput. Optim. Appl."},{"key":"R10","doi-asserted-by":"crossref","first-page":"795","DOI":"10.1007\/s10589-012-9460-4","volume":"53","author":"Cui","year":"2012","journal-title":"Comput. Optim. Appl."},{"key":"R11","first-page":"139","volume":"15","author":"Dai","year":"2002","journal-title":"J. Syst. Sci. Complex."},{"key":"R12","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"Dolan","year":"2002","journal-title":"Math. Program."},{"key":"R13","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1023\/B:COAP.0000018877.86161.8b","volume":"28","author":"Drummond","year":"2004","journal-title":"Comput. Optim. Appl."},{"key":"R14","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1016\/j.cam.2004.06.018","volume":"175","author":"Drummond","year":"2005","journal-title":"J. Comput. Appl. Math."},{"key":"R15","doi-asserted-by":"crossref","first-page":"1268","DOI":"10.1287\/mnsc.30.11.1268","volume":"30","author":"Evans","year":"1984","journal-title":"Manage. Sci."},{"key":"R16","doi-asserted-by":"crossref","first-page":"1365","DOI":"10.1007\/s11590-018-1353-8","volume":"13","author":"Fazzio","year":"2019","journal-title":"Optim. Lett."},{"key":"R17","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1007\/s001860000043","volume":"51","author":"Fliege","year":"2000","journal-title":"Math. Methods Oper. Res."},{"key":"R18","doi-asserted-by":"crossref","first-page":"602","DOI":"10.1137\/08071692X","volume":"20","author":"Fliege","year":"2009","journal-title":"SIAM J. Optim."},{"key":"R19","doi-asserted-by":"crossref","first-page":"1009","DOI":"10.1080\/02331934.2010.522710","volume":"60","author":"Fukuda","year":"2011","journal-title":"Optimization"},{"key":"R20","doi-asserted-by":"crossref","first-page":"585","DOI":"10.1590\/0101-7438.2014.034.03.0585","volume":"34","author":"Fukuda","year":"2014","journal-title":"Pesqui. Oper."},{"key":"R21","doi-asserted-by":"crossref","first-page":"707","DOI":"10.1137\/0723046","volume":"23","author":"Grippo","year":"1986","journal-title":"SIAM J. Numer. Anal."},{"key":"R22","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1007\/BF00940345","volume":"60","author":"Grippo","year":"1989","journal-title":"J. Optim. Theory Appl."},{"key":"R23","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1145\/1132973.1132979","volume":"32","author":"Hager","year":"2006","journal-title":"ACM Trans. Math. Softw."},{"key":"R24","doi-asserted-by":"crossref","first-page":"477","DOI":"10.1109\/TEVC.2005.861417","volume":"10","author":"Huband","year":"2006","journal-title":"IEEE Trans. Evol. Comput."},{"key":"R25","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/S0167-6911(82)80014-5","volume":"2","author":"Johnstone","year":"1982","journal-title":"Syst. Control Lett."},{"key":"R26","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1162\/106365602760234108","volume":"10","author":"Laumanns","year":"2002","journal-title":"Evol. Comput."},{"key":"R27","doi-asserted-by":"crossref","first-page":"3141","DOI":"10.1109\/TSP.2005.851110","volume":"53","author":"Leung","year":"2005","journal-title":"IEEE T. Signal Process."},{"key":"R28","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1023\/A:1021723128049","volume":"101","author":"Liu","year":"1999","journal-title":"J. Optim. Theory Appl."},{"key":"R29","doi-asserted-by":"crossref","first-page":"2690","DOI":"10.1137\/17M1126588","volume":"28","author":"P\u00e9rez","year":"2018","journal-title":"SIAM J. Optim."},{"key":"R30","doi-asserted-by":"crossref","first-page":"662","DOI":"10.1016\/j.ejor.2007.05.015","volume":"188","author":"Miglierina","year":"2008","journal-title":"Eur. J. Oper. Res."},{"key":"R31","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/s10898-019-00802-0","volume":"75","author":"Mita","year":"2019","journal-title":"J. Global Optim."},{"key":"R32","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1109\/LSP.2008.2001559","volume":"15","author":"Paleologu","year":"2008","journal-title":"IEEE Signal Process. Lett."},{"key":"R33","doi-asserted-by":"crossref","first-page":"356","DOI":"10.1016\/j.ejor.2017.05.027","volume":"263","author":"Qu","year":"2017","journal-title":"Eur. J. Oper. Res."},{"key":"R34","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1007\/s12190-017-1113-4","volume":"57","author":"Rezaee","year":"2018","journal-title":"J. Appl. Math. Comput."},{"key":"R35","unstructured":"Sch\u00fctze O., Lara A. and Coello C.C., The directed search method for unconstrained multi-objective optimization problems, in Proceedings of the EVOLVE \u2013 A Bridge Between Probability, Set Oriented Numerics, and Evolutionary Computation. (2011) 1\u20134."},{"key":"R36","doi-asserted-by":"crossref","unstructured":"Sefrioui M. and Perlaux J., Nash genetic algorithms: examples and applications, in Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No. 00TH8512). Vol. 1. IEEE (2000) 509\u2013516.","DOI":"10.1109\/CEC.2000.870339"},{"key":"R37","doi-asserted-by":"crossref","unstructured":"Skulimowski A.M.J., Methods of multicriteria decision support based on reference sets, in Advances in Multiple Objective and Goal Programming: Proceedings of the Second International Conference on Multi-Objective Programming and Goal Programming, Torremolinos, Spain, May 16\u201318, 1996. Springer (1997) 282\u2013290.","DOI":"10.1007\/978-3-642-46854-4_31"},{"key":"R38","first-page":"159","volume":"156","author":"Sun","year":"2004","journal-title":"Appl. Math. Comput."},{"key":"R39","unstructured":"Sun W. and Yuan Y.X., Optimization Theory and Methods: Nonlinear Programming. Springer, New York (2006)."},{"key":"R40","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1109\/TEVC.2019.2909744","volume":"24","author":"Tanabe","year":"2019","journal-title":"IEEE Trans. Evol. Comput."},{"key":"R41","doi-asserted-by":"crossref","first-page":"725","DOI":"10.1137\/S106482759427021X","volume":"17","author":"Toint","year":"1996","journal-title":"SIAM J. Sci. Comput."},{"key":"R42","doi-asserted-by":"crossref","first-page":"63","DOI":"10.4134\/JKMS.2010.47.1.063","volume":"47","author":"Yu","year":"2010","journal-title":"J. Korean Math. Soc."},{"key":"R43","doi-asserted-by":"crossref","first-page":"1043","DOI":"10.1137\/S1052623403428208","volume":"14","author":"Zhang","year":"2004","journal-title":"SIAM J. Optim."}],"container-title":["RAIRO - Operations Research"],"original-title":[],"link":[{"URL":"https:\/\/www.rairo-ro.org\/10.1051\/ro\/2024030\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,30]],"date-time":"2025-01-30T12:46:47Z","timestamp":1738241207000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.rairo-ro.org\/10.1051\/ro\/2024030"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7]]},"references-count":43,"journal-issue":{"issue":"4"},"alternative-id":["ro230082"],"URL":"https:\/\/doi.org\/10.1051\/ro\/2024030","relation":{},"ISSN":["0399-0559","2804-7303"],"issn-type":[{"type":"print","value":"0399-0559"},{"type":"electronic","value":"2804-7303"}],"subject":[],"published":{"date-parts":[[2024,7]]}}}