{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,28]],"date-time":"2026-01-28T11:49:39Z","timestamp":1769600979850,"version":"3.49.0"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2019,8,22]],"date-time":"2019-08-22T00:00:00Z","timestamp":1566432000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,8,22]],"date-time":"2019-08-22T00:00:00Z","timestamp":1566432000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11401152"],"award-info":[{"award-number":["11401152"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002858","name":"China Postdoctoral Science Foundation","doi-asserted-by":"publisher","award":["2017M622991"],"award-info":[{"award-number":["2017M622991"]}],"id":[{"id":"10.13039\/501100002858","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100007224","name":"National Foundation for Science and Technology Development","doi-asserted-by":"publisher","award":["101.01-2017.325"],"award-info":[{"award-number":["101.01-2017.325"]}],"id":[{"id":"10.13039\/100007224","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2019,12]]},"DOI":"10.1007\/s10589-019-00124-7","type":"journal-article","created":{"date-parts":[[2019,8,22]],"date-time":"2019-08-22T13:02:52Z","timestamp":1566478972000},"page":"821-850","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":49,"title":["Smoothing algorithms for computing the projection onto a Minkowski sum of convex sets"],"prefix":"10.1007","volume":"74","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3381-8525","authenticated-orcid":false,"given":"Xiaolong","family":"Qin","sequence":"first","affiliation":[]},{"given":"Nguyen Thai","family":"An","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,8,22]]},"reference":[{"key":"124_CR1","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/j.jat.2019.02.001","volume":"242","author":"HH Bauschke","year":"2019","unstructured":"Bauschke, H.H., Bui, M.N., Wang, X.: On sums and convex combinations of projectors onto convex sets. J. Approx. Theory 242, 31\u201357 (2019)","journal-title":"J. Approx. Theory"},{"key":"124_CR2","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974997","volume-title":"First-Order Methods in Optimization","author":"A Beck","year":"2017","unstructured":"Beck, A.: First-Order Methods in Optimization, vol. 25. SIAM, Philadelphia (2017)"},{"key":"124_CR3","doi-asserted-by":"crossref","unstructured":"Bergen, G.: A fast and robust GJK implementation for collision detection of convex objects, Tech. report, Department of Mathematics and Computing Science, Eindhoven University of Technology (1999)","DOI":"10.1080\/10867651.1999.10487502"},{"key":"124_CR4","unstructured":"Borwein, J.M., Lewis, A.S.: Convex Analysis and Nonlinear Optimization: Theory and Examples. CMS Books in Mathematics, Canadian Mathematical Society (2000)"},{"key":"124_CR5","unstructured":"Cameron, S.: Enhancing GJK: computing minimum and penetration distances between convex polyhedra, vol. 3112\u20133117 (1997)"},{"key":"124_CR6","doi-asserted-by":"crossref","unstructured":"Chang, L., Qiao, H., Wan, A., Keane, J.: An improved Gilbert algorithm with rapid convergence. In: Proceedings of the IEEE\/RSJ International Conference on Intelligent Robots and Systems, pp. 3861\u20133866 (2006)","DOI":"10.1109\/IROS.2006.281794"},{"key":"124_CR7","unstructured":"Chen, Y., Ye,X.: Projection onto a Simplex, CoRR, abs\/1208.4873"},{"key":"124_CR8","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1007\/s10107-015-0946-6","volume":"158","author":"L Condat","year":"2016","unstructured":"Condat, L.: Fast projection onto the simplex and the $$\\ell _1$$ ball. Math. Program. 158, 575\u2013585 (2016)","journal-title":"Math. Program."},{"key":"124_CR9","doi-asserted-by":"publisher","first-page":"986","DOI":"10.1137\/040613305","volume":"16","author":"YH Dai","year":"2006","unstructured":"Dai, Y.H.: Fast algorithms for projection on an ellipsoid. SIAM J. Optim. 16, 986\u20131006 (2006)","journal-title":"SIAM J. Optim."},{"key":"124_CR10","doi-asserted-by":"publisher","first-page":"1947","DOI":"10.1137\/070706161","volume":"19","author":"A Dax","year":"2009","unstructured":"Dax, A.: A new class of minimum norm duality theorems. SIAM J. Optim. 19, 1947\u20131969 (2009)","journal-title":"SIAM J. Optim."},{"key":"124_CR11","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 (2014)"},{"key":"124_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 ACM International Conference on Machine Learning, pp. 272\u2013279 (2008)","DOI":"10.1145\/1390156.1390191"},{"key":"124_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. Naval Res. Logist. Q. 3, 95\u2013110 (1956)","journal-title":"Naval Res. Logist. Q."},{"key":"124_CR14","unstructured":"Gabidullina, Z.R.: The problem of projecting the origin of euclidean space onto the convex polyhedron, arXiv:1605.05351"},{"issue":"4","key":"124_CR15","doi-asserted-by":"publisher","first-page":"861","DOI":"10.1080\/10618600.2018.1473777","volume":"27","author":"BR Gaines","year":"2018","unstructured":"Gaines, B.R., Kim, J., Zhou, H.: Algorithms for fitting the constrained lasso. J. Comput. Graph. Stat. 27(4), 861\u2013871 (2018)","journal-title":"J. Comput. Graph. Stat."},{"key":"124_CR16","unstructured":"Garber, D., Hazan, E.: Faster rates for the frank-wolfe method over strongly-convex sets. In: ICML, 541\u2013549 (2015)"},{"key":"124_CR17","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1137\/0304007","volume":"4","author":"EG Gilbert","year":"1966","unstructured":"Gilbert, E.G.: An iterative procedure for computing the minimum of a quadratic form on a convex set. SIAM J. Control 4, 61\u201380 (1966)","journal-title":"SIAM J. Control"},{"key":"124_CR18","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1109\/56.2083","volume":"4","author":"EG Gilbert","year":"1988","unstructured":"Gilbert, E.G., Johnson, D.W., Keerthi, S.S.: A fast procedure for computing the distance between complex objects in three-dimensional space. IEEE Trans. Robot. Autom. 4, 193\u2013203 (1988)","journal-title":"IEEE Trans. Robot. Autom."},{"key":"124_CR19","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1109\/70.88117","volume":"6","author":"EG Gilbert","year":"1990","unstructured":"Gilbert, E.G., Foo, C.-P.: Computing the distance between general convex objects in three-dimensional space. IEEE Trans. Robot. Autom. 6, 53\u201361 (1990)","journal-title":"IEEE Trans. Robot. Autom."},{"key":"124_CR20","doi-asserted-by":"crossref","unstructured":"Hiriart-Urruty, J.B., Lemar\u00e9chal, C.: Convex Analysis and Minimization Algorithms, I and II, Grundlehren Math. Wiss. 305 and 306. Springer, Berlin (1993)","DOI":"10.1007\/978-3-662-02796-7"},{"key":"124_CR21","unstructured":"Jaggi, M.: Revisiting Frank\u2013Wolfe: projection-free sparse convex optimization. In: ICML, vol. 1, pp. 427\u2013435 (2013)"},{"key":"124_CR22","unstructured":"Lacoste-Julien, S., Jaggi, M.: On the global linear convergence of Frank\u2013Wolfe optimization variants. In: Advances in Neural Information Processing Systems, pp. 496\u2013504 (2015)"},{"key":"124_CR23","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1109\/72.822516","volume":"11","author":"SS Keerthi","year":"2000","unstructured":"Keerthi, S.S., Shevade, S.K., Bhattacharyya, C., Murthy, K.R.K.: A fast iterative nearest point algorithm for support vector machine classifier design. IEEE Trans. Neural Netw. 11, 124\u2013136 (2000)","journal-title":"IEEE Trans. Neural Netw."},{"key":"124_CR24","doi-asserted-by":"crossref","unstructured":"Kurzhanskiy, A.A., Varaiya, P.: Ellipsoidal Toolbox, Tech. Report EECS-2006-46, EECS, UC Berkeley (2006)","DOI":"10.1109\/CDC.2006.377036"},{"key":"124_CR25","volume-title":"Optimization by Vector Spaces Method","author":"DG Luenberger","year":"1969","unstructured":"Luenberger, D.G.: Optimization by Vector Spaces Method. Wiley, New York (1969)"},{"key":"124_CR26","unstructured":"Martin, S.: Training support vector machines using Gilbert\u2019s algorithm. In: The 5th IEEE International Conference on Data Mining (ICDM), pp. 306\u2013313 (2005)"},{"key":"124_CR27","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1137\/0312003","volume":"12","author":"BF Mitchell","year":"1974","unstructured":"Mitchell, B.F., Demyanov, V.F., Malozemov, V.N.: Finding the point of a polyhedron closest to the origin. SIAM J. Control Optim. 12, 19\u201326 (1974)","journal-title":"SIAM J. Control Optim."},{"key":"124_CR28","doi-asserted-by":"publisher","first-page":"615","DOI":"10.1007\/s10898-009-9446-7","volume":"46","author":"BS Mordukhovich","year":"2010","unstructured":"Mordukhovich, B.S., Nam, N.M.: Limiting subgradients of minimal time functions in Banach spaces. J. Glob. Optim. 46, 615\u2013633 (2010)","journal-title":"J. Glob. Optim."},{"issue":"4","key":"124_CR29","doi-asserted-by":"publisher","first-page":"1815","DOI":"10.1137\/130945442","volume":"24","author":"NM Nam","year":"2014","unstructured":"Nam, N.M., An, N.T., Rector, R.B., Sun, J.: Nonsmooth algorithms and Nesterov smoothing technique for generalized Fermat\u2013Torricelli problems. SIAM J. Optim. 24(4), 1815\u20131839 (2014)","journal-title":"SIAM J. Optim."},{"key":"124_CR30","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/s10107-004-0552-5","volume":"103","author":"Y Nesterov","year":"2005","unstructured":"Nesterov, Y.: Smooth minimization of non-smooth functions. Math. Program. 103, 127\u2013152 (2005)","journal-title":"Math. Program."},{"key":"124_CR31","doi-asserted-by":"crossref","unstructured":"Nesterov, Y.: Introductory lectures on convex optimization: a basic course, Appl. Optim. 87, Kluwer, Boston (2004)","DOI":"10.1007\/978-1-4419-8853-9"},{"key":"124_CR32","first-page":"543","volume":"269","author":"Y Nesterov","year":"1983","unstructured":"Nesterov, Y.: A method for unconstrained convex minimization problem with the rate of convergence $$O\\left(\\dfrac{1}{k^2}\\right)$$. Dokl. Akad. Nauk SSSR 269, 543\u2013547 (1983)","journal-title":"Dokl. Akad. Nauk SSSR"},{"key":"124_CR33","volume-title":"Functional Analysis","author":"L Nirenberg","year":"1961","unstructured":"Nirenberg, L.: Functional Analysis. Academic Press, New York (1961)"},{"key":"124_CR34","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":"124_CR35","unstructured":"Schmidt, M., Le Roux, N., Bach, F.: Minimizing finite sums with the stochastic average gradient. Technical report, INRIA, hal-0086005 (2013)"},{"issue":"1","key":"124_CR36","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1111\/j.2517-6161.1996.tb02080.x","volume":"58","author":"R Tibshirani","year":"1996","unstructured":"Tibshirani, R.: Regression shrinkage and selection via the lasso. J. R. Stat. Soc.: Ser. B (Methodological)) 58(1), 267\u2013288 (1996)","journal-title":"J. R. Stat. Soc.: Ser. B (Methodological))"},{"issue":"3","key":"124_CR37","doi-asserted-by":"publisher","first-page":"1335","DOI":"10.1214\/11-AOS878","volume":"39","author":"R Tibshirani","year":"2011","unstructured":"Tibshirani, R., Taylor, J.: The solution path of the generalized lasso. Ann. Stat. 39(3), 1335\u20131371 (2011)","journal-title":"Ann. Stat."},{"key":"124_CR38","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-2809-5","volume-title":"Convex Analysis and Global Optimization: Nonconvex Optimization and Its Applications","author":"H Tuy","year":"1998","unstructured":"Tuy, H.: Convex Analysis and Global Optimization: Nonconvex Optimization and Its Applications. Kluwer, Dordrecht (1998)"},{"key":"124_CR39","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1007\/BF01580381","volume":"11","author":"P Wolfe","year":"1976","unstructured":"Wolfe, P.: Finding the nearest point in a polytope. Math. Programm. 11, 128\u2013149 (1976)","journal-title":"Math. Programm."},{"key":"124_CR40","unstructured":"Won, J.H., Xu, J., Lange, K.: Projection onto Minkowski sums with application to constrained learning. In: International Conference on Machine Learning, pp. 3642\u20133651 (2019)"},{"issue":"1","key":"124_CR41","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 (Statistical Methodology) 68(1), 49\u201367 (2006)","journal-title":"J. R. Stat. Soc.: Ser. B (Statistical Methodology)"},{"key":"124_CR42","unstructured":"Yuan, L., Liu, J., Ye, J.: Efficient methods for overlapping group lasso. In: Advances in Neural Information Processing Systems, pp. 352\u2013360 (2011)"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-019-00124-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-019-00124-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-019-00124-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,22]],"date-time":"2024-07-22T11:46:24Z","timestamp":1721648784000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-019-00124-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8,22]]},"references-count":42,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2019,12]]}},"alternative-id":["124"],"URL":"https:\/\/doi.org\/10.1007\/s10589-019-00124-7","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,8,22]]},"assertion":[{"value":"13 March 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 August 2019","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}