{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T22:19:23Z","timestamp":1757456363183,"version":"3.37.3"},"reference-count":45,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2021,11,20]],"date-time":"2021-11-20T00:00:00Z","timestamp":1637366400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,11,20]],"date-time":"2021-11-20T00:00:00Z","timestamp":1637366400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DMS-1619884"],"award-info":[{"award-number":["DMS-1619884"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"crossref","award":["N00014-20-1-2088"],"award-info":[{"award-number":["N00014-20-1-2088"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2022,6]]},"DOI":"10.1007\/s10898-021-01105-z","type":"journal-article","created":{"date-parts":[[2021,11,20]],"date-time":"2021-11-20T03:02:40Z","timestamp":1637377360000},"page":"273-299","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["A Newton Frank\u2013Wolfe method for constrained self-concordant minimization"],"prefix":"10.1007","volume":"83","author":[{"given":"Deyi","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Volkan","family":"Cevher","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5866-0787","authenticated-orcid":false,"given":"Quoc","family":"Tran-Dinh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,11,20]]},"reference":[{"issue":"1","key":"1105_CR1","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1093\/imanum\/8.1.141","volume":"8","author":"J Barzilai","year":"1988","unstructured":"Barzilai, J., Borwein, J.M.: Two-point step size gradient methods. IMA J. Numer. Anal. 8(1), 141\u2013148 (1988)","journal-title":"IMA J. Numer. Anal."},{"key":"1105_CR2","doi-asserted-by":"crossref","unstructured":"Bauschke, H.H., Combettes, P.: Convex Analysis and Monotone Operators Theory in Hilbert Spaces. Springer-Verlag, 2nd edn. (2017)","DOI":"10.1007\/978-3-319-48311-5_20"},{"issue":"2","key":"1105_CR3","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."},{"issue":"1","key":"1105_CR4","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1137\/080716542","volume":"2","author":"A Beck","year":"2009","unstructured":"Beck, A., Teboulle, M.: A fast iterative shrinkage-thresholding algorithm for linear inverse problems. SIAM J. Imaging Sci. 2(1), 183\u2013202 (2009)","journal-title":"SIAM J. Imaging Sci."},{"issue":"3","key":"1105_CR5","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/s12532-011-0029-5","volume":"3","author":"S Becker","year":"2011","unstructured":"Becker, S., Cand\u00e8s, E.J., Grant, M.: Templates for convex cone problems with applications to sparse signal recovery. Math. Program. Compt. 3(3), 165\u2013218 (2011)","journal-title":"Math. Program. Compt."},{"issue":"4","key":"1105_CR6","doi-asserted-by":"publisher","first-page":"1196","DOI":"10.1137\/S1052623497330963","volume":"10","author":"EG Birgin","year":"2000","unstructured":"Birgin, E.G., Mart\u00ednez, J.M., Raydan, M.: Nonmonotone spectral projected gradient methods on convex sets. SIAM J. Optim. 10(4), 1196\u20131211 (2000)","journal-title":"SIAM J. Optim."},{"key":"1105_CR7","unstructured":"Chen, Y., Ye, X.: Projection onto a simplex. Preprint arXiv:1101.6081 (2011)"},{"issue":"3","key":"1105_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1961189.1961199","volume":"2","author":"C-C Chang","year":"2011","unstructured":"Chang, C.-C., Lin, C.-J.: LIBSVM, A library for support vector machines. ACM Trans. Intell. Syst. Technol. 2(3), 1\u201327 (2011)","journal-title":"ACM Trans. Intell. Syst. Technol."},{"issue":"1","key":"1105_CR9","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1080\/10556780701589669","volume":"23","author":"SA Damla","year":"2008","unstructured":"Damla, S.A., Sun, P., Todd, M.J.: Linear convergence of a modified Frank\u2013Wolfe algorithm for computing minimum-volume enclosing ellipsoids. Optim. Methods Softw. 23(1), 5\u201319 (2008)","journal-title":"Optim. Methods Softw."},{"key":"1105_CR10","unstructured":"Defazio, A., Bach, F., Lacoste-Julien, S.: SAGA: A fast incremental gradient method with support for non-strongly convex composite objectives. In Advances in Neural Information Processing Systems (NIPS), pp. 1646\u20131654 (2014)"},{"key":"1105_CR11","doi-asserted-by":"crossref","unstructured":"de Oliveira, F.R., Ferreira, O.P., Silva, G.N.: Newton\u2019s method with feasible inexact projections for solving constrained generalized equations. Comput. Optim. Appl. 72(1), 159\u2013177 (2019)","DOI":"10.1007\/s10589-018-0040-0"},{"key":"1105_CR12","doi-asserted-by":"crossref","unstructured":"Duchi, J., Shalev-Shwartz, S., Singer, Y., Chandra, T.: Efficient projections onto the $$\\ell _1$$-ball for learning in high dimensions. In Proceedings of the 25th International Conference on Machine Learning, ICML \u201908, pp. 272\u2013279, New York, NY, USA, ACM (2008)","DOI":"10.1145\/1390156.1390191"},{"key":"1105_CR13","unstructured":"Dvurechensky, P., Ostroukhov, P., Safin, K., Shtern, S., Staudigl, M.: Self-concordant analysis of Frank-Wolfe algorithms. In International Conference on Machine Learning, pp. 2814\u20132824. PMLR, (2020)"},{"key":"1105_CR14","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. Naval Res. Logist. Q. 3, 95\u2013110 (1956)","journal-title":"Naval Res. Logist. Q."},{"key":"1105_CR15","unstructured":"Garber, D., Hazan, E.: A linearly convergent conditional gradient algorithm with applications to online and stochastic optimization. Preprint arXiv:1301.4666 (2013)"},{"key":"1105_CR16","unstructured":"Garber, D., Hazan, E.: Faster rates for the Frank\u2013Wolfe method over strongly-convex sets. In Proceedings of the 32nd International Conference on Machine Learning 951, pp. 541\u2013549 (2015)"},{"key":"1105_CR17","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."},{"key":"1105_CR18","doi-asserted-by":"crossref","unstructured":"Gon\u00e7alves, D.\u00a0S., Gon\u00e7alves, M.\u00a0L.\u00a0N., Menezes, T.\u00a0C.: Inexact variable metric method for convex-constrained optimization problems. Optimization, 1\u201319, (online first) (2021)","DOI":"10.1080\/02331934.2021.1887181"},{"key":"1105_CR19","unstructured":"Gon\u00e7alves, D.\u00a0S., Gon\u00e7alves, M.\u00a0L.\u00a0N., Oliveira, F.\u00a0R.: Levenberg-marquardt methods with inexact projections for constrained nonlinear systems. Preprint arXiv:1908.06118 (2019)"},{"issue":"2","key":"1105_CR20","doi-asserted-by":"publisher","first-page":"606","DOI":"10.1007\/s11075-019-00772-0","volume":"84","author":"MLN Gon\u00e7alves","year":"2020","unstructured":"Gon\u00e7alves, M.L.N., Oliveira, F.R.: On the global convergence of an inexact quasi-Newton conditional gradient method for constrained nonlinear systems. Numer. Algorithm 84(2), 606\u2013631 (2020)","journal-title":"Numer. Algorithm"},{"issue":"15","key":"1105_CR21","doi-asserted-by":"publisher","first-page":"150401","DOI":"10.1103\/PhysRevLett.105.150401","volume":"105","author":"D Gross","year":"2010","unstructured":"Gross, D., Liu, Y.-K., Flammia, S., Becker, S., Eisert, J.: Quantum state tomography via compressed sensing. Phys. Rev. Lett. 105(15), 150401 (2010)","journal-title":"Phys. Rev. Lett."},{"key":"1105_CR22","doi-asserted-by":"crossref","unstructured":"Guelat, J., Marcotte, P.: Some comments on Wolfe\u2019s away step. Math. Program. 35(1), 110\u2013119 (1986)","DOI":"10.1007\/BF01589445"},{"issue":"6","key":"1105_CR23","doi-asserted-by":"publisher","first-page":"693","DOI":"10.2478\/s12175-009-0157-9","volume":"59","author":"R Harman","year":"2009","unstructured":"Harman, R., Trnovsk\u00e1, M.: Approximate D-optimal designs of experiments on the convex hull of a finite set of information matrices. Math. Slov. 59(6), 693\u2013704 (2009)","journal-title":"Math. Slov."},{"key":"1105_CR24","doi-asserted-by":"crossref","unstructured":"Hastie, T., Tibshirani, R., Friedman, J.: The Elements of Statistical Learning: Data Mining, Inference, and Prediction. Springer Science & Business Media (2009)","DOI":"10.1007\/978-0-387-84858-7"},{"key":"1105_CR25","doi-asserted-by":"crossref","unstructured":"Hazan, E.: Sparse approximate solutions to semidefinite programs. In: Latin American Symposium on Theoretical Informatics, pp. 306\u2013316. Springer (2008)","DOI":"10.1007\/978-3-540-78773-0_27"},{"issue":"1","key":"1105_CR26","first-page":"427","volume":"28","author":"M Jaggi","year":"2013","unstructured":"Jaggi, M.: Revisiting Frank\u2013Wolfe: projection-free sparse convex optimization. JMLR W&CP 28(1), 427\u2013435 (2013)","journal-title":"JMLR W&CP"},{"issue":"2","key":"1105_CR27","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1287\/moor.21.2.307","volume":"21","author":"LG Khachiyan","year":"1996","unstructured":"Khachiyan, L.G.: Rounding of polytopes in the real number model of computation. Math. Oper. Res. 21(2), 307\u2013320 (1996)","journal-title":"Math. Oper. Res."},{"key":"1105_CR28","unstructured":"Lacoste-Julien, S., Jaggi, M.: On the global linear convergence of Frank\u2013Wolfe optimization variants. In Advances in Neural Information Processing Systems (NIPS), pp. 496\u2013504 (2015)"},{"issue":"2","key":"1105_CR29","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":"1105_CR30","unstructured":"Lan, G., Ouyang, Y.: Accelerated gradient sliding for structured convex optimization. Preprint arXiv:1609.04905 (2016)"},{"issue":"4","key":"1105_CR31","doi-asserted-by":"publisher","first-page":"1556","DOI":"10.1137\/120895093","volume":"34","author":"Z Lu","year":"2013","unstructured":"Lu, Z., Pong, T.K.: Computing optimal experimental designs via interior point method. SIAM J. Matrix Anal. Appl. 34(4), 1556\u20131580 (2013)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"1105_CR32","doi-asserted-by":"crossref","unstructured":"Nesterov, Y.: Introductory Lectures on Convex Optimization: A Basic Course volume 87 of Applied Optimization. Kluwer Academic Publishers (2004)","DOI":"10.1007\/978-1-4419-8853-9"},{"key":"1105_CR33","doi-asserted-by":"crossref","unstructured":"Nesterov, Y., Nemirovski, A.: Interior-point polynomial algorithms in convex programming. Soc. Ind. Math. (1994)","DOI":"10.1137\/1.9781611970791"},{"key":"1105_CR34","doi-asserted-by":"crossref","unstructured":"Odor, G., Li, Y.-H., Yurtsever, A., Hsieh, Y.-P., Tran-Dinh, Q., El-Halabi, M., Cevher, V.: Frank-Wolfe works for non-lipschitz continuous gradient objectives: Scalable poisson phase retrieval. In 2016 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), pp. 6230\u20136234. IEEE (2016)","DOI":"10.1109\/ICASSP.2016.7472875"},{"issue":"1","key":"1105_CR35","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1214\/20-EJS1780","volume":"15","author":"DM Ostrovskii","year":"2021","unstructured":"Ostrovskii, D.M., Bach, F.: Finite-sample analysis of M-estimators using self-concordance. Electron. J. Stat. 15(1), 326\u2013391 (2021)","journal-title":"Electron. J. Stat."},{"issue":"5\u20136","key":"1105_CR36","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1561\/2200000073","volume":"11","author":"G Peyr\u00e9","year":"2019","unstructured":"Peyr\u00e9, G., Cuturi, M.: Computational optimal transport. Found. Trends Mach. Learn. 11(5\u20136), 355\u2013607 (2019)","journal-title":"Found. Trends Mach. Learn."},{"key":"1105_CR37","unstructured":"Ryu, E.\u00a0K., Boyd, S.: Stochastic proximal iteration: a non-asymptotic improvement upon stochastic gradient descent. Author website, early draft (2014)"},{"issue":"3","key":"1105_CR38","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1093\/imanum\/13.3.321","volume":"13","author":"M Raydan","year":"1993","unstructured":"Raydan, M.: On the Barzilai and Borwein choice of steplength for the gradient method. IMA J. Numer. Anal. 13(3), 321\u2013326 (1993)","journal-title":"IMA J. Numer. Anal."},{"key":"1105_CR39","unstructured":"Su, W., Boyd, S., Candes, E.: A differential equation for modeling Nesterov\u2019s accelerated gradient method: theory and insights. In Advances in Neural Information Processing Systems (NIPS), pp. 2510\u20132518 (2014)"},{"key":"1105_CR40","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/s10107-018-1282-4","volume":"178","author":"T Sun","year":"2019","unstructured":"Sun, T., Tran-Dinh, Q.: Generalized self-concordant functions: a recipe for Newton-type methods. Math. Program. 178, 145\u2013213 (2019)","journal-title":"Math. Program."},{"key":"1105_CR41","first-page":"374","volume":"15","author":"Q Tran-Dinh","year":"2015","unstructured":"Tran-Dinh, Q., Kyrillidis, A., Cevher, V.: Composite self-concordant minimization. J. Mach. Learn. Res. 15, 374\u2013416 (2015)","journal-title":"J. Mach. Learn. Res."},{"key":"1105_CR42","doi-asserted-by":"crossref","unstructured":"Tran-Dinh, Q., Ling, L., Toh, K.-C.: A new homotopy proximal variable-metric framework for composite convex minimization. Math. Oper. Res., 1\u201328, (online first) (2021)","DOI":"10.1287\/moor.2021.1138"},{"issue":"1\u20132","key":"1105_CR43","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/s10107-018-1264-6","volume":"177","author":"Q Tran-Dinh","year":"2019","unstructured":"Tran-Dinh, Q., Sun, T., Lu, S.: Self-concordant inclusions: a unified framework for path-following generalized Newton-type algorithms. Math. Program. 177(1\u20132), 173\u2013223 (2019)","journal-title":"Math. Program."},{"key":"1105_CR44","unstructured":"Yurtsever, A., Fercoq, O., Cevher, V.: A conditional-gradient-based augmented lagrangian framework. In International Conference on Machine Learning (ICML), pp. 7272\u20137281 (2019)"},{"key":"1105_CR45","unstructured":"Yurtsever, A., Tran-Dinh, Q., Cevher, V.: A universal primal-dual convex optimization framework. Advances in Neural Information Processing Systems (NIPS), pp. 1\u20139 (2015)"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-021-01105-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10898-021-01105-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-021-01105-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,23]],"date-time":"2022-05-23T04:21:25Z","timestamp":1653279685000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10898-021-01105-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,11,20]]},"references-count":45,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,6]]}},"alternative-id":["1105"],"URL":"https:\/\/doi.org\/10.1007\/s10898-021-01105-z","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"type":"print","value":"0925-5001"},{"type":"electronic","value":"1573-2916"}],"subject":[],"published":{"date-parts":[[2021,11,20]]},"assertion":[{"value":"30 June 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 October 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 November 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}