{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,26]],"date-time":"2024-07-26T21:57:27Z","timestamp":1722031047288},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,6,24]],"date-time":"2021-06-24T00:00:00Z","timestamp":1624492800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,6,24]],"date-time":"2021-06-24T00:00:00Z","timestamp":1624492800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00ecfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["302473\/2017-3"],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100005285","name":"FAPEG","doi-asserted-by":"crossref","award":["201710267000532"],"id":[{"id":"10.13039\/501100005285","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100003593","name":"CNPq","doi-asserted-by":"crossref","award":["305158\/2014-7","302473\/2017-3"],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"crossref"}]},{"name":"FAPEG\/PRONEM","award":["201710267000532"]},{"DOI":"10.13039\/501100003593","name":"CNPq","doi-asserted-by":"crossref","award":["424860\/2018-0","309628\/2020-2"],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100005285","name":"FAPEG","doi-asserted-by":"crossref","award":["PPP03\/15-201810267001725"],"id":[{"id":"10.13039\/501100005285","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2021,9]]},"DOI":"10.1007\/s10589-021-00293-4","type":"journal-article","created":{"date-parts":[[2021,6,24]],"date-time":"2021-06-24T20:02:16Z","timestamp":1624564936000},"page":"245-269","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Alternating conditional gradient method for convex feasibility problems"],"prefix":"10.1007","volume":"80","author":[{"given":"R.","family":"D\u00edaz Mill\u00e1n","sequence":"first","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0002-5758-0320","authenticated-orcid":false,"given":"O. P.","family":"Ferreira","sequence":"additional","affiliation":[]},{"given":"L. F.","family":"Prudente","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,6,24]]},"reference":[{"issue":"2","key":"293_CR1","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/BF01027691","volume":"1","author":"HH Bauschke","year":"1993","unstructured":"Bauschke, H.H., Borwein, J.M.: On the convergence of von Neumann\u2019s alternating projection algorithm for two sets. Set-Valued Anal. 1(2), 185\u2013212 (1993)","journal-title":"Set-Valued Anal."},{"issue":"3","key":"293_CR2","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1006\/jath.1994.1136","volume":"79","author":"HH Bauschke","year":"1994","unstructured":"Bauschke, H.H., Borwein, J.M.: Dykstra\u2019s alternating projection algorithm for two sets. J. Approx. Theory 79(3), 418\u2013443 (1994)","journal-title":"J. Approx. Theory"},{"issue":"3","key":"293_CR3","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1137\/S0036144593251710","volume":"38","author":"HH Bauschke","year":"1996","unstructured":"Bauschke, H.H., Borwein, J.M.: On projection algorithms for solving convex feasibility problems. SIAM Rev. 38(3), 367\u2013426 (1996)","journal-title":"SIAM Rev."},{"issue":"2","key":"293_CR4","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1287\/moor.26.2.248.10558","volume":"26","author":"HH Bauschke","year":"2001","unstructured":"Bauschke, H.H., Combettes, P.L.: A weak-to-strong convergence principle for Fej\u00e9r-monotone methods in Hilbert spaces. Math. Oper. Res. 26(2), 248\u2013264 (2001)","journal-title":"Math. Oper. Res."},{"key":"293_CR5","doi-asserted-by":"crossref","unstructured":"Bauschke, H.H., Combettes, P.L.: Convex analysis and monotone operator theory in Hilbert spaces. In: CMS Books in Mathematics\/Ouvrages de Math\u00e9matiques de la SMC. Springer, New York (2011). With a foreword by H\u00e9dy Attouch","DOI":"10.1007\/978-1-4419-9467-7"},{"issue":"2","key":"293_CR6","doi-asserted-by":"publisher","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 Oper. Res. 59(2), 235\u2013247 (2004)","journal-title":"Math. Methods Oper. Res."},{"key":"293_CR7","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973365","volume-title":"Practical Augmented Lagrangian Methods for Constrained Optimization","author":"EG Birgin","year":"2014","unstructured":"Birgin, E.G., Mart\u00ednez, J.M.: Practical Augmented Lagrangian Methods for Constrained Optimization. SIAM, Philadelphia (2014)"},{"key":"293_CR8","first-page":"487","volume":"162","author":"LM Br\u00e8gman","year":"1965","unstructured":"Br\u00e8gman, L.M.: Finding the common point of convex sets by the method of successive projection. Dokl. Akad. Nauk. SSSR 162, 487\u2013490 (1965)","journal-title":"Dokl. Akad. Nauk. SSSR"},{"key":"293_CR9","unstructured":"Carderera, A., Pokutta, S.: Second-Order Conditional Gradient Sliding. arXiv e-prints, page arXiv:2002.08907 (Feb. 2020), 2002.08907"},{"issue":"2","key":"293_CR10","doi-asserted-by":"publisher","first-page":"1508","DOI":"10.1137\/17M1134986","volume":"28","author":"A Cegielski","year":"2018","unstructured":"Cegielski, A., Reich, S., Zalas, R.: Regular sequences of quasi-nonexpansive operators and their applications. SIAM J. Optim. 28(2), 1508\u20131532 (2018)","journal-title":"SIAM J. Optim."},{"issue":"11","key":"293_CR11","doi-asserted-by":"publisher","first-page":"2343","DOI":"10.1080\/02331934.2014.957701","volume":"64","author":"Y Censor","year":"2015","unstructured":"Censor, Y., Cegielski, A.: Projection methods: an annotated bibliography of books and reviews. Optimization 64(11), 2343\u20132358 (2015)","journal-title":"Optimization"},{"key":"293_CR12","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1090\/S0002-9939-1959-0105008-8","volume":"10","author":"W Cheney","year":"1959","unstructured":"Cheney, W., Goldstein, A.A.: Proximity maps for convex sets. Proc. Am. Math. Soc. 10, 448\u2013450 (1959)","journal-title":"Proc. Am. Math. Soc."},{"issue":"4","key":"293_CR13","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1145\/1824777.1824783","volume":"6","author":"KL Clarkson","year":"2010","unstructured":"Clarkson, K.L.: Coresets, sparse greedy approximation, and the Frank\u2013Wolfe algorithm. ACM Trans. Algorithms 6(4), 30 (2010)","journal-title":"ACM Trans. Algorithms"},{"issue":"2","key":"293_CR14","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1109\/5.214546","volume":"81","author":"PL Combettes","year":"1993","unstructured":"Combettes, P.L.: The foundations of set theoretic estimation. Proc. IEEE 81(2), 182\u2013208 (1993)","journal-title":"Proc. IEEE"},{"key":"293_CR15","first-page":"155","volume-title":"Advances in Imaging and Electron Physics","author":"PL Combettes","year":"1996","unstructured":"Combettes, P.L.: The convex feasibility problem in image recovery. In: Hawkes, P. (ed.) Advances in Imaging and Electron Physics, vol. 95, pp. 155\u2013270. Academic Press, New York (1996)"},{"key":"293_CR16","doi-asserted-by":"publisher","first-page":"2460","DOI":"10.1109\/78.782189","volume":"47","author":"PL Combettes","year":"1999","unstructured":"Combettes, P.L.: Hard-constrained inconsistent signal feasibility problems. EEE Trans. Sig. Process. 47, 2460\u20132468 (1999)","journal-title":"EEE Trans. Sig. Process."},{"key":"293_CR17","doi-asserted-by":"crossref","unstructured":"Combettes, P.L.: Quasi-Fej\u00e9rian analysis of some optimization algorithms. In: Inherently Parallel Algorithms in Feasibility and Optimization and Their Applications (Haifa, 2000), vol.\u00a08 of Stud. Comput. Math., pp. 115\u2013152. North-Holland, Amsterdam (2001)","DOI":"10.1016\/S1570-579X(01)80010-0"},{"key":"293_CR18","doi-asserted-by":"crossref","unstructured":"D\u00edaz Mill\u00e1n, R., Lindstrom, S.B., Roshchina, V.: Comparing averaged relaxed cutters and projection methods: theory and examples. In: Special Springer Volume Commemorating Jon Borwein, Springer Proceedings in Mathematics Statistics (to appear) (2019)","DOI":"10.1007\/978-3-030-36568-4_5"},{"issue":"3","key":"293_CR19","doi-asserted-by":"publisher","first-page":"669","DOI":"10.1007\/s10013-019-00357-3","volume":"47","author":"D Drusvyatskiy","year":"2019","unstructured":"Drusvyatskiy, D., Lewis, A.S.: Local linear convergence for inexact alternating projections on nonconvex sets. Vietnam J. Math. 47(3), 669\u2013681 (2019)","journal-title":"Vietnam J. Math."},{"issue":"5","key":"293_CR20","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1137\/0318035","volume":"18","author":"JC Dunn","year":"1980","unstructured":"Dunn, J.C.: Convergence rates for conditional gradient sequences generated by implicit step length rules. SIAM J. Control Optim. 18(5), 473\u2013487 (1980)","journal-title":"SIAM J. Control Optim."},{"key":"293_CR21","doi-asserted-by":"publisher","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. Log. 3, 95\u2013110 (1956)","journal-title":"Nav. Res. Log."},{"issue":"1\u20132, Ser. A","key":"293_CR22","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/s10107-014-0841-6","volume":"155","author":"RM Freund","year":"2016","unstructured":"Freund, R.M., Grigas, P.: New analysis and results for the Frank\u2013Wolfe method. Math. Program. 155(1\u20132, Ser. A), 199\u2013230 (2016)","journal-title":"Math. Program."},{"issue":"2","key":"293_CR23","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.: A modified Frank\u2013Wolfe algorithm for solving the traffic assignment problem. Transp. Res. Part B 18(2), 169\u2013177 (1984)","journal-title":"Transp. Res. Part B"},{"issue":"1","key":"293_CR24","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1007\/BF01589441","volume":"35","author":"M Fukushima","year":"1986","unstructured":"Fukushima, M.: A relaxed projection method for variational inequalities. Math. Program. 35(1), 58\u201370 (1986)","journal-title":"Math. Program."},{"key":"293_CR25","unstructured":"Garber, D., Hazan, E.: Faster rates for the Frank\u2013Wolfe method over strongly-convex sets. In: Proceedings of the 32nd International Conference on International Conference on Machine Learning, vol. 37, pp. 541\u2013549 (2015)"},{"key":"293_CR26","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1016\/j.cam.2016.08.009","volume":"311","author":"MLN Gon\u00e7alves","year":"2017","unstructured":"Gon\u00e7alves, M.L.N., Melo, J.G.: A Newton conditional gradient method for constrained nonlinear systems. J. Comput. Appl. Math. 311, 473\u2013483 (2017)","journal-title":"J. Comput. Appl. Math."},{"issue":"1, Ser. A","key":"293_CR27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01580719","volume":"40","author":"S-P Han","year":"1988","unstructured":"Han, S.-P.: A successive projection method. Math. Program. 40(1, Ser. A), 1\u201314 (1988)","journal-title":"Math. Program."},{"issue":"18","key":"293_CR28","doi-asserted-by":"publisher","first-page":"4868","DOI":"10.1109\/TSP.2014.2339801","volume":"62","author":"R Hesse","year":"2014","unstructured":"Hesse, R., Luke, D.R., Neumann, P.: Alternating projections and Douglas\u2013Rachford for sparse affine feasibility. IEEE Trans. Sig. Process. 62(18), 4868\u20134881 (2014)","journal-title":"IEEE Trans. Sig. Process."},{"issue":"1","key":"293_CR29","first-page":"236","volume":"44","author":"AN Iusem","year":"2019","unstructured":"Iusem, A.N., Jofr\u00e9, A., Thompson, P.: Incremental constraint projection methods for monotone stochastic variational inequalities. Math. Oper. Res. 44(1), 236\u2013263 (2019)","journal-title":"Math. Oper. Res."},{"key":"293_CR30","unstructured":"Jaggi, M.: Revisiting Frank\u2013Wolfe: projection-free sparse convex optimization. In: Proceedings of the 30th International Conference on International Conference on Machine Learning, vol. 28, ICML\u201913:I\u2013427\u2013I\u2013435, (2013)"},{"issue":"2","key":"293_CR31","doi-asserted-by":"publisher","first-page":"1379","DOI":"10.1137\/140992382","volume":"26","author":"G Lan","year":"2016","unstructured":"Lan, G., Zhou, Y.: Conditional gradient sliding for convex optimization. SIAM J. Optim. 26(2), 1379\u20131409 (2016)","journal-title":"SIAM J. Optim."},{"key":"293_CR32","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0041-5553(66)90114-5","volume":"6","author":"ES Levitin","year":"1966","unstructured":"Levitin, E.S., Poljak, B.T.: Minimization methods in the presence of constraints. USSR Comput. Math. Math. Phys. 6, 1\u201350 (1966)","journal-title":"USSR Comput. Math. Math. Phys."},{"issue":"4","key":"293_CR33","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1007\/s10208-008-9036-y","volume":"9","author":"AS Lewis","year":"2009","unstructured":"Lewis, A.S., Luke, D.R., Malick, J.: Local linear convergence for alternating and averaged nonconvex projections. Found. Comput. Math. 9(4), 485\u2013513 (2009)","journal-title":"Found. Comput. Math."},{"issue":"1","key":"293_CR34","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1137\/110839072","volume":"55","author":"R Luss","year":"2013","unstructured":"Luss, R., Teboulle, M.: Conditional gradient algorithms for rank-one matrix approximations with a sparsity constraint. SIAM Rev. 55(1), 65\u201398 (2013)","journal-title":"SIAM Rev."},{"issue":"6","key":"293_CR35","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1145\/3127497","volume":"64","author":"T Rothvoss","year":"2017","unstructured":"Rothvoss, T.: The matching polytope has exponential extension complexity. J. ACM 64(6), 19 (2017)","journal-title":"J. ACM"},{"key":"293_CR36","volume-title":"Functional Operators. II. The Geometry of Orthogonal Spaces. Annals of Mathematics Studies","author":"J von Neumann","year":"1950","unstructured":"von Neumann, J.: Functional Operators. II. The Geometry of Orthogonal Spaces. Annals of Mathematics Studies. Princeton University Press, Princeton (1950)"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-021-00293-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-021-00293-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-021-00293-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,5]],"date-time":"2023-11-05T08:46:45Z","timestamp":1699174005000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-021-00293-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,24]]},"references-count":36,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,9]]}},"alternative-id":["293"],"URL":"https:\/\/doi.org\/10.1007\/s10589-021-00293-4","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,6,24]]},"assertion":[{"value":"18 April 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 June 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 June 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}