{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,27]],"date-time":"2026-05-27T20:43:44Z","timestamp":1779914624216,"version":"3.53.1"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2016,9,21]],"date-time":"2016-09-21T00:00:00Z","timestamp":1474416000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"publisher","award":["253\/12"],"award-info":[{"award-number":["253\/12"]}],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2017,7]]},"DOI":"10.1007\/s10107-016-1069-4","type":"journal-article","created":{"date-parts":[[2016,9,21]],"date-time":"2016-09-21T04:32:07Z","timestamp":1474432327000},"page":"1-27","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":36,"title":["Linearly convergent away-step conditional gradient for non-strongly convex functions"],"prefix":"10.1007","volume":"164","author":[{"given":"Amir","family":"Beck","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shimrit","family":"Shtern","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2016,9,21]]},"reference":[{"issue":"2","key":"1069_CR1","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1007\/s001860300327","volume":"59","author":"A Beck","year":"2004","unstructured":"Beck, A., Teboulle, M.: A conditional gradient method with linear rate of convergence for solving convex linear systems. Math. Methods of Oper. Res. 59(2), 235\u2013247 (2004)","journal-title":"Math. Methods of Oper. Res."},{"key":"1069_CR2","first-page":"139","volume-title":"Convex Optimization in Signal Processing and Communications","author":"A Beck","year":"2009","unstructured":"Beck, A., Teboulle, M.: Gradient-based algorithms with applications to signal recovery problems. In: Palomar, D., Eldar, Y. (eds.) Convex Optimization in Signal Processing and Communications, pp. 139\u2013162. Cambridge University Press, Cambridge (2009)"},{"key":"1069_CR3","unstructured":"Bertsekas, D.P.: Nonlinear Programming, 2nd edn. Athena Scientific, Belmont, MA, USA (1999)"},{"key":"1069_CR4","volume-title":"Introduction to Linear Optimization","author":"D Bertsimas","year":"1997","unstructured":"Bertsimas, D., Tsitsiklis, J.N.: Introduction to Linear Optimization, vol. 6. Athena Scientific, Belmont (1997)"},{"issue":"4","key":"1069_CR5","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1137\/0306032","volume":"6","author":"MD Canon","year":"1968","unstructured":"Canon, M.D., Cullum, C.D.: A tight upper bound on the rate of convergence of Frank-Wolfe algorithm. SIAM J. Control 6(4), 509\u2013516 (1968)","journal-title":"SIAM J. Control"},{"issue":"2","key":"1069_CR6","doi-asserted-by":"crossref","first-page":"432","DOI":"10.1016\/0022-247X(78)90137-3","volume":"62","author":"J Dunn","year":"1978","unstructured":"Dunn, J., Harshbarger, S.: Conditional gradient algorithms with open loop step size rules. J. Math. Anal. Appl. 62(2), 432\u2013444 (1978)","journal-title":"J. Math. Anal. Appl."},{"issue":"3","key":"1069_CR7","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1007\/s101070000136","volume":"88","author":"M Epelman","year":"2000","unstructured":"Epelman, M., Freund, R.M.: Condition number complexity of an elementary algorithm for computing a reliable solution of a conic linear system. Math. Program. 88(3), 451\u2013485 (2000)","journal-title":"Math. Program."},{"issue":"1\u20132","key":"1069_CR8","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1002\/nav.3800030109","volume":"3","author":"M Frank","year":"1956","unstructured":"Frank, M., Wolfe, P.: An algorithm for quadratic programming. Nav. Res. Logist. Quart. 3(1\u20132), 95\u2013110 (1956)","journal-title":"Nav. Res. Logist. Quart."},{"key":"1069_CR9","unstructured":"Freund, R.M., Grigas, P., Mazumder, R.: An extended frank-wolfe method with \u201cin-face\u201d directions, and its application to low-rank matrix completion. arXiv preprint; arXiv:1511.02204 (2015)"},{"key":"1069_CR10","unstructured":"Garber, D., Hazan, E.: A linearly convergent conditional gradient algorithm with applications to online and stochastic optimization. arXiv preprint; arXiv:1301.4666 (2013)"},{"key":"1069_CR11","first-page":"73","volume-title":"Optimization, volume\u00a01 of Handbooks in Operations Research and Management Science","author":"D Goldfarb","year":"1989","unstructured":"Goldfarb, D., Todd, M.J.: Chapter ii: Linear programming. In: Nemhauser, G., Kan, A.R., Todd, M. (eds.) Optimization, volume\u00a01 of Handbooks in Operations Research and Management Science, pp. 73\u2013170. Elsevier, Amsterdam (1989)"},{"issue":"1","key":"1069_CR12","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1007\/BF01589445","volume":"35","author":"J Guelat","year":"1986","unstructured":"Guelat, J., Marcotte, P.: Some comments on Wolfe\u2019s away step. Math. Program. 35(1), 110\u2013119 (1986)","journal-title":"Math. Program."},{"key":"1069_CR13","doi-asserted-by":"crossref","unstructured":"G\u00fcler, O.: Foundations of Optimization. Graduate Texts in Mathematics, vol. 258. Springer, New York (2010)","DOI":"10.1007\/978-0-387-68407-9"},{"issue":"4","key":"1069_CR14","doi-asserted-by":"crossref","first-page":"263","DOI":"10.6028\/jres.049.027","volume":"49","author":"AJ Hoffman","year":"1952","unstructured":"Hoffman, A.J.: On approximate solutions of systems of linear inequalities. J. Res. Natl. Bur. Stand. 49(4), 263\u2013265 (1952)","journal-title":"J. Res. Natl. Bur. Stand."},{"key":"1069_CR15","unstructured":"Jaggi, M.: Sparse Convex Optimization Methods for Machine Learning. Ph.D. thesis, ETH Zurich (2011)"},{"key":"1069_CR16","unstructured":"Lacoste-Julien, S., Jaggi, M.: An affine invariant linear convergence analysis for Frank-Wolfe algorithms. In: NIPS 2013 Workshop on Greedy Algorithms, Frank-Wolfe and Friends (2014)"},{"key":"1069_CR17","unstructured":"Lacoste-Julien, S., Jaggi, M.: On the global linear convergence of frank-wolfe optimization variants. In: Advances in Neural Information Processing Systems, pp. 496\u2013504 (2015)"},{"issue":"5","key":"1069_CR18","doi-asserted-by":"crossref","first-page":"787","DOI":"10.1016\/0041-5553(66)90114-5","volume":"6","author":"E Levitin","year":"1966","unstructured":"Levitin, E., Polyak, B.T.: Constrained minimization methods. USSR Comput. Math. Math. Phys. 6(5), 787\u2013823 (1966)","journal-title":"USSR Comput. Math. Math. Phys."},{"key":"1069_CR19","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-8853-9","volume-title":"Introductory Lectures on Convex Optimization: A Basic Course","author":"Y Nesterov","year":"2004","unstructured":"Nesterov, Y.: Introductory Lectures on Convex Optimization: A Basic Course, vol. 87. Springer, Berlin (2004)"},{"key":"1069_CR20","unstructured":"Pena, J., Rodriguez, D.: Polytope conditioning and linear convergence of the frank-wolfe algorithm. arXiv preprint; arXiv:1512.06142 (2015)"},{"issue":"1","key":"1069_CR21","first-page":"157","volume":"46\u201347","author":"ZQ Luo","year":"1993","unstructured":"Luo, Z.Q., Tseng, P.: Error bounds and convergence analysis of feasible descent methods: a general approach. Ann. Oper. Res. 46\u201347(1), 157\u2013178 (1993)","journal-title":"Ann. Oper. Res."},{"key":"1069_CR22","doi-asserted-by":"crossref","DOI":"10.1515\/9781400873173","volume-title":"Convex Analysis","author":"RT Rockafellar","year":"1970","unstructured":"Rockafellar, R.T.: Convex Analysis, 2nd edn. Princeton University Press, Princeton (1970)","edition":"2"},{"key":"1069_CR23","first-page":"1523","volume":"15","author":"P-W Wang","year":"2014","unstructured":"Wang, P.-W., Lin, C.-J.: Iteration complexity of feasible descent methods for convex optimization. J. Mach. Learn. Res. 15, 1523\u20131548 (2014)","journal-title":"J. Mach. Learn. Res."},{"key":"1069_CR24","unstructured":"Wolfe, P.: Chapter 1:Convergence Theory in Nonlinear Programming. In: Abadie J. (ed.) Integer and nonlinear programming, pp. 1\u201336. North-Holland Publishing Company, Amsterdam (1970)"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-016-1069-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-016-1069-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-016-1069-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,13]],"date-time":"2019-09-13T16:46:05Z","timestamp":1568393165000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-016-1069-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,9,21]]},"references-count":24,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2017,7]]}},"alternative-id":["1069"],"URL":"https:\/\/doi.org\/10.1007\/s10107-016-1069-4","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,9,21]]}}}