{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,23]],"date-time":"2026-06-23T21:02:01Z","timestamp":1782248521743,"version":"3.54.5"},"reference-count":57,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2025,6,28]],"date-time":"2025-06-28T00:00:00Z","timestamp":1751068800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,6,28]],"date-time":"2025-06-28T00:00:00Z","timestamp":1751068800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Prog. Comp."],"published-print":{"date-parts":[[2025,12]]},"DOI":"10.1007\/s12532-025-00288-w","type":"journal-article","created":{"date-parts":[[2025,6,27]],"date-time":"2025-06-27T23:58:05Z","timestamp":1751068685000},"page":"731-757","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Convex mixed-integer optimization with Frank\u2013Wolfe methods"],"prefix":"10.1007","volume":"17","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0705-1356","authenticated-orcid":false,"given":"Deborah","family":"Hendrych","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8079-9603","authenticated-orcid":false,"given":"Hannah","family":"Troppens","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6284-3033","authenticated-orcid":false,"given":"Mathieu","family":"Besan\u00e7on","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7365-3000","authenticated-orcid":false,"given":"Sebastian","family":"Pokutta","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,6,28]]},"reference":[{"issue":"2","key":"288_CR1","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1287\/ijoc.2018.0857","volume":"32","author":"T Achterberg","year":"2020","unstructured":"Achterberg, T., Bixby, R.E., Gu, Z., Rothberg, E., Weninger, D.: Presolve reductions in mixed integer programming. INFORMS J. Comput. 32(2), 473\u2013506 (2020)","journal-title":"INFORMS J. Comput."},{"key":"288_CR2","doi-asserted-by":"crossref","unstructured":"Ahn, M., Gangammanavar, H., Troxell, D.: Tractable continuous approximations for constraint selection via cardinality minimization. INFORMS J. Optim. (2025)","DOI":"10.1287\/ijoo.2024.0038"},{"key":"288_CR3","unstructured":"Belotti, P.: COUENNE: a user\u2019s manual (2009)"},{"issue":"3","key":"288_CR4","doi-asserted-by":"publisher","first-page":"2340","DOI":"10.1137\/20M1346778","volume":"31","author":"D Bertsimas","year":"2021","unstructured":"Bertsimas, D., Cory-Wright, R., Pauphilet, J.: A unified approach to mixed-integer optimization problems with logical constraints. SIAM J. Optim. 31(3), 2340\u20132367 (2021)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"288_CR5","doi-asserted-by":"publisher","first-page":"813","DOI":"10.1214\/15-AOS1388","volume":"44","author":"D Bertsimas","year":"2016","unstructured":"Bertsimas, D., King, A., Mazumder, R.: Best subset selection via a modern optimization lens. Ann. Stat. 44(2), 813\u2013852 (2016)","journal-title":"Ann. Stat."},{"issue":"5","key":"288_CR6","doi-asserted-by":"publisher","first-page":"2611","DOI":"10.1287\/ijoc.2022.1191","volume":"34","author":"M Besan\u00e7on","year":"2022","unstructured":"Besan\u00e7on, M., Carderera, A., Pokutta, S.: FrankWolfe.jl: A high-performance and flexible toolbox for Frank\u2013Wolfe algorithms and conditional gradients. INFORMS J. Comput. 34(5), 2611\u20132620 (2022)","journal-title":"INFORMS J. Comput."},{"key":"288_CR7","doi-asserted-by":"crossref","unstructured":"Besan\u00e7on, M., Designolle, S., Halbey, J., Hendrych, D., Kuzinowicz, D., Pokutta, S., Troppens, H., Herrmannsdoerfer, D.V., Wirth, E.: Improved algorithms and novel applications of the FrankWolfe.jl library (2025). arXiv preprint arXiv:2501.14613","DOI":"10.1145\/3765626"},{"key":"288_CR8","unstructured":"Bestuzheva, K., Besan\u00e7on, M., Chen, W.K., Chmiela, A., Donkiewicz, T., van Doornmalen, J., Eifler, L., Gaul, O., Gamrath, G., Gleixner, A., et\u00a0al.: The SCIP optimization suite 8.0 (2021). arXiv preprint arXiv:2112.08872"},{"issue":"2","key":"288_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3585516","volume":"49","author":"K Bestuzheva","year":"2023","unstructured":"Bestuzheva, K., Besan\u00e7on, M., Chen, W.K., Chmiela, A., Donkiewicz, T., Van Doornmalen, J., Eifler, L., Gaul, O., Gamrath, G., Gleixner, A., et al.: Enabling research through the SCIP optimization suite 8.0. ACM Trans. Math. Softw. 49(2), 1\u201321 (2023)","journal-title":"ACM Trans. Math. Softw."},{"issue":"2","key":"288_CR10","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1016\/j.disopt.2006.10.011","volume":"5","author":"P Bonami","year":"2008","unstructured":"Bonami, P., Biegler, L.T., Conn, A.R., Cornu\u00e9jols, G., Grossmann, I.E., Laird, C.D., Lee, J., Lodi, A., Margot, F., Sawaya, N., W\u00e4chter, A.: An algorithmic framework for convex mixed integer nonlinear programs. Discrete Optim. 5(2), 186\u2013204 (2008). https:\/\/doi.org\/10.1016\/j.disopt.2006.10.011. (In Memory of George B. Dantzig)","journal-title":"Discrete Optim."},{"key":"288_CR11","unstructured":"Braun, G., Carderera, A., Combettes, C.W., Hassani, H., Karbasi, A., Mokthari, A., Pokutta, S.: Conditional gradient methods (2022). arXiv:2211.14103"},{"key":"288_CR12","unstructured":"Braun, G., Pokutta, S.: Dual prices for Frank\u2013Wolfe algorithms (2021). arXiv:2101.02087"},{"key":"288_CR13","unstructured":"Braun, G., Pokutta, S., Tu, D., Wright, S.: Blended conditional gradients. In: International Conference on Machine Learning, pp. 735\u2013743. PMLR (2019)"},{"key":"288_CR14","unstructured":"Braun, G., Pokutta, S., Zink, D.: Lazifying conditional gradient algorithms. In: International Conference on Machine Learning, pp. 566\u2013575. PMLR (2017)"},{"issue":"3","key":"288_CR15","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1007\/s10898-017-0571-4","volume":"70","author":"C Buchheim","year":"2018","unstructured":"Buchheim, C., De Santis, M., Rinaldi, F., Trieu, L.: A Frank\u2013Wolfe based branch-and-bound algorithm for mean-risk optimization. J. Glob. Optim. 70(3), 625\u2013644 (2018)","journal-title":"J. Glob. Optim."},{"issue":"3","key":"288_CR16","doi-asserted-by":"publisher","first-page":"1695","DOI":"10.1137\/140978971","volume":"26","author":"C Buchheim","year":"2016","unstructured":"Buchheim, C., Santis, M.D., Lucidi, S., Rinaldi, F., Trieu, L.: A feasible active set method with reoptimization for convex quadratic mixed-integer programming. SIAM J. Optim. 26(3), 1695\u20131714 (2016)","journal-title":"SIAM J. Optim."},{"key":"288_CR17","doi-asserted-by":"crossref","unstructured":"Byrd, R.H., Nocedal, J., Waltz, R.A.: Knitro: an integrated package for nonlinear optimization. In: Large-Scale Nonlinear Optimization, pp. 35\u201359. Springer (2006)","DOI":"10.1007\/0-387-30065-1_4"},{"key":"288_CR18","first-page":"5390","volume":"34","author":"A Carderera","year":"2021","unstructured":"Carderera, A., Besan\u00e7on, M., Pokutta, S.: Simple steps are all you need: Frank\u2013Wolfe and generalized self-concordant functions. Adv. Neural Inf. Process. Syst. 34, 5390\u20135401 (2021)","journal-title":"Adv. Neural Inf. Process. Syst."},{"issue":"3","key":"288_CR19","doi-asserted-by":"publisher","first-page":"2231","DOI":"10.1137\/23M1616789","volume":"34","author":"A Carderera","year":"2024","unstructured":"Carderera, A., Besan\u00e7on, M., Pokutta, S.: Scalable Frank\u2013Wolfe on generalized self-concordant functions via simple steps. SIAM J. Optim. 34(3), 2231\u20132258 (2024)","journal-title":"SIAM J. Optim."},{"key":"288_CR20","doi-asserted-by":"crossref","unstructured":"Chen, Y., Goulart, P.: An early termination technique for ADMM in mixed integer conic programming. In: 2022 European Control Conference (ECC), pp. 60\u201365. IEEE (2022)","DOI":"10.23919\/ECC55457.2022.9838218"},{"key":"288_CR21","unstructured":"Crama, Y., Elloumi, S., Lambert, A., Rodriguez-Heck, E.: Quadratization and convexification in polynomial binary optimization (2022). https:\/\/hal.science\/hal-03795395\/"},{"issue":"2","key":"288_CR22","doi-asserted-by":"publisher","first-page":"604","DOI":"10.1137\/S1052623494268455","volume":"8","author":"R Fletcher","year":"1998","unstructured":"Fletcher, R., Leyffer, S.: Numerical experience with lower bounds for MIQP branch-and-bound. SIAM J. Optim. 8(2), 604\u2013616 (1998)","journal-title":"SIAM J. Optim."},{"key":"288_CR23","unstructured":"Friedman, J., Hastie, T., Tibshirani, R.: A note on the group lasso and a sparse group lasso (2010). arXiv preprint arXiv:1001.0736"},{"issue":"3","key":"288_CR24","doi-asserted-by":"publisher","first-page":"594","DOI":"10.1080\/10556788.2017.1322081","volume":"33","author":"T Gally","year":"2018","unstructured":"Gally, T., Pfetsch, M.E., Ulbrich, S.: A framework for solving mixed-integer semidefinite programs. Optim. Methods Softw. 33(3), 594\u2013632 (2018)","journal-title":"Optim. Methods Softw."},{"issue":"3","key":"288_CR25","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/s13675-020-00130-z","volume":"8","author":"G Gamrath","year":"2020","unstructured":"Gamrath, G., Berthold, T., Salvagnin, D.: An exploratory computational analysis of dual degeneracy in mixed-integer programming. EURO J. Comput. Optim. 8(3), 241\u2013261 (2020)","journal-title":"EURO J. Comput. Optim."},{"key":"288_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s12532-020-00194-3","volume":"13","author":"A Gleixner","year":"2021","unstructured":"Gleixner, A., Hendel, G., Gamrath, G., Achterberg, T., Bastubbe, M., Berthold, T., Christophel, P., Jarck, K., Koch, T., Linderoth, J., et al.: MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library. Math. Program. Comput. 13, 1\u201348 (2021)","journal-title":"Math. Program. Comput."},{"key":"288_CR27","doi-asserted-by":"publisher","first-page":"731","DOI":"10.1007\/s10898-016-0450-4","volume":"67","author":"AM Gleixner","year":"2017","unstructured":"Gleixner, A.M., Berthold, T., M\u00fcller, B., Weltge, S.: Three enhancements for optimization-based bound tightening. J. Glob. Optim. 67, 731\u2013757 (2017)","journal-title":"J. Glob. Optim."},{"issue":"2","key":"288_CR28","first-page":"551","volume":"33","author":"A G\u00f3mez","year":"2021","unstructured":"G\u00f3mez, A., Prokopyev, O.A.: A mixed-integer fractional optimization approach to best subset selection. INFORMS J. Comput. 33(2), 551\u2013565 (2021)","journal-title":"INFORMS J. Comput."},{"issue":"2","key":"288_CR29","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1016\/j.disopt.2007.08.003","volume":"5","author":"M Gr\u00f6tschel","year":"2008","unstructured":"Gr\u00f6tschel, M., Nemhauser, G.L.: George Dantzig\u2019s contributions to integer programming. Discrete Optim. 5(2), 168\u2013173 (2008)","journal-title":"Discrete Optim."},{"issue":"1","key":"288_CR30","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.: Some comments on Wolfe\u2019s \u2018away step\u2019. Math. Program. 35(1), 110\u2013119 (1986)","journal-title":"Math. Program."},{"issue":"5","key":"288_CR31","doi-asserted-by":"publisher","first-page":"1517","DOI":"10.1287\/opre.2019.1919","volume":"68","author":"H Hazimeh","year":"2020","unstructured":"Hazimeh, H., Mazumder, R.: Fast best subset selection: coordinate descent and local combinatorial optimization algorithms. Oper. Res. 68(5), 1517\u20131537 (2020)","journal-title":"Oper. Res."},{"key":"288_CR32","doi-asserted-by":"publisher","unstructured":"Hendrych, D., Besan\u00e7on, M., Pokutta, S.: Solving the optimal experiment design problem with mixed-integer convex methods. In: Liberti, L. (ed.) 22nd International Symposium on Experimental Algorithms (SEA 2024), Leibniz International Proceedings in Informatics (LIPIcs), vol. 301, pp. 16:1\u201316:22. Schloss Dagstuhl\u2013Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany (2024). https:\/\/doi.org\/10.4230\/LIPIcs.SEA.2024.16. https:\/\/drops.dagstuhl.de\/entities\/document\/10.4230\/LIPIcs.SEA.2024.16","DOI":"10.4230\/LIPIcs.SEA.2024.16"},{"key":"288_CR33","doi-asserted-by":"crossref","unstructured":"Hoffman, A.J.: On approximate solutions of systems of linear inequalities. In: Selected Papers Of Alan J Hoffman: With Commentary, pp. 174\u2013176. World Scientific (2003)","DOI":"10.1142\/9789812796936_0018"},{"issue":"1","key":"288_CR34","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/s12532-017-0130-5","volume":"10","author":"Q Huangfu","year":"2018","unstructured":"Huangfu, Q., Hall, J.A.J.: Parallelizing the dual revised simplex method. Math. Program. Comput. 10(1), 119\u2013142 (2018). https:\/\/doi.org\/10.1007\/s12532-017-0130-5","journal-title":"Math. Program. Comput."},{"key":"288_CR35","doi-asserted-by":"crossref","unstructured":"Joulin, A., Tang, K., Fei-Fei, L.: Efficient image and video co-localization with Frank\u2013Wolfe algorithm. In: European Conference on Computer Vision, pp. 253\u2013268. Springer (2014)","DOI":"10.1007\/978-3-319-10599-4_17"},{"key":"288_CR36","unstructured":"JuMP-dev: Pavito, a gradient-based outer approximation solver for convex mixed-integer nonlinear programming (2018). https:\/\/github.com\/jump-dev\/Pavito.jl"},{"issue":"3","key":"288_CR37","doi-asserted-by":"publisher","first-page":"799","DOI":"10.1007\/s10957-021-01989-7","volume":"192","author":"T Kerdreux","year":"2022","unstructured":"Kerdreux, T., d\u2019Aspremont, A., Pokutta, S.: Restarting Frank\u2013Wolfe: faster rates under H\u00f6lderian error bounds. J. Optim. Theory Appl. 192(3), 799\u2013829 (2022)","journal-title":"J. Optim. Theory Appl."},{"issue":"3","key":"288_CR38","doi-asserted-by":"publisher","first-page":"540","DOI":"10.1080\/10556788.2017.1350178","volume":"33","author":"MR K\u0131l\u0131n\u00e7","year":"2018","unstructured":"K\u0131l\u0131n\u00e7, M.R., Sahinidis, N.V.: Exploiting integrality in the global optimization of mixed-integer nonlinear programming problems with BARON. Optim. Methods Softw. 33(3), 540\u2013562 (2018)","journal-title":"Optim. Methods Softw."},{"issue":"2","key":"288_CR39","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/s11081-018-9411-8","volume":"20","author":"J Kronqvist","year":"2019","unstructured":"Kronqvist, J., Bernal, D.E., Lundell, A., Grossmann, I.E.: A review and comparison of solvers for convex MINLP. Optim. Eng. 20(2), 397\u2013455 (2019)","journal-title":"Optim. Eng."},{"issue":"2","key":"288_CR40","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/s10898-015-0322-3","volume":"64","author":"J Kronqvist","year":"2016","unstructured":"Kronqvist, J., Lundell, A., Westerlund, T.: The extended supporting hyperplane algorithm for convex mixed-integer nonlinear programming. J. Glob. Optim. 64(2), 249\u2013272 (2016)","journal-title":"J. Glob. Optim."},{"key":"288_CR41","first-page":"496","volume":"28","author":"S Lacoste-Julien","year":"2015","unstructured":"Lacoste-Julien, S., Jaggi, M.: On the global linear convergence of Frank\u2013Wolfe optimization variants. Adv. Neural Inf. Process. Syst. 28, 496\u2013504 (2015)","journal-title":"Adv. Neural Inf. Process. Syst."},{"issue":"2","key":"288_CR42","doi-asserted-by":"publisher","first-page":"672","DOI":"10.1287\/ijoc.2021.1067","volume":"34","author":"B Legat","year":"2022","unstructured":"Legat, B., Dowson, O., Garcia, J., Lubin, M.: MathOptInterface: a data structure for mathematical optimization problems. INFORMS J. Comput. 34(2), 672\u2013689 (2022)","journal-title":"INFORMS J. Comput."},{"issue":"4","key":"288_CR43","doi-asserted-by":"publisher","first-page":"1417","DOI":"10.1109\/LCSYS.2020.3038677","volume":"5","author":"J Liang","year":"2020","unstructured":"Liang, J., Di Cairano, S., Quirynen, R.: Early termination of convex QP solvers in mixed-integer programming for real-time decision making. IEEE Control Syst. Lett. 5(4), 1417\u20131422 (2020)","journal-title":"IEEE Control Syst. Lett."},{"issue":"1","key":"288_CR44","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10898-022-01128-0","volume":"84","author":"A Lundell","year":"2022","unstructured":"Lundell, A., Kronqvist, J., Westerlund, T.: The supporting hyperplane optimization toolkit for convex MINLP. J. Glob. Optim. 84(1), 1\u201341 (2022)","journal-title":"J. Glob. Optim."},{"key":"288_CR45","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/s12532-020-00196-1","volume":"13","author":"A Mahajan","year":"2021","unstructured":"Mahajan, A., Leyffer, S., Linderoth, J., Luedtke, J., Munson, T.: Minotaur: a mixed-integer nonlinear optimization toolkit. Math. Program. Comput. 13, 301\u2013338 (2021)","journal-title":"Math. Program. Comput."},{"issue":"2","key":"288_CR46","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1007\/s10898-014-0166-2","volume":"59","author":"R Misener","year":"2014","unstructured":"Misener, R., Floudas, C.A.: ANTIGONE: algorithms for continuous\/integer global optimization of nonlinear equations. J. Glob. Optim. 59(2), 503\u2013526 (2014)","journal-title":"J. Glob. Optim."},{"key":"288_CR47","first-page":"25386","volume":"34","author":"J Moondra","year":"2021","unstructured":"Moondra, J., Mortagy, H., Gupta, S.: Reusing combinatorial structure: faster iterative projections over submodular base polytopes. Adv. Neural Inf. Process. Syst. 34, 25386\u201325399 (2021)","journal-title":"Adv. Neural Inf. Process. Syst."},{"issue":"6","key":"288_CR48","doi-asserted-by":"publisher","first-page":"2968","DOI":"10.1287\/ijoc.2022.1211","volume":"34","author":"C Moreira Costa","year":"2022","unstructured":"Moreira Costa, C., Kreber, D., Schmidt, M.: An alternating method for cardinality-constrained optimization: a computational study for the best subset selection and sparse portfolio problems. INFORMS J. Comput. 34(6), 2968\u20132988 (2022)","journal-title":"INFORMS J. Comput."},{"key":"288_CR49","unstructured":"Nair, V., Bartunov, S., Gimeno, F., von Glehn, I., Lichocki, P., Lobov, I., O\u2019Donoghue, B., Sonnerat, N., Tjandraatmadja, C., Wang, P., et\u00a0al.: Solving mixed integer programs using neural networks (2020). arXiv preprint arXiv:2012.13349"},{"issue":"2","key":"288_CR50","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/0041-5553(85)90100-4","volume":"25","author":"AS Nemirovskii","year":"1985","unstructured":"Nemirovskii, A.S., Nesterov, Y.: Optimal methods of smooth convex minimization. USSR Comput. Math. Math. Phys. 25(2), 21\u201330 (1985)","journal-title":"USSR Comput. Math. Math. Phys."},{"issue":"1","key":"288_CR51","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1365\/s13291-023-00275-x","volume":"126","author":"S Pokutta","year":"2024","unstructured":"Pokutta, S.: The Frank-Wolfe algorithm: a short introduction. Jahresber. Deutsch. Math. Verein. 126(1), 3\u201335 (2024)","journal-title":"Jahresber. Deutsch. Math. Verein."},{"key":"288_CR52","unstructured":"Polyak, B.T.: Sharp minima. Institute of control sciences lecture notes, Moscow, USSR, 1979. In: IIASA Workshop on Generalized Lagrangians and Their Applications, IIASA, Laxenburg, Austria (1979)"},{"issue":"10\u201311","key":"288_CR53","doi-asserted-by":"publisher","first-page":"937","DOI":"10.1016\/0098-1354(92)80028-8","volume":"16","author":"I Quesada","year":"1992","unstructured":"Quesada, I., Grossmann, I.E.: An LP\/NLP based branch and bound algorithm for convex MINLP optimization problems. Comput. Chem. Eng. 16(10\u201311), 937\u2013947 (1992)","journal-title":"Comput. Chem. Eng."},{"key":"288_CR54","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/BF00138693","volume":"8","author":"NV Sahinidis","year":"1996","unstructured":"Sahinidis, N.V.: BARON: a general purpose global optimization software package. J. Glob. Optim. 8, 201\u2013205 (1996)","journal-title":"J. Glob. Optim."},{"key":"288_CR55","unstructured":"Sharma, K., Hendrych, D., Besan\u00e7on, M., Pokutta, S.: Network design for the traffic assignment problem with mixed-integer Frank\u2013Wolfe. In: Proceedings of the INFORMS Optimization Society Conference (2024)"},{"key":"288_CR56","unstructured":"Tsuji, K.K., Tanaka, K., Pokutta, S.: Pairwise conditional gradients without swap steps and sparser kernel herding. In: International Conference on Machine Learning, pp. 21864\u201321883. PMLR (2022)"},{"key":"288_CR57","doi-asserted-by":"publisher","unstructured":"ZIB-IOL: Boscia.jl (2024). https:\/\/doi.org\/10.5281\/zenodo.12701239","DOI":"10.5281\/zenodo.12701239"}],"container-title":["Mathematical Programming Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-025-00288-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12532-025-00288-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-025-00288-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T01:54:05Z","timestamp":1761616445000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12532-025-00288-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,28]]},"references-count":57,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2025,12]]}},"alternative-id":["288"],"URL":"https:\/\/doi.org\/10.1007\/s12532-025-00288-w","relation":{},"ISSN":["1867-2949","1867-2957"],"issn-type":[{"value":"1867-2949","type":"print"},{"value":"1867-2957","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,6,28]]},"assertion":[{"value":"16 April 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 April 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 June 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}