{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,25]],"date-time":"2025-09-25T16:42:01Z","timestamp":1758818521931,"version":"3.44.0"},"reference-count":17,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002338","name":"Ministry of Education of the People's Republic of China","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100002338","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Applied Mathematics and Computation"],"published-print":{"date-parts":[[2004,1]]},"DOI":"10.1016\/s0096-3003(02)00821-4","type":"journal-article","created":{"date-parts":[[2003,10,22]],"date-time":"2003-10-22T08:20:53Z","timestamp":1066810853000},"page":"1-13","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":5,"title":["The convergence of equilibrium algorithms with non-monotone line search technique"],"prefix":"10.1016","volume":"148","author":[{"given":"Ziyou","family":"Gao","sequence":"first","affiliation":[]},{"given":"W.H.K.","family":"Lam","sequence":"additional","affiliation":[]},{"given":"S.C.","family":"Wong","sequence":"additional","affiliation":[]},{"given":"H.","family":"Yang","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/S0096-3003(02)00821-4_BIB1","doi-asserted-by":"crossref","first-page":"1187","DOI":"10.1137\/0729072","article-title":"Avoiding the maratos effect by means of a non-monotone line search. II. Inequality constrained problems-feasible iterates","volume":"29","author":"Bonnans","year":"1992","journal-title":"SIAM J. Number. Anal."},{"key":"10.1016\/S0096-3003(02)00821-4_BIB2","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/BFb0120941","article-title":"A scaled reduced gradient algorithm for network flow problems with convex separable costs","volume":"15","author":"Dembo","year":"1981","journal-title":"Math. Program. Stud."},{"issue":"2","key":"10.1016\/S0096-3003(02)00821-4_BIB3","doi-asserted-by":"crossref","first-page":"91","DOI":"10.6028\/jres.073B.010","article-title":"The traffic assignment problem for a general network","volume":"37","author":"Dafermos","year":"1969","journal-title":"J. Res. Nat. Stands Sect. B"},{"key":"10.1016\/S0096-3003(02)00821-4_BIB4","doi-asserted-by":"crossref","unstructured":"M. Florian, An improved linear approximation algorithm or the network equilibrium (packet switching) problem, In: Proceedings of the 1977 IEEE Conference on Decision Control, 1997, pp. 812\u2013818","DOI":"10.1109\/CDC.1977.271681"},{"issue":"2","key":"10.1016\/S0096-3003(02)00821-4_BIB5","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/0191-2615(84)90029-8","article-title":"A modified Frank\u2013Wolfe algorithm for solving the traffic assignment problem","volume":"18","author":"Fukushima","year":"1984","journal-title":"Trans. Res. B"},{"issue":"2","key":"10.1016\/S0096-3003(02)00821-4_BIB6","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1023\/A:1022639306130","article-title":"Sequential systems of linear equations algorithm for non-linear optimization problems with general constraints","volume":"95","author":"Gao","year":"1999","journal-title":"J. Optimiz. Theory Appl."},{"issue":"4","key":"10.1016\/S0096-3003(02)00821-4_BIB7","doi-asserted-by":"crossref","first-page":"707","DOI":"10.1137\/0723046","article-title":"A non-monotone line search technique for Newton\u2019s method","volume":"23","author":"Grippo","year":"1986","journal-title":"SIAM J. Number. Anal."},{"key":"10.1016\/S0096-3003(02)00821-4_BIB8","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/0041-1647(75)90030-1","article-title":"An efficient approach to solving the road networks equilibrium traffic assignment problem","volume":"9","author":"LeBlanc","year":"1975","journal-title":"Trans. Res."},{"key":"10.1016\/S0096-3003(02)00821-4_BIB9","unstructured":"L.J. LeBlanc, R.V. Helgason, D.E. Boyce, Improved efficiency of the Frank\u2013Wolfe algorithm. Working paper 18-131, Owen Graduate School of Management, Vanderbilt University, Nashvilla, TN, 1982"},{"key":"10.1016\/S0096-3003(02)00821-4_BIB10","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1287\/trsc.8.3.203","article-title":"An algorithm for the traffic assignment problem","volume":"8","author":"Nguyen","year":"1974","journal-title":"Trans. Sci."},{"issue":"4","key":"10.1016\/S0096-3003(02)00821-4_BIB11","doi-asserted-by":"crossref","first-page":"1183","DOI":"10.1137\/0728063","article-title":"Avoiding the Maratos effect by means of a non-monotone line search. I. General constrained problems","volume":"28","author":"Panier","year":"1991","journal-title":"SIAM J. Number. Anal."},{"year":"1985","series-title":"Urban Transportation Network: Equilibrium Analysis with Mathematical Programming Methods","author":"Sheffi","key":"10.1016\/S0096-3003(02)00821-4_BIB12"},{"key":"10.1016\/S0096-3003(02)00821-4_BIB13","unstructured":"US BPR, Traffic Assignment Manual, Washington, DC, 1964"},{"issue":"2","key":"10.1016\/S0096-3003(02)00821-4_BIB14","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/0191-2615(85)90018-9","article-title":"Accelerating convergence of the Frank\u2013Wolfe algorithm","volume":"19","author":"Weintraub","year":"1985","journal-title":"Trans. Res. B"},{"key":"10.1016\/S0096-3003(02)00821-4_BIB15","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1002\/net.3230100303","article-title":"An algorithm for the traffic assignment problem","volume":"10","author":"Weintraub","year":"1980","journal-title":"Networks"},{"key":"10.1016\/S0096-3003(02)00821-4_BIB16","series-title":"Integer and Non-linear programming","first-page":"1","article-title":"Convergence theory in non-linear programming","author":"Wolfe","year":"1970"},{"key":"10.1016\/S0096-3003(02)00821-4_BIB17","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1023\/A:1011281102385","article-title":"The algorithm of sequential KKT equations by nonmonotone search for arbitrary initial point","volume":"18","author":"Xu","year":"2001","journal-title":"Comput. Optimiz. Appl."}],"container-title":["Applied Mathematics and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0096300302008214?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0096300302008214?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,25]],"date-time":"2025-09-25T16:05:52Z","timestamp":1758816352000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0096300302008214"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,1]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2004,1]]}},"alternative-id":["S0096300302008214"],"URL":"https:\/\/doi.org\/10.1016\/s0096-3003(02)00821-4","relation":{},"ISSN":["0096-3003"],"issn-type":[{"type":"print","value":"0096-3003"}],"subject":[],"published":{"date-parts":[[2004,1]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"The convergence of equilibrium algorithms with non-monotone line search technique","name":"articletitle","label":"Article Title"},{"value":"Applied Mathematics and Computation","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0096-3003(02)00821-4","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2002 Elsevier Inc. All rights reserved.","name":"copyright","label":"Copyright"}]}}