{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,1]],"date-time":"2024-09-01T00:08:23Z","timestamp":1725149303085},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2021,5,20]],"date-time":"2021-05-20T00:00:00Z","timestamp":1621468800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,5,20]],"date-time":"2021-05-20T00:00:00Z","timestamp":1621468800000},"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,11]]},"DOI":"10.1007\/s11590-021-01752-x","type":"journal-article","created":{"date-parts":[[2021,5,20]],"date-time":"2021-05-20T11:20:11Z","timestamp":1621509611000},"page":"2541-2554","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Primal-dual incremental gradient method for nonsmooth and convex optimization problems"],"prefix":"10.1007","volume":"15","author":[{"given":"Afrooz","family":"Jalilzadeh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,5,20]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Amini, M., Yousefian, F.: An iterative regularized incremental projected subgradient method for a class of bilevel optimization problems. In: 2019 American Control Conference (ACC), pp. 4069\u20134074. IEEE (2019)","key":"1752_CR1","DOI":"10.23919\/ACC.2019.8814637"},{"unstructured":"Bauschke, H.H.: Projection algorithms and monotone operators. Ph.D. thesis, Theses (Dept. of Mathematics and Statistics)\/Simon Fraser University (1996)","key":"1752_CR2"},{"doi-asserted-by":"crossref","unstructured":"Ben-Tal, A., Nemirovski, A.: Lectures on Modern Convex Optimization: Analysis, Algorithms, and Engineering Applications. SIAM (2001)","key":"1752_CR3","DOI":"10.1137\/1.9780898718829"},{"key":"1752_CR4","volume-title":"Convex Analysis and Optimization","author":"D Bertsekas","year":"2003","unstructured":"Bertsekas, D., Nedic, A., Ozdaglar, A.: Convex Analysis and Optimization. Athena Scientific, Athena Scientific Optimization and Computation Series (2003)"},{"issue":"1","key":"1752_CR5","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."},{"issue":"4","key":"1752_CR6","doi-asserted-by":"publisher","first-page":"2783","DOI":"10.1137\/17M1134834","volume":"28","author":"A Chambolle","year":"2018","unstructured":"Chambolle, A., Ehrhardt, M.J., Richt\u00e1rik, P., Schonlieb, C.B.: Stochastic primal-dual hybrid gradient algorithm with arbitrary sampling and imaging applications. SIAM J. Optim. 28(4), 2783\u20132808 (2018)","journal-title":"SIAM J. Optim."},{"doi-asserted-by":"crossref","unstructured":"Chen, S., Donoho, D.: Basis pursuit. In: Proceedings of 1994 28th Asilomar Conference on Signals, Systems and Computers, vol.\u00a01, pp. 41\u201344. IEEE (1994)","key":"1752_CR7","DOI":"10.1109\/ACSSC.1994.471413"},{"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, pp. 1646\u20131654 (2014)","key":"1752_CR8"},{"issue":"4","key":"1752_CR9","doi-asserted-by":"publisher","first-page":"1289","DOI":"10.1109\/TIT.2006.871582","volume":"52","author":"DL Donoho","year":"2006","unstructured":"Donoho, D.L.: Compressed sensing. IEEE Trans. Inf. Theory 52(4), 1289\u20131306 (2006)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"1752_CR10","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."},{"issue":"2","key":"1752_CR11","doi-asserted-by":"publisher","first-page":"1035","DOI":"10.1137\/15M1049695","volume":"27","author":"M Gurbuzbalaban","year":"2017","unstructured":"Gurbuzbalaban, 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."},{"unstructured":"Hamedani, E.Y., Aybat, N.S.: A primal-dual algorithm for general convex-concave saddle point problems. arXiv preprint arXiv:1803.01401 (2018)","key":"1752_CR12"},{"unstructured":"Jalilzadeh, A., Yazdandoost\u00a0Hamedani, E., Aybat, N.S., Shanbhag, U.V.: A doubly-randomized block-coordinate primal-dual method for large-scale saddle point problems. arXiv pp. arXiv\u20131907 (2019)","key":"1752_CR13"},{"doi-asserted-by":"crossref","unstructured":"Kaushik, H.D., Yousefian, F.: A projection-free incremental gradient method for large-scale constrained optimization. arXiv preprint arXiv:2006.07956 (2020)","key":"1752_CR14","DOI":"10.23919\/ACC50511.2021.9483035"},{"unstructured":"Le\u00a0Roux, N., Schmidt, M., Bach, F.: A stochastic gradient method with an exponential convergence rate for finite training sets. Pereira et\u00a0al (2013)","key":"1752_CR15"},{"issue":"1","key":"1752_CR16","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1137\/S1052623499362111","volume":"12","author":"A Nedic","year":"2001","unstructured":"Nedic, A., Bertsekas, D.P.: Incremental subgradient methods for nondifferentiable optimization. SIAM J. Optim. 12(1), 109\u2013138 (2001)","journal-title":"SIAM J. Optim."},{"unstructured":"Xu, Y.: First-order methods for constrained convex programming based on linearized augmented lagrangian function. arXiv preprint arXiv:1711.08020 (2017)","key":"1752_CR17"},{"issue":"2","key":"1752_CR18","doi-asserted-by":"publisher","first-page":"1664","DOI":"10.1137\/18M1229869","volume":"30","author":"Y Xu","year":"2020","unstructured":"Xu, Y.: Primal-dual stochastic gradient method for convex programs with many functional constraints. SIAM J. Optim. 30(2), 1664\u20131692 (2020)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"1752_CR19","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1007\/s10107-017-1175-y","volume":"165","author":"F Yousefian","year":"2017","unstructured":"Yousefian, F., Nedi\u0107, A., Shanbhag, U.V.: On smoothing, regularization, and averaging in stochastic approximation methods for stochastic variational inequality problems. Math. Program. 165(1), 391\u2013431 (2017)","journal-title":"Math. Program."},{"unstructured":"Yu, A.W., Lin, Q., Yang, T.: Doubly stochastic primal-dual coordinate method for regularized empirical risk minimization with factorized data. CoRR, abs\/1508.03390 (2015)","key":"1752_CR20"},{"issue":"1","key":"1752_CR21","first-page":"2939","volume":"18","author":"Y Zhang","year":"2017","unstructured":"Zhang, Y., Xiao, L.: Stochastic primal-dual coordinate method for regularized empirical risk minimization. J. Mach. Learn. Res. 18(1), 2939\u20132980 (2017)","journal-title":"J. Mach. Learn. Res."},{"doi-asserted-by":"crossref","unstructured":"Zhu, Z., Storkey, A.J.: Adaptive stochastic primal-dual coordinate descent for separable saddle point problems. In: Joint European Conference on Machine Learning and Knowledge Discovery in Databases, pp. 645\u2013658. Springer (2015)","key":"1752_CR22","DOI":"10.1007\/978-3-319-23528-8_40"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-021-01752-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-021-01752-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-021-01752-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,31]],"date-time":"2024-08-31T07:45:09Z","timestamp":1725090309000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-021-01752-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,5,20]]},"references-count":22,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2021,11]]}},"alternative-id":["1752"],"URL":"https:\/\/doi.org\/10.1007\/s11590-021-01752-x","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"type":"print","value":"1862-4472"},{"type":"electronic","value":"1862-4480"}],"subject":[],"published":{"date-parts":[[2021,5,20]]},"assertion":[{"value":"15 November 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 May 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 May 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}