{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,4,5]],"date-time":"2024-04-05T10:56:18Z","timestamp":1712314578866},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2021,4,7]],"date-time":"2021-04-07T00:00:00Z","timestamp":1617753600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,4,7]],"date-time":"2021-04-07T00:00:00Z","timestamp":1617753600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2021,9]]},"DOI":"10.1007\/s11590-021-01723-2","type":"journal-article","created":{"date-parts":[[2021,4,7]],"date-time":"2021-04-07T00:02:46Z","timestamp":1617753766000},"page":"2147-2164","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Variable smoothing incremental aggregated gradient method for nonsmooth nonconvex regularized optimization"],"prefix":"10.1007","volume":"15","author":[{"given":"Yuncheng","family":"Liu","sequence":"first","affiliation":[]},{"given":"Fuquan","family":"Xia","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,4,7]]},"reference":[{"issue":"2","key":"1723_CR1","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1109\/TPAMI.2016.2544315","volume":"39","author":"A Barbu","year":"2017","unstructured":"Barbu, A., She, Y., Ding, L., Gramajo, G.: Feature selection with annealing for computer vision and big data learning. IEEE Trans. Pattern Anal. Mach. Intell. 39(2), 272\u2013286 (2017)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"1723_CR2","doi-asserted-by":"publisher","unstructured":"B\u00f6hm, A., Wright, S.J.: Variable smoothing for weakly convex composite functions. J. Optim. Theory Appl. 188, 628\u2013649 (2021). https:\/\/doi.org\/10.1007\/s10957-020-01800-z","DOI":"10.1007\/s10957-020-01800-z"},{"key":"1723_CR3","doi-asserted-by":"crossref","unstructured":"Bertsekas, D.P.: Incremental gradient, subgradient, and proximal methods for convex optimization: A survey. Optim. Mach. Learn. pp. 1\u201338 (2011)","DOI":"10.7551\/mitpress\/8996.003.0006"},{"issue":"1","key":"1723_CR4","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1137\/040615961","volume":"18","author":"D Blatt","year":"2007","unstructured":"Blatt, D., Hero, A.O., Gauchman, H.: A convergent incremental gradient method with a constant step size. SIAM J. Optim. 18(1), 29\u201351 (2007)","journal-title":"SIAM J. Optim."},{"key":"1723_CR5","doi-asserted-by":"publisher","unstructured":"Bot, R.I., B\u00f6hm, A.: Variable smoothing for convex optimization problems using stochastic gradients. J. Sci. Comput. (2020). https:\/\/doi.org\/10.1007\/s10915-020-01332-8","DOI":"10.1007\/s10915-020-01332-8"},{"key":"1723_CR6","first-page":"281","volume":"21","author":"O Chapelle","year":"2008","unstructured":"Chapelle, O., Do, C.B., Teo, C.H., Le, Q.V., Smola, A.J.: Tighter bounds for structured estimation. Adv. Neural Inf. Process. Syst. 21, 281\u2013288 (2008)","journal-title":"Adv. Neural Inf. Process. Syst."},{"issue":"10","key":"1723_CR7","doi-asserted-by":"publisher","first-page":"707","DOI":"10.1109\/LSP.2007.898300","volume":"14","author":"R Chartrand","year":"2007","unstructured":"Chartrand, R.: Exact reconstruction of sparse signals via nonconvex minimization. IEEE Signal Process. Lett. 14(10), 707\u2013710 (2007)","journal-title":"IEEE Signal Process. Lett."},{"issue":"15","key":"1723_CR8","doi-asserted-by":"publisher","first-page":"3754","DOI":"10.1109\/TSP.2014.2330349","volume":"62","author":"L Chen","year":"2014","unstructured":"Chen, L., Gu, Y.: The convergence guarantees of a non-convex approach for sparse recovery. IEEE Trans. Signal Process. 62(15), 3754\u20133767 (2014)","journal-title":"IEEE Trans. Signal Process."},{"issue":"1","key":"1723_CR9","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1137\/18M1178244","volume":"29","author":"D Davis","year":"2019","unstructured":"Davis, D., Drusvyatskiy, D.: Stochastic model-based minimization of weakly convex functions. SIAM J. Optim. 29(1), 207\u2013239 (2019)","journal-title":"SIAM J. Optim."},{"issue":"456","key":"1723_CR10","doi-asserted-by":"publisher","first-page":"1348","DOI":"10.1198\/016214501753382273","volume":"96","author":"J Fan","year":"2001","unstructured":"Fan, J., Li, R.: Variable selection via nonconcave penalized likelihood and its oracle properties. J. Am. Stat. Assoc. 96(456), 1348\u20131360 (2001)","journal-title":"J. Am. Stat. Assoc."},{"issue":"4","key":"1723_CR11","doi-asserted-by":"publisher","first-page":"2542","DOI":"10.1137\/17M1147846","volume":"29","author":"M G\u00fcrb\u00fczbalaban","year":"2018","unstructured":"G\u00fcrb\u00fczbalaban, M., Ozdaglar, A.E., Parrilo, P.A.: Convergence rate of incremental gradient and incremental newton methods. SIAM J. Optim. 29(4), 2542\u20132565 (2018)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"1723_CR12","doi-asserted-by":"publisher","first-page":"1035","DOI":"10.1137\/15M1049695","volume":"27","author":"M G\u00fcrb\u00fczbalaban","year":"2017","unstructured":"G\u00fcrb\u00fczbalaban, M., Ozdaglar, A., Parrilo, P.A.: On the convergence rate of incremental aggregated gradient algorithms. SIAM J. Optim. 27(2), 1035\u20131048 (2017)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"1723_CR13","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1198\/004017007000000245","volume":"49","author":"A Genkin","year":"2007","unstructured":"Genkin, A., Lewis, D.D., Madigan, D.: Large-scale bayesian logistic regression for text categorization. Technometrics 49(3), 291\u2013304 (2007)","journal-title":"Technometrics"},{"key":"1723_CR14","unstructured":"Komarek, P.: Logistic regression for data mining and high-dimensional classification. PhD thesis, Pittsburgh, PA, USA (2004)"},{"key":"1723_CR15","doi-asserted-by":"publisher","unstructured":"Liu, Y., Xia, F.: Linear convergence of proximal incremental aggregated gradient method for nonconvex nonsmooth minimization problems. Appl. Anal. Published Online: https:\/\/doi.org\/10.1080\/00036811.2020.1849634 (2020)","DOI":"10.1080\/00036811.2020.1849634"},{"key":"1723_CR16","first-page":"1049","volume":"21","author":"H Masnadi-shirazi","year":"2008","unstructured":"Masnadi-shirazi, H., Vasconcelos, N.: On the design of loss functions for classification: theory, robustness to outliers, and savageboost. Adv Neural Inf. Process. Syst. 21, 1049\u20131056 (2008)","journal-title":"Adv Neural Inf. Process. Syst."},{"issue":"6","key":"1723_CR17","first-page":"1660","volume":"125","author":"TP Minka","year":"2007","unstructured":"Minka, T.P.: A comparison of numerical optimizers for logistic regression. J. Am. Chem. Soc. 125(6), 1660\u20131668 (2007)","journal-title":"J. Am. Chem. Soc."},{"issue":"2","key":"1723_CR18","doi-asserted-by":"publisher","first-page":"1420","DOI":"10.1137\/16M1101702","volume":"28","author":"A Mokhtari","year":"2018","unstructured":"Mokhtari, A., G\u00fcrb\u00fczbalaban, M., Ribeiro, A.: Surpassing gradient descent provably: A cyclic incremental method with linear convergence rate. SIAM J. Optim. 28(2), 1420\u20131447 (2018)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"1723_CR19","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1137\/S1052623499362111","volume":"12","author":"A Nedi\u0107","year":"2001","unstructured":"Nedi\u0107, A., Bertsekas, D.P.: Incremental subgradient methods for nondifferentiable optimization. SIAM J. Optim. 12(1), 109\u2013138 (2001)","journal-title":"SIAM J. Optim."},{"key":"1723_CR20","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1007\/s10957-019-01538-3","volume":"183","author":"W Peng","year":"2019","unstructured":"Peng, W., Zhang, H., Zhang, X.: Nonconvex proximal incremental aggregated gradient method with linear convergence. J. Optim. Theory Appl. 183, 230\u2013245 (2019)","journal-title":"J. Optim. Theory Appl."},{"issue":"1","key":"1723_CR21","doi-asserted-by":"publisher","first-page":"482","DOI":"10.1109\/TIT.2012.2207945","volume":"59","author":"Y Plan","year":"2013","unstructured":"Plan, Y., Vershynin, R.: Robust 1-bit compressed sensing and sparse logistic regression: A convex programming approach. IEEE Trans. Inf. Theory 59(1), 482\u2013494 (2013)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1723_CR22","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":"1723_CR23","volume-title":"Variational Analysis","author":"RT Rockafellar","year":"2009","unstructured":"Rockafellar, R.T., Wets, R.J.B.: Variational Analysis. Springer, New York (2009)"},{"issue":"7","key":"1723_CR24","doi-asserted-by":"publisher","first-page":"934","DOI":"10.1109\/LSP.2016.2567482","volume":"23","author":"X Shen","year":"2016","unstructured":"Shen, X., Chen, L., Gu, Y., So, H.C.: Square-root lasso with nonconvex regularization: An admm approach. IEEE Signal Process. Lett. 23(7), 934\u2013938 (2016)","journal-title":"IEEE Signal Process. Lett."},{"issue":"12","key":"1723_CR25","doi-asserted-by":"publisher","first-page":"3199","DOI":"10.1109\/TSP.2018.2824289","volume":"66","author":"X Shen","year":"2018","unstructured":"Shen, X., Gu, Y.: Nonconvex sparse logistic regression with weakly convex regularization. IEEE Trans. Signal Process. 66(12), 3199\u20133211 (2018)","journal-title":"IEEE Trans. Signal Process."},{"key":"1723_CR26","unstructured":"Sun, T., Sun, Y., Li, D., Liao, Q.: General proximal incremental aggregated gradient algorithms: Better and novel results under general scheme. Adv. Neural Inf. Process. Syst. 32, 996\u20131006 (2019)"},{"key":"1723_CR27","unstructured":"Tim, H., Maxime, L., Adam, O.: On proximal point-type algorithms for weakly convex functions and their connection to the backward euler method (2018)"},{"issue":"2","key":"1723_CR28","doi-asserted-by":"publisher","first-page":"1282","DOI":"10.1137\/16M1094415","volume":"28","author":"ND Vanli","year":"2018","unstructured":"Vanli, N.D., G\u00fcrb\u00fczbalaban, M., Ozdaglar, A.: Global convergence rate of proximal incremental aggregated gradient methods. SIAM J. Optim. 28(2), 1282\u20131300 (2018)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"1723_CR29","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/s10589-020-00183-1","volume":"76","author":"HT Wai","year":"2020","unstructured":"Wai, H.T., Shi, W., Uribe, C.A., Nedi\u0107, A., Scaglione, A.: Accelerating incremental gradient optimization with curvature information. Comput. Optim. Appl. 76(2), 347\u2013380 (2020)","journal-title":"Comput. Optim. Appl."},{"issue":"479","key":"1723_CR30","doi-asserted-by":"publisher","first-page":"974","DOI":"10.1198\/016214507000000617","volume":"102","author":"Y Wu","year":"2007","unstructured":"Wu, Y., Liu, Y.: Robust truncated hinge loss support vector machines. J. Am. Stat. Assoc. 102(479), 974\u2013983 (2007)","journal-title":"J. Am. Stat. Assoc."},{"issue":"2","key":"1723_CR31","doi-asserted-by":"publisher","first-page":"894","DOI":"10.1214\/09-AOS729","volume":"38","author":"CH Zhang","year":"2010","unstructured":"Zhang, C.H.: Nearly unbiased variable selection under minimax concave penalty. Ann. Stat. 38(2), 894\u2013942 (2010)","journal-title":"Ann. Stat."},{"issue":"1","key":"1723_CR32","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1287\/moor.2019.1047","volume":"46","author":"H Zhang","year":"2020","unstructured":"Zhang, H., Dai, Y.H., Guo, L.: Proximal-like incremental aggregated gradient method with linear convergence under bregman distance growth conditions. Math. Oper. Res. 46(1), 61\u201381 (2020)","journal-title":"Math. Oper. Res."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-021-01723-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-021-01723-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-021-01723-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,1]],"date-time":"2023-11-01T15:16:07Z","timestamp":1698851767000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-021-01723-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,4,7]]},"references-count":32,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2021,9]]}},"alternative-id":["1723"],"URL":"https:\/\/doi.org\/10.1007\/s11590-021-01723-2","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,4,7]]},"assertion":[{"value":"29 June 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 February 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 April 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}