{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:44:44Z","timestamp":1775054684887,"version":"3.50.1"},"reference-count":96,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T00:00:00Z","timestamp":1630454400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2021,9,6]],"date-time":"2021-09-06T00:00:00Z","timestamp":1630886400000},"content-version":"vor","delay-in-days":5,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100003065","name":"University of Vienna","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100003065","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["4OR-Q J Oper Res"],"published-print":{"date-parts":[[2021,9]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Invented some 65 years ago in a seminal paper by Marguerite Straus-Frank and Philip Wolfe, the Frank\u2013Wolfe method recently enjoys a remarkable revival, fuelled by the need of fast and reliable first-order optimization methods in Data Science and other relevant application areas. This review tries to explain the success of this approach by illustrating versatility and applicability in a wide range of contexts, combined with an account on recent progress in variants, improving on both the speed and efficiency of this surprisingly simple principle of first-order optimization.<\/jats:p>","DOI":"10.1007\/s10288-021-00493-y","type":"journal-article","created":{"date-parts":[[2021,9,6]],"date-time":"2021-09-06T20:03:12Z","timestamp":1630958592000},"page":"313-345","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":26,"title":["Frank\u2013Wolfe and friends: a journey into projection-free first-order optimization methods"],"prefix":"10.1007","volume":"19","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6288-9226","authenticated-orcid":false,"given":"Immanuel M.","family":"Bomze","sequence":"first","affiliation":[]},{"given":"Francesco","family":"Rinaldi","sequence":"additional","affiliation":[]},{"given":"Damiano","family":"Zeffiro","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,9,6]]},"reference":[{"issue":"1","key":"493_CR1","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1080\/10556780701589669","volume":"23","author":"SD Ahipa\u015fao\u011flu","year":"2008","unstructured":"Ahipa\u015fao\u011flu SD, Sun P, Todd MJ (2008) Linear convergence of a modified Frank\u2013Wolfe algorithm for computing minimum-volume enclosing ellipsoids. Optim Methods Soft 23(1):5\u201319","journal-title":"Optim Methods Soft"},{"issue":"5","key":"493_CR2","doi-asserted-by":"publisher","first-page":"494","DOI":"10.1016\/j.comgeo.2011.11.004","volume":"46","author":"SD Ahipa\u015fao\u011flu","year":"2013","unstructured":"Ahipa\u015fao\u011flu SD, Todd MJ (2013) A modified Frank\u2013Wolfe algorithm for computing minimum-area enclosing ellipsoidal cylinders: Theory and algorithms. Comput Geom 46(5):494\u2013519","journal-title":"Comput Geom"},{"key":"493_CR3","first-page":"6192","volume":"2017","author":"Z Allen-Zhu","year":"2017","unstructured":"Allen-Zhu Z, Hazan E, Hu W, Li Y (2017) Linear convergence of a Frank\u2013Wolfe type algorithm over trace-norm balls. Adv Neural Inf Process Syst 2017:6192\u20136201","journal-title":"Adv Neural Inf Process Syst"},{"key":"493_CR4","doi-asserted-by":"crossref","unstructured":"Bach F et al (2013) Learning with submodular functions: A convex optimization perspective. Foundations and Trends$$\\textregistered $$. Mach Learn 6(2\u20133):145\u2013373","DOI":"10.1561\/2200000039"},{"key":"493_CR5","unstructured":"Bashiri MA, Zhang X (2017) Decomposition-invariant conditional gradient for general polytopes with line search. In: Advances in neural information processing systems, pp 2690\u20132700"},{"issue":"4","key":"493_CR6","doi-asserted-by":"publisher","first-page":"2024","DOI":"10.1137\/15M1008397","volume":"25","author":"A Beck","year":"2015","unstructured":"Beck A, Pauwels E, Sabach S (2015) The cyclic block conditional gradient method for convex optimization problems. SIAM J Optim 25(4):2024\u20132049","journal-title":"SIAM J Optim"},{"issue":"1\u20132","key":"493_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10107-016-1069-4","volume":"164","author":"A Beck","year":"2017","unstructured":"Beck A, Shtern S (2017) Linearly convergent away-step conditional gradient for non-strongly convex functions. Math Program 164(1\u20132):1\u201327","journal-title":"Math Program"},{"key":"493_CR8","unstructured":"Berrada L, Zisserman A, Kumar MP (2018) Deep Frank\u2013Wolfe for neural network optimization. In: International conference on learning representations"},{"key":"493_CR9","volume-title":"Convex optimization algorithms","author":"DP Bertsekas","year":"2015","unstructured":"Bertsekas DP (2015) Convex optimization algorithms. Athena Scientific, Nashua"},{"issue":"2","key":"493_CR10","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1023\/A:1008230200610","volume":"10","author":"IM Bomze","year":"1997","unstructured":"Bomze IM (1997) Evolution towards the maximum clique. J Global Optim 10(2):143\u2013164","journal-title":"J Global Optim"},{"key":"493_CR11","doi-asserted-by":"crossref","unstructured":"Bomze IM, Budinich M, Pardalos PM, Pelillo M (1999) The maximum clique problem. In: Du D-Z, Pardalos P (eds) Handbook of combinatorial optimization, pp. 1\u201374. Springer","DOI":"10.1007\/978-1-4757-3023-4_1"},{"issue":"2","key":"493_CR12","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1023\/A:1020209017701","volume":"24","author":"IM Bomze","year":"2002","unstructured":"Bomze IM, de Klerk E (2002) Solving standard quadratic optimization problems via linear, semidefinite and copositive programming. J Global Optim 24(2):163\u2013185","journal-title":"J Global Optim"},{"issue":"3","key":"493_CR13","doi-asserted-by":"publisher","first-page":"2211","DOI":"10.1137\/18M1206953","volume":"29","author":"IM Bomze","year":"2019","unstructured":"Bomze IM, Rinaldi F, Rota Bul\u00f2 S (2019) First-order methods for the impatient: Support identification in finite time with convergent Frank\u2013Wolfe variants. SIAM J Optim 29(3):2211\u20132226","journal-title":"SIAM J Optim"},{"issue":"3","key":"493_CR14","doi-asserted-by":"publisher","first-page":"2470","DOI":"10.1137\/19M1309419","volume":"30","author":"IM Bomze","year":"2020","unstructured":"Bomze IM, Rinaldi F, Zeffiro D (2020) Active set complexity of the away-step Frank\u2013Wolfe algorithm. SIAM J Optim 30(3):2470\u20132500","journal-title":"SIAM J Optim"},{"key":"493_CR15","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441","volume-title":"Convex optimization","author":"S Boyd","year":"2004","unstructured":"Boyd S, Boyd SP, Vandenberghe L (2004) Convex optimization. Cambridge University Press, Cambridge"},{"key":"493_CR16","unstructured":"Braun G, Pokutta S, Tu D, Wright S (2019) Blended conditonal gradients. In: International conference on machine learning, PMLR, pp 735\u2013743"},{"key":"493_CR17","unstructured":"Braun G, Pokutta S, Zink D (2017) Lazifying conditional gradient algorithms. In: ICML, pp 566\u2013575"},{"issue":"6","key":"493_CR18","doi-asserted-by":"publisher","first-page":"717","DOI":"10.1007\/s10208-009-9045-5","volume":"9","author":"EJ Cand\u00e8s","year":"2009","unstructured":"Cand\u00e8s EJ, Recht B (2009) Exact matrix completion via convex optimization. Found Comput Math 9(6):717\u2013772","journal-title":"Found Comput Math"},{"issue":"4","key":"493_CR19","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1137\/0306032","volume":"6","author":"MD Canon","year":"1968","unstructured":"Canon MD, Cullum CD (1968) A tight upper bound on the rate of convergence of Frank\u2013Wolfe algorithm. SIAM J Control 6(4):509\u2013516","journal-title":"SIAM J Control"},{"key":"493_CR20","unstructured":"Carderera A, Pokutta S (2020) Second-order conditional gradient sliding. arXiv preprint arXiv:2002.08907"},{"key":"493_CR21","doi-asserted-by":"crossref","unstructured":"Carlini N, Wagner D (2017) Towards evaluating the robustness of neural networks. In: 2017 IEEE symposium on security and privacy (sp), IEEE, pp 39\u201357","DOI":"10.1109\/SP.2017.49"},{"key":"493_CR22","unstructured":"Chakrabarty D, Jain P, Kothari P (2014) Provable submodular minimization using Wolfe\u2019s algorithm. Adv Neural Inform Process Syst 27:802\u2013809"},{"key":"493_CR23","doi-asserted-by":"crossref","unstructured":"Chen J, Zhou D, Yi J, Gu Q (2020) A Frank\u2013Wolfe framework for efficient and effective adversarial attacks. In: Proceedings of the AAAI conference on artificial intelligence vol 34, pp 3486\u20133494","DOI":"10.1609\/aaai.v34i04.5753"},{"key":"493_CR24","doi-asserted-by":"crossref","unstructured":"Chen PY, Zhang H, Sharma Y, Yi J, Hsieh CJ (2017) ZOO: Zeroth order optimization based black-box attacks to deep neural networks without training substitute models. In: Proceedings of the 10th ACM workshop on artificial intelligence and security, pp 15\u201326","DOI":"10.1145\/3128572.3140448"},{"issue":"1","key":"493_CR25","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1137\/S003614450037906X","volume":"43","author":"SS Chen","year":"2001","unstructured":"Chen SS, Donoho DL, Saunders MA (2001) Atomic decomposition by basis pursuit. SIAM Rev 43(1):129\u2013159","journal-title":"SIAM Rev"},{"issue":"4","key":"493_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1824777.1824783","volume":"6","author":"KL Clarkson","year":"2010","unstructured":"Clarkson KL (2010) Coresets, sparse greedy approximation, and the Frank\u2013Wolfe algorithm. ACM Trans Algorithms 6(4):1\u201330","journal-title":"ACM Trans Algorithms"},{"key":"493_CR27","unstructured":"Combettes C, Pokutta S (2020) Boosting Frank\u2013Wolfe by chasing gradients. In: International Conference on Machine Learning, PMLR, pp 2111\u20132121"},{"key":"493_CR28","doi-asserted-by":"crossref","unstructured":"Combettes CW, Pokutta S (2021) Complexity of linear minimization and projection on some sets. arXiv preprint arXiv:2101.10040","DOI":"10.1016\/j.orl.2021.06.005"},{"key":"493_CR29","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/s10589-020-00195-x","volume":"77","author":"A Cristofari","year":"2020","unstructured":"Cristofari A, De Santis M, Lucidi S, Rinaldi F (2020) An active-set algorithmic framework for non-convex optimization problems over the simplex. Comput Optim Appl 77:57\u201389","journal-title":"Comput Optim Appl"},{"key":"493_CR30","volume-title":"Approximate methods in optimization problems","author":"VF Demyanov","year":"1970","unstructured":"Demyanov VF, Rubinov AM (1970) Approximate methods in optimization problems. American Elsevier, New York"},{"issue":"1","key":"493_CR31","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/s10107-013-0677-5","volume":"146","author":"O Devolder","year":"2014","unstructured":"Devolder O, Glineur F, Nesterov Y (2014) First-order methods of smooth convex optimization with inexact oracle. Math Program 146(1):37\u201375","journal-title":"Math Program"},{"key":"493_CR32","unstructured":"Ding L, Fei Y, Xu Q, Yang C (2020) Spectral Frank\u2013Wolfe algorithm: Strict complementarity and linear convergence. In: International conference on machine learning, PMLR, pp 2535\u20132544"},{"issue":"2","key":"493_CR33","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1137\/0317015","volume":"17","author":"JC Dunn","year":"1979","unstructured":"Dunn JC (1979) Rates of convergence for conditional gradient algorithms near singular and nonsingular extremals. SIAM J Control Optim 17(2):187\u2013211","journal-title":"SIAM J Control Optim"},{"issue":"2","key":"493_CR34","doi-asserted-by":"publisher","first-page":"432","DOI":"10.1016\/0022-247X(78)90137-3","volume":"62","author":"JC Dunn","year":"1978","unstructured":"Dunn JC, Harshbarger S (1978) Conditional gradient algorithms with open loop step size rules. J Math Anal Appl 62(2):432\u2013444","journal-title":"J Math Anal Appl"},{"key":"493_CR35","doi-asserted-by":"crossref","unstructured":"Ferreira O, Sosa W (2021) On the Frank\u2013Wolfe algorithm for non-compact constrained optimization problems. Optimization 1\u201315","DOI":"10.1080\/02331934.2020.1860980"},{"issue":"1\u20132","key":"493_CR36","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","journal-title":"Naval Res Logist Q"},{"issue":"1\u20132","key":"493_CR37","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/s10107-014-0841-6","volume":"155","author":"RM Freund","year":"2016","unstructured":"Freund RM, Grigas P (2016) New analysis and results for the Frank\u2013Wolfe method. Math Program 155(1\u20132):199\u2013230","journal-title":"Math Program"},{"issue":"1","key":"493_CR38","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1137\/15M104726X","volume":"27","author":"RM Freund","year":"2017","unstructured":"Freund RM, Grigas P, Mazumder R (2017) An extended Frank\u2013Wolfe method with in-face directions, and its application to low-rank matrix completion. SIAM J Optim 27(1):319\u2013346","journal-title":"SIAM J Optim"},{"issue":"2","key":"493_CR39","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1287\/moor.5.2.186","volume":"5","author":"S Fujishige","year":"1980","unstructured":"Fujishige S (1980) Lexicographically optimal base of a polymatroid with respect to a weight vector. Math Oper Res 5(2):186\u2013196","journal-title":"Math Oper Res"},{"issue":"2","key":"493_CR40","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/0191-2615(84)90029-8","volume":"18","author":"M Fukushima","year":"1984","unstructured":"Fukushima M (1984) A modified Frank\u2013Wolfe algorithm for solving the traffic assignment problem. Trans Res Part B Methodol 18(2):169\u2013177","journal-title":"Trans Res Part B Methodol"},{"key":"493_CR41","unstructured":"Garber D (2019) Linear convergence of Frank\u2013Wolfe for rank-one matrix recovery without strong convexity. arXiv preprint arXiv:1912.01467"},{"key":"493_CR42","first-page":"18883","volume":"33","author":"D Garber","year":"2020","unstructured":"Garber D (2020) Revisiting Frank\u2013Wolfe for polytopes: Strict complementarity and sparsity. Adv Neural Inform Process Syst 33:18883\u201318893","journal-title":"Adv Neural Inform Process Syst"},{"key":"493_CR43","first-page":"541","volume":"15","author":"D Garber","year":"2015","unstructured":"Garber D, Hazan E (2015) Faster rates for the Frank\u2013Wolfe method over strongly-convex sets. ICML 15:541\u2013549","journal-title":"ICML"},{"issue":"3","key":"493_CR44","doi-asserted-by":"publisher","first-page":"1493","DOI":"10.1137\/140985366","volume":"26","author":"D Garber","year":"2016","unstructured":"Garber D, Hazan E (2016) A linearly convergent variant of the conditional gradient algorithm under strong convexity, with applications to online and stochastic optimization. SIAM J Optim 26(3):1493\u20131528","journal-title":"SIAM J Optim"},{"key":"493_CR45","unstructured":"Goodfellow I, Pouget-Abadie J, Mirza M, Xu B, Warde-Farley D, Ozair S, Courville A, Bengio Y (2014) Generative adversarial nets. In: Advances in neural information processing systems, pp 2672\u20132680"},{"key":"493_CR46","doi-asserted-by":"crossref","unstructured":"Gu\u00e9lat J, Marcotte P (1986) Some comments on Wolfe\u2019s away step. Math Program 35(1):110\u2013119","DOI":"10.1007\/BF01589445"},{"key":"493_CR47","doi-asserted-by":"crossref","unstructured":"Gutman DH, Pena JF (2021) The condition number of a function relative to a set. Math Program 188:255\u2013294","DOI":"10.1007\/s10107-020-01510-4"},{"issue":"1","key":"493_CR48","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/s10107-014-0778-9","volume":"152","author":"Z Harchaoui","year":"2015","unstructured":"Harchaoui Z, Juditsky A, Nemirovski A (2015) Conditional gradient algorithms for norm-regularized smooth convex optimization. Math Program 152(1):75\u2013112","journal-title":"Math Program"},{"key":"493_CR49","unstructured":"Hogan WW (1971) Convergence results for some extensions of the Frank\u2013Wolfe method. Tech. rep., California Univ Los Angeles Western Management Science Inst"},{"issue":"1","key":"493_CR50","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/BF01580219","volume":"6","author":"CA Holloway","year":"1974","unstructured":"Holloway CA (1974) An extension of the Frank and Wolfe method of feasible directions. Math Program 6(1):14\u201327","journal-title":"Math Program"},{"issue":"4","key":"493_CR51","doi-asserted-by":"publisher","first-page":"1161","DOI":"10.1287\/moor.2018.0954","volume":"44","author":"JT Hungerford","year":"2019","unstructured":"Hungerford JT, Rinaldi F (2019) A general regularized continuous formulation for the maximum clique problem. Math Oper Res 44(4):1161\u20131173","journal-title":"Math Oper Res"},{"key":"493_CR52","unstructured":"Jaggi M (2011) Sparse convex optimization methods for machine learning. Ph.D. thesis, ETH Zurich"},{"key":"493_CR53","first-page":"427","volume":"1","author":"M Jaggi","year":"2013","unstructured":"Jaggi M (2013) Revisiting Frank\u2013Wolfe: Projection-free sparse convex optimization. ICML 1:427\u2013435","journal-title":"ICML"},{"key":"493_CR54","unstructured":"Jaggi M, Sulovsk\u00fd M (2010) A simple algorithm for nuclear norm regularized problems. In: ICML, pp 471\u2013478"},{"key":"493_CR55","doi-asserted-by":"crossref","unstructured":"Joulin A, Tang K, Fei-Fei L (2014) Efficient image and video co-localization with Frank\u2013Wolfe algorithm. In: European conference on computer vision. Springer, pp 253\u2013268","DOI":"10.1007\/978-3-319-10599-4_17"},{"key":"493_CR56","unstructured":"Kazemi E, Kerdreux T, Wang L (2021) Generating structured adversarial attacks using Frank\u2013Wolfe method. arXiv preprint arXiv:2102.07360"},{"key":"493_CR57","unstructured":"Kerdreux T, d\u2019Aspremont A, Pokutta S (2021) Projection-free optimization on uniformly convex sets. In: International Conference on Artificial Intelligence and Statistics, pp. 19\u201327. PMLR"},{"key":"493_CR58","unstructured":"Kerdreux T, Liu L, Lacoste-Julien S, Scieur D (2020) Affine invariant analysis of Frank\u2013Wolfe on strongly convex sets. arXiv preprint arXiv:2011.03351"},{"issue":"12","key":"493_CR59","doi-asserted-by":"publisher","first-page":"2275","DOI":"10.1080\/02331934.2018.1530235","volume":"67","author":"I Konnov","year":"2018","unstructured":"Konnov I (2018) Simplified versions of the conditional gradient method. Optimization 67(12):2275\u20132290","journal-title":"Optimization"},{"key":"493_CR60","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/996546.996548","volume":"8","author":"P Kumar","year":"2003","unstructured":"Kumar P, Mitchell JS, Y\u0131ld\u0131r\u0131m EA (2003) Approximate minimum enclosing balls in high dimensions using core-sets. J Exp Algorithmics 8:1\u20131","journal-title":"J Exp Algorithmics"},{"key":"493_CR61","unstructured":"Lacoste-Julien S (2016) Convergence rate of Frank\u2013Wolfe for non-convex objectives. arXiv preprint arXiv:1607.00345"},{"key":"493_CR62","unstructured":"Lacoste-Julien S, Jaggi M (2015) On the global linear convergence of Frank\u2013Wolfe optimization variants. In: Advances in neural information processing systems, pp 496\u2013504"},{"key":"493_CR63","unstructured":"Lacoste-Julien S, Jaggi M, Schmidt M, Pletscher P (2013) Block-coordinate Frank\u2013Wolfe optimization for structural SVMs. In: Dasgupta S, McAllester D (eds) Proceedings of the 30th International Conference on Machine Learning, Proceedings of Machine Learning Research, vol 28, PMLR, Atlanta, Georgia, USA, pp 53\u201361"},{"key":"493_CR64","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-39568-1","volume-title":"First-order and stochastic optimization methods for machine learning","author":"G Lan","year":"2020","unstructured":"Lan G (2020) First-order and stochastic optimization methods for machine learning. Springer, New York"},{"issue":"2","key":"493_CR65","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","journal-title":"SIAM J Optim"},{"issue":"5","key":"493_CR66","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/0041-1647(75)90030-1","volume":"9","author":"LJ LeBlanc","year":"1975","unstructured":"LeBlanc LJ, Morlok EK, Pierskalla WP (1975) An efficient approach to solving the road network equilibrium traffic assignment problem. Transp Res 9(5):309\u2013318","journal-title":"Transp Res"},{"issue":"5","key":"493_CR67","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0041-5553(66)90114-5","volume":"6","author":"ES Levitin","year":"1966","unstructured":"Levitin ES, Polyak BT (1966) Constrained minimization methods. USSR Comput Math Math Phys 6(5):1\u201350","journal-title":"USSR Comput Math Math Phys"},{"key":"493_CR68","unstructured":"Locatello F, Khanna R, Tschannen M, Jaggi M (2017) A unified optimization view on generalized matching pursuit and Frank\u2013Wolfe. In: Artificial intelligence and statistics. PMLR, pp 860\u2013868"},{"issue":"2","key":"493_CR69","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/BF02289146","volume":"14","author":"RD Luce","year":"1949","unstructured":"Luce RD, Perry AD (1949) A method of matrix analysis of group structure. Psychometrika 14(2):95\u2013116","journal-title":"Psychometrika"},{"key":"493_CR70","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/978-3-642-99789-1_13","volume-title":"Appl Math Parallel Comput","author":"O Mangasarian","year":"1996","unstructured":"Mangasarian O (1996) Machine learning via polyhedral concave minimization. Appl Math Parallel Comput. Springer, New York, pp 175\u2013188"},{"issue":"1","key":"493_CR71","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1137\/0312003","volume":"12","author":"B Mitchell","year":"1974","unstructured":"Mitchell B, Demyanov VF, Malozemov V (1974) Finding the point of a polyhedron closest to the origin. SIAM J Control 12(1):19\u201326","journal-title":"SIAM J Control"},{"issue":"2","key":"493_CR72","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1287\/trsc.1120.0409","volume":"47","author":"M Mitradjieva","year":"2013","unstructured":"Mitradjieva M, Lindberg PO (2013) The stiff is moving\u2013conjugate direction Frank\u2013Wolfe methods with applications to traffic assignment. Transp Sci 47(2):280\u2013293","journal-title":"Transp Sci"},{"issue":"5","key":"493_CR73","doi-asserted-by":"publisher","first-page":"A3291","DOI":"10.1137\/15M101628X","volume":"38","author":"C Mu","year":"2016","unstructured":"Mu C, Zhang Y, Wright J, Goldfarb D (2016) Scalable robust matrix recovery: Frank\u2013Wolfe meets proximal methods. SIAM J Sci Comput 38(5):A3291\u2013A3317","journal-title":"SIAM J Sci Comput"},{"key":"493_CR74","unstructured":"Osokin A, Alayrac JB, Lukasewitz I, Dokania P, Lacoste-Julien S (2016) Minding the gaps for block Frank\u2013Wolfe optimization of structured svms. In: International conference on machine learning, PMLR, pp 593\u2013602"},{"issue":"1","key":"493_CR75","first-page":"1","volume":"44","author":"J Pe\u00f1a","year":"2018","unstructured":"Pe\u00f1a J, Rodriguez D (2018) Polytope conditioning and linear convergence of the Frank\u2013Wolfe algorithm. Math Oper Res 44(1):1\u201318","journal-title":"Math Oper Res"},{"key":"493_CR76","unstructured":"Pedregosa F, Negiar G, Askari A, Jaggi M (2020) Linearly convergent Frank\u2013Wolfe with backtracking line-search. In: International conference on artificial intelligence and statistics. PMLR, pp 1\u201310"},{"key":"493_CR77","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1016\/j.cor.2014.08.024","volume":"54","author":"O Perederieieva","year":"2015","unstructured":"Perederieieva O, Ehrgott M, Raith A, Wang JY (2015) A framework for and empirical study of algorithms for traffic assignment. Comput Oper Res 54:90\u2013107","journal-title":"Comput Oper Res"},{"key":"493_CR78","unstructured":"Rademacher L, Shu C (2020) The smoothed complexity of Frank\u2013Wolfe methods via conditioning of random matrices and polytopes. arXiv preprint arXiv:2009.12685"},{"issue":"3","key":"493_CR79","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1007\/s10589-008-9202-9","volume":"46","author":"F Rinaldi","year":"2010","unstructured":"Rinaldi F, Schoen F, Sciandrone M (2010) Concave programming for minimizing the zero-norm over polyhedral sets. Comput Optim Appl 46(3):467\u2013486","journal-title":"Comput Optim Appl"},{"key":"493_CR80","unstructured":"Rinaldi F, Zeffiro D (2020) Avoiding bad steps in Frank Wolfe variants. arXiv preprint arXiv:2012.12737"},{"key":"493_CR81","unstructured":"Rinaldi F, Zeffiro D (2020) A unifying framework for the analysis of projection-free first-order methods under a sufficient slope condition. arXiv preprint arXiv:2008.09781"},{"issue":"11","key":"493_CR82","doi-asserted-by":"publisher","first-page":"1890","DOI":"10.1109\/JPROC.2020.3012609","volume":"108","author":"AK Sahu","year":"2020","unstructured":"Sahu AK, Kar S (2020) Decentralized zeroth-order constrained stochastic optimization algorithms: Frank\u2013Wolfe and variants with applications to black-box adversarial attacks. Proc IEEE 108(11):1890\u20131905","journal-title":"Proc IEEE"},{"key":"493_CR83","doi-asserted-by":"crossref","unstructured":"Shah N, Kolmogorov V, Lampert CH (2015) A multi-plane block-coordinate Frank\u2013Wolfe algorithm for training structural svms with a costly max-oracle. In: Proceedings of the IEEE conference on computer vision and pattern recognition, pp 2737\u20132745","DOI":"10.1109\/CVPR.2015.7298890"},{"key":"493_CR84","first-page":"2","volume":"1","author":"Y Sun","year":"2020","unstructured":"Sun Y (2020) Safe screening for the generalized conditional gradient method. Image 1:2","journal-title":"Image"},{"issue":"1","key":"493_CR85","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1111\/j.2517-6161.1996.tb02080.x","volume":"58","author":"R Tibshirani","year":"1996","unstructured":"Tibshirani R (1996) Regression shrinkage and selection via the lasso. J Roy Stat Soc: Ser B (Methodol) 58(1):267\u2013288","journal-title":"J Roy Stat Soc: Ser B (Methodol)"},{"key":"493_CR86","volume-title":"The nature of statistical learning theory","author":"V Vapnik","year":"2013","unstructured":"Vapnik V (2013) The nature of statistical learning theory. Springer, New York"},{"issue":"1","key":"493_CR87","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(1):49\u201368","journal-title":"Math Program"},{"key":"493_CR88","unstructured":"Wang H, Lu H, Mazumder R (2020) Frank\u2013Wolfe methods with an unbounded feasible region and applications to structured learning. arXiv preprint arXiv:2012.15361"},{"key":"493_CR89","unstructured":"Wang YX, Sadhanala V, Dai W, Neiswanger W, Sra S, Xing E (2016) Parallel and distributed block-coordinate Frank\u2013Wolfe algorithms. In: International Conference on Machine Learning. PMLR, pp 1548\u20131557"},{"issue":"3","key":"493_CR90","first-page":"325","volume":"1","author":"JG Wardrop","year":"1952","unstructured":"Wardrop JG (1952) Road paper. some theoretical aspects of road traffic research. Proc Inst Civ Eng 1(3):325\u2013362","journal-title":"Proc Inst Civ Eng"},{"issue":"2","key":"493_CR91","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/0191-2615(85)90018-9","volume":"19","author":"A Weintraub","year":"1985","unstructured":"Weintraub A, Ortiz C, Gonz\u00e1lez J (1985) Accelerating convergence of the Frank\u2013Wolfe algorithm. Transp Res Part B Methodol 19(2):113\u2013122","journal-title":"Transp Res Part B Methodol"},{"key":"493_CR92","unstructured":"Wolfe P (1970) Convergence theory in nonlinear programming. In: Abadie J (ed) Integer and nonlinear programming. North Holland, pp 1\u201336"},{"issue":"1","key":"493_CR93","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1007\/BF01580381","volume":"11","author":"P Wolfe","year":"1976","unstructured":"Wolfe P (1976) Finding the nearest point in a polytope. Math Program 11(1):128\u2013149","journal-title":"Math Program"},{"issue":"3","key":"493_CR94","doi-asserted-by":"publisher","first-page":"693","DOI":"10.1016\/j.ejor.2014.09.064","volume":"242","author":"Q Wu","year":"2015","unstructured":"Wu Q, Hao JK (2015) A review on algorithms for maximum clique problems. Eur J Oper Res 242(3):693\u2013709","journal-title":"Eur J Oper Res"},{"key":"493_CR95","unstructured":"Xu Y, Yang T (2018) Frank\u2013Wolfe method is automatically adaptive to error bound condition. arXiv preprint arXiv:1810.04765"},{"issue":"3","key":"493_CR96","doi-asserted-by":"publisher","first-page":"1368","DOI":"10.1137\/070690419","volume":"19","author":"EA Y\u0131ld\u0131r\u0131m","year":"2008","unstructured":"Y\u0131ld\u0131r\u0131m EA (2008) Two algorithms for the minimum enclosing ball problem. SIAM J Optim 19(3):1368\u20131391","journal-title":"SIAM J Optim"}],"container-title":["4OR"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-021-00493-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10288-021-00493-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-021-00493-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T22:21:14Z","timestamp":1725747674000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10288-021-00493-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,9]]},"references-count":96,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2021,9]]}},"alternative-id":["493"],"URL":"https:\/\/doi.org\/10.1007\/s10288-021-00493-y","relation":{},"ISSN":["1619-4500","1614-2411"],"issn-type":[{"value":"1619-4500","type":"print"},{"value":"1614-2411","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,9]]},"assertion":[{"value":"1 July 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 July 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 August 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 September 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors confirm there is no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}