{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T21:58:53Z","timestamp":1775080733592,"version":"3.50.1"},"reference-count":48,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2019,12,9]],"date-time":"2019-12-09T00:00:00Z","timestamp":1575849600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"crossref","award":["424860\/2018-0"],"award-info":[{"award-number":["424860\/2018-0"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100005285","name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado de Goi\u00e1s","doi-asserted-by":"crossref","award":["201710267000532"],"award-info":[{"award-number":["201710267000532"]}],"id":[{"id":"10.13039\/501100005285","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Math. Softw."],"published-print":{"date-parts":[[2019,12,31]]},"abstract":"<jats:p>In a recent article, Lucambio P\u00e9rez and Prudente extended the Wolfe conditions for the vector-valued optimization. Here, we propose a line search algorithm for finding a step size satisfying the strong Wolfe conditions in the vector optimization setting. Well definedness and finite termination results are provided. We discuss practical aspects related to the algorithm and present some numerical experiments illustrating its applicability. Codes supporting this article are written in Fortran 90 and are freely available for download.<\/jats:p>","DOI":"10.1145\/3342104","type":"journal-article","created":{"date-parts":[[2019,12,9]],"date-time":"2019-12-09T13:35:27Z","timestamp":1575898527000},"page":"1-23","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":41,"title":["A Wolfe Line Search Algorithm for Vector Optimization"],"prefix":"10.1145","volume":"45","author":[{"given":"L. R.","family":"Lucambio P\u00e9rez","sequence":"first","affiliation":[{"name":"Universidade Federal de Goi\u00e1s, GO, Brazil"}]},{"given":"L. F.","family":"Prudente","sequence":"additional","affiliation":[{"name":"Universidade Federal de Goi\u00e1s, GO, Brazil"}]}],"member":"320","published-online":{"date-parts":[[2019,12,9]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00940566"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jmateco.2003.06.003"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1080\/02331934.2014.947500"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1137\/120866415"},{"key":"e_1_2_1_5_1","volume-title":"Nonlinear Programming","author":"Bertsekas D. P.","unstructured":"D. P. Bertsekas. 1999. Nonlinear Programming. Athena Scientific, Belmont, MA."},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623403429093"},{"key":"e_1_2_1_7_1","doi-asserted-by":"crossref","unstructured":"G. A. Carrizo P. A. Lotito and M. C. Maciel. 2016. Trust region globalization strategy for the nonconvex unconstrained multiobjective optimization problem. Math. Prog. 159 1 (1 Sept. 2016) 339--369.","DOI":"10.1007\/s10107-015-0962-6"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10957-010-9667-4"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2006.09.070"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1080\/01630563.2011.587072"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-012-9495-6"},{"key":"e_1_2_1_12_1","volume-title":"Nonlin. Conv. Anal. 12","author":"Chuong Thai Doan","year":"2011","unstructured":"Thai Doan Chuong, B. S. Mordukhovich, and J. C. Yao. 2011. Hybrid approximate proximal algorithms for efficient solutions in vector optimization. J. Nonlin. Conv. Anal. 12, 2 (8 2011), 257--285."},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1080\/00036811.2011.640629"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.na.2011.04.067"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/3216586.3216598"},{"key":"e_1_2_1_16_1","doi-asserted-by":"crossref","unstructured":"J. E. Dennis and R. B. Schnabel. 1996. Numerical Methods for Unconstrained Optimization and Nonlinear Equations. Vol. 16. Siam.","DOI":"10.1137\/1.9781611971200"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1002\/9781118723203"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1137\/08071692X"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/s001860000043"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10957-006-9136-2"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2013.10.028"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1080\/02331934.2010.522710"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-012-9501-z"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1023\/B:COAP.0000018877.86161.8b"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1080\/02331934.2012.693082"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cam.2004.06.018"},{"key":"e_1_2_1_27_1","first-page":"1","article-title":"A multicriterion view of optimal resource allocation in job-shop production. Euro","volume":"61","author":"Gravel M.","year":"1992","unstructured":"M. Gravel, J. M. Martel, R. Nadeau, W. Price, and R. Tremblay. 1992. A multicriterion view of optimal resource allocation in job-shop production. Euro. J. Op. Res. 61, 1-2 (1992), 230--244.","journal-title":"J. Op. Res."},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/0898-1221(89)90177-6"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1137\/030601880"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijrobp.2008.07.015"},{"key":"e_1_2_1_31_1","volume-title":"Optimization and Optimal Control","author":"Lemar\u00e9chal C.","unstructured":"C. Lemar\u00e9chal. 1981. A view of line-searches. In Optimization and Optimal Control. Springer, 59--78."},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(92)90228-2"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1080\/00036811.2013.839781"},{"key":"e_1_2_1_34_1","volume-title":"Lectures Notes in Economics and Mathematical Systems","volume":"319","author":"Luc D. T.","year":"1989","unstructured":"D. T. Luc. 1989. Theory of vector optimization. Lectures Notes in Economics and Mathematical Systems, Vol. 319."},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1137\/17M1126588"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2007.05.015"},{"key":"e_1_2_1_37_1","unstructured":"J. J. Mor\u00e9 and D. C. Sorensen. 1982. Newton\u2019s Method. Technical Report. Argonne National Lab. Lemont IL."},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/192115.192132"},{"key":"e_1_2_1_39_1","unstructured":"J. Nocedal and S. Wright. 2006. Numerical Optimization. Springer Science 8 Business Media."},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2011.07.008"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1080\/10556788.2012.660483"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/355921.355933"},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0548(03)00074-1"},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-010-0727-9"},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2011.05.006"},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(97)00056-8"},{"key":"e_1_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02243549"},{"key":"e_1_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/279232.279236"}],"container-title":["ACM Transactions on Mathematical Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3342104","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3342104","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T00:43:25Z","timestamp":1750207405000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3342104"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,12,9]]},"references-count":48,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2019,12,31]]}},"alternative-id":["10.1145\/3342104"],"URL":"https:\/\/doi.org\/10.1145\/3342104","relation":{},"ISSN":["0098-3500","1557-7295"],"issn-type":[{"value":"0098-3500","type":"print"},{"value":"1557-7295","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,12,9]]},"assertion":[{"value":"2018-07-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2019-06-01","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2019-12-09","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}