{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,15]],"date-time":"2025-10-15T10:36:24Z","timestamp":1760524584893,"version":"3.37.3"},"reference-count":47,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2024,2,3]],"date-time":"2024-02-03T00:00:00Z","timestamp":1706918400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,2,3]],"date-time":"2024-02-03T00:00:00Z","timestamp":1706918400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11901414","11871359"],"award-info":[{"award-number":["11901414","11871359"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000923","name":"Australian Research Council","doi-asserted-by":"crossref","award":["DP190100555","DP210101025"],"award-info":[{"award-number":["DP190100555","DP210101025"]}],"id":[{"id":"10.13039\/501100000923","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Hong Kong Research Grants Council","award":["PolyU153004\/18p","12201389"],"award-info":[{"award-number":["PolyU153004\/18p","12201389"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2024,11]]},"DOI":"10.1007\/s10107-023-02055-y","type":"journal-article","created":{"date-parts":[[2024,2,3]],"date-time":"2024-02-03T12:01:52Z","timestamp":1706961712000},"page":"717-761","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Frank\u2013Wolfe-type methods for a class of nonconvex inequality-constrained problems"],"prefix":"10.1007","volume":"208","author":[{"given":"Liaoyuan","family":"Zeng","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4452-196X","authenticated-orcid":false,"given":"Yongle","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Guoyin","family":"Li","sequence":"additional","affiliation":[]},{"given":"Ting Kei","family":"Pong","sequence":"additional","affiliation":[]},{"given":"Xiaozhou","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,2,3]]},"reference":[{"key":"2055_CR1","doi-asserted-by":"publisher","first-page":"822","DOI":"10.1080\/01630563.2019.1704780","volume":"41","author":"MV Balashov","year":"2020","unstructured":"Balashov, M.V., Polyak, B.T., Tremba, A.A.: Gradient projection and conditional gradient methods for constrained nonconvex minimization. Numer. Funct. Anal. Optim. 41, 822\u2013849 (2020)","journal-title":"Numer. Funct. Anal. Optim."},{"key":"2055_CR2","volume-title":"Nonlinear Programming","author":"DP Bertsekas","year":"1999","unstructured":"Bertsekas, D.P.: Nonlinear Programming, 2nd edn. Athena Scientific, Nashua (1999)","edition":"2"},{"key":"2055_CR3","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1016\/j.laa.2005.07.021","volume":"415","author":"M Brand","year":"2006","unstructured":"Brand, M.: Fast low-rank modifications of the thin singular value decomposition. Linear Algebra Appl. 415, 20\u201330 (2006)","journal-title":"Linear Algebra Appl."},{"key":"2055_CR4","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/s10288-021-00493-y","volume":"19","author":"IM Bomze","year":"2021","unstructured":"Bomze, I.M., Rinaldi, F., Zeffiro, D.: Frank\u2013Wolfe and friends: a journey into projection-free first-order optimization methods. 4OR Q. J. Oper. Res. 19, 313\u2013345 (2021)","journal-title":"4OR Q. J. Oper. Res."},{"key":"2055_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-31256-9","volume-title":"Convex Analysis and Nonlinear Optimization","author":"JM Borwein","year":"2006","unstructured":"Borwein, J.M., Lewis, A.S.: Convex Analysis and Nonlinear Optimization, 2nd edn. Springer, Berlin (2006)","edition":"2"},{"key":"2055_CR6","volume-title":"Techniques of Variational Analysis","author":"JM Borwein","year":"2004","unstructured":"Borwein, J.M., Zhu, Q.J.: Techniques of Variational Analysis. Springer, Berlin (2004)"},{"key":"2055_CR7","doi-asserted-by":"publisher","first-page":"805","DOI":"10.1007\/s10208-012-9135-7","volume":"12","author":"V Chandrasekaran","year":"2012","unstructured":"Chandrasekaran, V., Recht, B., Parrilo, P.A., Willsky, A.S.: The convex algebraic geometry of linear inverse problems. Found. Comput. Math. 12, 805\u2013849 (2012)","journal-title":"Found. Comput. Math."},{"key":"2055_CR8","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611971309","volume-title":"Optimization and Nonsmooth Analysis","author":"FH Clarke","year":"1990","unstructured":"Clarke, F.H.: Optimization and Nonsmooth Analysis. SIAM, Philadelphia (1990)"},{"key":"2055_CR9","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1007\/s10957-020-01716-8","volume":"186","author":"Y Cui","year":"2020","unstructured":"Cui, Y., Chang, T., Hong, M., Pang, J.S.: A study of piecewise linear-quadratic programs. J. Optim. Theory Appl. 186, 523\u2013553 (2020)","journal-title":"J. Optim. Theory Appl."},{"key":"2055_CR10","doi-asserted-by":"publisher","first-page":"3344","DOI":"10.1137\/18M117337X","volume":"28","author":"Y Cui","year":"2018","unstructured":"Cui, Y., Pang, J.S., Sen, B.: Composite difference-max programs for modern statistical estimation problems. SIAM J. Optim. 28, 3344\u20133374 (2018)","journal-title":"SIAM J. Optim."},{"key":"2055_CR11","doi-asserted-by":"publisher","first-page":"1","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, 1\u201330 (2010)","journal-title":"ACM Trans. Algorithms"},{"key":"2055_CR12","volume-title":"Approximate Methods in Optimization Problems","author":"VF Demyanov","year":"1970","unstructured":"Demyanov, V.F., Rubinov, A.M.: Approximate Methods in Optimization Problems. Elsevier, Amsterdam (1970)"},{"key":"2055_CR13","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. Logist. Q. 3, 95\u2013110 (1956)","journal-title":"Nav. Res. Logist. Q."},{"key":"2055_CR14","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1137\/15M104726X","volume":"27","author":"RM Freund","year":"2017","unstructured":"Freund, R.M., Grigas, P., Mazumder, R.: An extended Frank\u2013Wolfe method with \u201cin-face\u2019\u2019 directions, and its application to low-rank matrix completion. SIAM J. Optim. 27, 319\u2013346 (2017)","journal-title":"SIAM J. Optim."},{"key":"2055_CR15","doi-asserted-by":"publisher","first-page":"1493","DOI":"10.1137\/140985366","volume":"26","author":"D Garber","year":"2016","unstructured":"Garber, D., Hazan, E.: A linearly convergent variant of the the conditional gradient algorithm under strong convexity with application to online and stochastic optimization. SIAM J. Optim. 26, 1493\u20131528 (2016)","journal-title":"SIAM J. Optim."},{"key":"2055_CR16","first-page":"1","volume":"29","author":"D Garber","year":"2016","unstructured":"Garber, D., Meshi, O.: Linear-memory and decomposition-invariant linearly convergent conditional gradient algorithm for structured polytopes. NeurIPS 29, 1 (2016)","journal-title":"NeurIPS"},{"key":"2055_CR17","doi-asserted-by":"publisher","first-page":"709","DOI":"10.1090\/S0002-9904-1964-11178-2","volume":"70","author":"AA Goldstein","year":"1964","unstructured":"Goldstein, A.A.: Convex programming in Hilbert space. Bull. Am. Math. Soc. 70, 709\u2013710 (1964)","journal-title":"Bull. Am. Math. Soc."},{"key":"2055_CR18","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, 110\u2013119 (1986)","journal-title":"Math. Program."},{"key":"2055_CR19","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.: Conditional gradient algorithms for norm-regularized smooth convex optimization. Math. Program. 152, 75\u2013112 (2015)","journal-title":"Math. Program."},{"key":"2055_CR20","unstructured":"Jaggi, M.: Revisiting Frank\u2013Wolfe: projection-free sparse convex optimization. In: ICML (2013)"},{"key":"2055_CR21","unstructured":"Jaggi, M., Sulovsk, M.: A simple algorithm for nuclear norm regularized problems. In: ICML (2010)"},{"key":"2055_CR22","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, 1379\u20131409 (2016)","journal-title":"SIAM J. Optim."},{"key":"2055_CR23","unstructured":"Lacoste-Julien, S., Jaggi, M.: An affine invariant linear convergence analysis for Frank\u2013Wolfe algorithms (preprint). arXiv:1312.7864"},{"key":"2055_CR24","first-page":"1","volume":"28","author":"S Lacoste-Julien","year":"2015","unstructured":"Lacoste-Julien, S., Jaggi, M.: On the global linear convergence of Frank\u2013Wolfe optimization variants. NeurIPS 28, 1 (2015)","journal-title":"NeurIPS"},{"key":"2055_CR25","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s10107-018-1235-y","volume":"169","author":"HA Le Thi","year":"2018","unstructured":"Le Thi, H.A., Pham Dinh, T.: DC programming and DCA: thirty years of developments. Math. Program. 169, 5\u201368 (2018)","journal-title":"Math. Program."},{"key":"2055_CR26","doi-asserted-by":"crossref","unstructured":"Le Thi, H.A., Pham Dinh, T.: Recent advances in DC programming and DCA. In: Nguyen, N.T., Le Thi, H.A. (eds.), Transactions on Computational Intelligence, Lecture Notes in Computer Science, vol. 8342, pp. 1\u201337. Springer, Berlin (2014)","DOI":"10.1007\/978-3-642-54455-2_1"},{"key":"2055_CR27","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., Polyak, B.T.: Constrained minimization methods. USSR Comput. Math. Math. Phys. 6, 1\u201350 (1966)","journal-title":"USSR Comput. Math. Math. Phys."},{"key":"2055_CR28","doi-asserted-by":"publisher","first-page":"767","DOI":"10.1007\/s10915-017-0463-2","volume":"74","author":"Y Lou","year":"2018","unstructured":"Lou, Y., Yan, M.: Fast L1\u2013L2 minimization via a proximal operator. J. Sci. Comput. 74, 767\u2013785 (2018)","journal-title":"J. Sci. Comput."},{"key":"2055_CR29","doi-asserted-by":"publisher","first-page":"2725","DOI":"10.1137\/18M1214342","volume":"29","author":"Z Lu","year":"2019","unstructured":"Lu, Z., Zhou, Z.: Nonmonotone enhanced proximal DC algorithms for a class of structured nonsmooth DC programming. SIAM J. Optim. 29, 2725\u20132752 (2019)","journal-title":"SIAM J. Optim."},{"key":"2055_CR30","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, 65\u201398 (2013)","journal-title":"SIAM Rev."},{"key":"2055_CR31","doi-asserted-by":"publisher","first-page":"1346","DOI":"10.1137\/16M1098929","volume":"10","author":"TH Ma","year":"2017","unstructured":"Ma, T.H., Lou, Y., Huang, T.Z.: Truncated $$ \\ell _{1-2} $$ models for sparse recovery and rank minimization. SIAM J. Imaging Sci. 10, 1346\u20131380 (2017)","journal-title":"SIAM J. Imaging Sci."},{"key":"2055_CR32","doi-asserted-by":"publisher","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. Springer, Berlin (2004)"},{"key":"2055_CR33","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1287\/moor.2016.0795","volume":"42","author":"JS Pang","year":"2017","unstructured":"Pang, J.S., Razaviyayn, M., Alvarado, A.: Computing B-stationary points of nonsmooth DC programs. Math. Oper. Res. 42, 95\u2013118 (2017)","journal-title":"Math. Oper. Res."},{"key":"2055_CR34","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1287\/moor.23.2.339","volume":"23","author":"G Pataki","year":"1998","unstructured":"Pataki, G.: On the rank of extreme matrices in semi-definite programs and the multiplicity of optimal eigenvalues. Math. Oper. Res. 23, 339\u2013358 (1998)","journal-title":"Math. Oper. Res."},{"key":"2055_CR35","unstructured":"Pedregosa, F., Negiar, G., Askari, A., Jaggi, M.: Linearly convergent Frank\u2013Wolfe with backtracking line-search. In: AISTATS (2020)"},{"key":"2055_CR36","unstructured":"Rao, N., Recht, B., Nowak, R.: Universal measurement bounds for structured sparse signal recovery. In: AISTATS (2012)"},{"key":"2055_CR37","unstructured":"Razaviyayn, M.: Successive Convex Approximation: Analysis and Applications. Ph.D. Dissertation, University of Minnesota (2014)"},{"key":"2055_CR38","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1137\/070697835","volume":"52","author":"B Recht","year":"2010","unstructured":"Recht, B., Fazel, M., Parrilo, P.: Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization. SIAM Rev. 52, 471\u2013501 (2010)","journal-title":"SIAM Rev."},{"key":"2055_CR39","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1137\/0313015","volume":"13","author":"SM Robinson","year":"1975","unstructured":"Robinson, S.M.: An application of error bounds for convex programming in a linear space. SIAM J. Control 13, 271\u2013273 (1975)","journal-title":"SIAM J. Control"},{"key":"2055_CR40","doi-asserted-by":"publisher","DOI":"10.1515\/9781400873173","volume-title":"Convex Analysis","author":"RT Rockafellar","year":"1970","unstructured":"Rockafellar, R.T.: Convex Analysis. Princeton University Press, Princeton (1970)"},{"key":"2055_CR41","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02431-3","volume-title":"Variational Analysis","author":"RT Rockafellar","year":"1998","unstructured":"Rockafellar, R.T., Wets, R.J.-B.: Variational Analysis. Springer, Berlin (1998)"},{"key":"2055_CR42","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-2809-5","volume-title":"Convex Analysis and Global Optimization","author":"H Tuy","year":"1998","unstructured":"Tuy, H.: Convex Analysis and Global Optimization. Springer, Berlin (1998)"},{"key":"2055_CR43","doi-asserted-by":"publisher","first-page":"2938","DOI":"10.1137\/20M1387869","volume":"32","author":"H Wang","year":"2022","unstructured":"Wang, H., Lu, H., Mazumder, R.: Frank\u2013Wolfe methods with an unbounded feasible region and applications to structured learning. SIAM J. Optim. 32, 2938\u20132968 (2022)","journal-title":"SIAM J. Optim."},{"key":"2055_CR44","unstructured":"Wolfe, P.: Convergence theory in nonlinear programming. In: Abadie, J. (ed.), Integer and Nonlinear Programming, pp. 1\u201336. North-Holland (1970)"},{"key":"2055_CR45","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1137\/S1064827500382579","volume":"24","author":"Q Ye","year":"2002","unstructured":"Ye, Q., Golub, G.: An inverse free preconditioned Krylov subspace method for symmetric generalized eigenvalue problems. SIAM J. Sci. Comput. 24, 312\u2013334 (2002)","journal-title":"SIAM J. Sci. Comput."},{"key":"2055_CR46","doi-asserted-by":"publisher","first-page":"A536","DOI":"10.1137\/140952363","volume":"37","author":"P Yin","year":"2015","unstructured":"Yin, P., Lou, Y., He, Q., Xin, J.: Minimization of $$\\ell _{1-2}$$ for compressed sensing. SIAM J. Sci. Comput. 37, A536\u2013A563 (2015)","journal-title":"SIAM J. Sci. Comput."},{"key":"2055_CR47","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1111\/j.1467-9868.2005.00532.x","volume":"68","author":"M Yuan","year":"2006","unstructured":"Yuan, M., Lin, Y.: Model selection and estimation in regression with grouped variables. J. R. Stat. Soc. Ser. B 68, 49\u201367 (2006)","journal-title":"J. R. Stat. Soc. Ser. B"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-023-02055-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10107-023-02055-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-023-02055-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,15]],"date-time":"2024-10-15T16:11:33Z","timestamp":1729008693000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10107-023-02055-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,2,3]]},"references-count":47,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2024,11]]}},"alternative-id":["2055"],"URL":"https:\/\/doi.org\/10.1007\/s10107-023-02055-y","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"type":"print","value":"0025-5610"},{"type":"electronic","value":"1436-4646"}],"subject":[],"published":{"date-parts":[[2024,2,3]]},"assertion":[{"value":"28 December 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 December 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 February 2024","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 there are no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}