{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:14:33Z","timestamp":1742912073060,"version":"3.40.3"},"publisher-location":"Boston, MA","reference-count":17,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9780387747583"},{"type":"electronic","value":"9780387747590"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-0-387-74759-0_191","type":"book-chapter","created":{"date-parts":[[2008,8,25]],"date-time":"2008-08-25T11:03:26Z","timestamp":1219662206000},"page":"1094-1097","source":"Crossref","is-referenced-by-count":3,"title":["Frank\u2013Wolfe Algorithm"],"prefix":"10.1007","author":[{"given":"Siriphong","family":"Lawphongpanich","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"191_CR1_191","doi-asserted-by":"crossref","first-page":"1","DOI":"10.2140\/pjm.1966.16.1","volume":"16","author":"L. Armijo","year":"1966","unstructured":"Armijo L (1966) Minimization of functions having Lipschitz continuous first-partial derivatives. Pacific J Math 16:1\u20133","journal-title":"Pacific J. Math."},{"key":"191_CR2_191","doi-asserted-by":"crossref","first-page":"747","DOI":"10.1287\/mnsc.24.7.747","volume":"24","author":"M. Collins","year":"1978","unstructured":"Collins M, Cooper L, Helgason R, Kennington J, LeBlanc L (1978) Solving the pipe network analysis problem using optimization techniques. Managem Sci 24:747\u2013760","journal-title":"Managem. Sci."},{"key":"191_CR3_191","doi-asserted-by":"crossref","unstructured":"Florian M (1977) An improved linear approximation algorithm for the network equilibrium (packet switching) problem. Proc. 1977 IEEE Conf. on Decision and Control, New Orleans, Louisiana, pp 167\u2013196","DOI":"10.1109\/CDC.1977.271681"},{"key":"191_CR4_191","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1002\/net.3230170307","volume":"17","author":"M. Florian","year":"1987","unstructured":"Florian M, Gu\u00e9elat J, Spiess H (1987) An efficient implementation of the PARTAN variant of the linear approximation method of the network equilibrium problem. Networks 17:319\u2013339","journal-title":"Networks"},{"key":"191_CR5_191","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 Quart 3:95\u2013110","journal-title":"Naval Res. Logist. Quart."},{"key":"191_CR6_191","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/0191-2615(84)90029-8","volume":"18B","author":"M. Fukushima","year":"1984","unstructured":"Fukushima M (1984) A\u00a0modified Frank\u2013Wolfe algorithm for solving the traffic assignment problem. Transport Res 18B:169\u2013177","journal-title":"Transport. Res."},{"key":"191_CR7_191","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1002\/net.3230050404","volume":"5","author":"B.L. Golden","year":"1975","unstructured":"Golden BL (1975) A\u00a0minimum-cost network flow problem concerning imports and exports. Networks 5:331\u2013356","journal-title":"Networks"},{"key":"191_CR8_191","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/BF01589445","volume":"35","author":"J. Gu\u00e9lat","year":"1986","unstructured":"Gu\u00e9lat J, Marcotte P (1986) Some comments on Wolfe's away step. Math Program 35:110\u2013119","journal-title":"Math. Program."},{"key":"191_CR9_191","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/BF01580219","volume":"6","author":"C. Holloway","year":"1974","unstructured":"Holloway C (1974) An extension of the Frank\u2013Wolfe method of feasible directions. Math Program 6:14\u201327","journal-title":"Math. Program."},{"key":"191_CR10_191","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1287\/trsc.19.4.445","volume":"19","author":"L.J. LeBlanc","year":"1985","unstructured":"LeBlanc LJ, Helgason RV, Boyce DE (1985) Improved efficiency of the Frank-Wolfe algorithm for convex network programs. Transport Sci 19:445\u2013462","journal-title":"Transport. Sci."},{"key":"191_CR11_191","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1016\/0041-1647(75)90030-1","volume":"9","author":"L.J. LeBlanc","year":"1975","unstructured":"LeBlanc LJ, Morlok EK, Pierskalla WP (1975) An efficient approach to solving the road network equilibrium traffic assignment problem. Transport Res 9:308\u2013318","journal-title":"Transport. Res."},{"key":"191_CR12_191","doi-asserted-by":"publisher","first-page":"655","DOI":"10.1137\/0312050","volume":"12","author":"G. Meyer","year":"1974","unstructured":"Meyer G (1974) Accelerated Frank\u2013Wolfe algorithms. SIAM J Control 12:655\u2013663","journal-title":"SIAM J. Control"},{"key":"191_CR13_191","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/BF01581701","volume":"65","author":"A. Migdalas","year":"1994","unstructured":"Migdalas A (1994) A\u00a0regularization of the Frank\u2013Wolfe method and unification of certain nonlinear programming method. Math Program 65:331\u2013346","journal-title":"Math. Program."},{"key":"191_CR14_191","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1287\/trsc.16.1.45","volume":"16","author":"W.B. Powell","year":"1982","unstructured":"Powell WB, Sheffi Y (1982) The convergence of equilibrium algorithms with predetermined step size. Transport Sci 16:45\u201355","journal-title":"Transport. Sci."},{"key":"191_CR15_191","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1137\/0112007","volume":"12","author":"B. Shah","year":"1964","unstructured":"Shah B, Buehler R, Kempthorne O (1964) Some algorithms for minimizing a\u00a0function of several variables. SIAM J Appl Math 12:74\u201392","journal-title":"SIAM J. Appl. Math."},{"key":"191_CR16_191","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/BF01584323","volume":"13","author":"B. Von Hohenbalken","year":"1977","unstructured":"Von Hohenbalken B (1977) Simplicial decomposition in nonlinear programming algorithms. Math Program 13:49\u201368","journal-title":"Math. Program."},{"key":"191_CR17_191","first-page":"1","volume-title":"Integer and Nonlinear Programming","author":"P. Wolfe","year":"1970","unstructured":"Wolfe P (1970) Convergence theory in nonlinear programming. In: Abadie J (ed) Integer and Nonlinear Programming. North-Holland, Amsterdam, pp 1\u201336"}],"container-title":["Encyclopedia of Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-74759-0_191","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,11]],"date-time":"2024-07-11T09:50:22Z","timestamp":1720691422000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-0-387-74759-0_191"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9780387747583","9780387747590"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-74759-0_191","relation":{},"subject":[],"published":{"date-parts":[[2008]]}}}