{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T04:14:12Z","timestamp":1772770452789,"version":"3.50.1"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T00:00:00Z","timestamp":1558483200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T00:00:00Z","timestamp":1558483200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2019,7]]},"DOI":"10.1007\/s10107-019-01404-0","type":"journal-article","created":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T00:19:02Z","timestamp":1558570742000},"page":"465-496","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["A linearly convergent doubly stochastic Gauss\u2013Seidel algorithm for solving linear equations and a certain class of over-parameterized optimization problems"],"prefix":"10.1007","volume":"176","author":[{"given":"Meisam","family":"Razaviyayn","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mingyi","family":"Hong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Navid","family":"Reyhanian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhi-Quan","family":"Luo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,5,22]]},"reference":[{"key":"1404_CR1","volume-title":"Parallel and Distributed Computation: Numerical Methods","author":"DP Bertsekas","year":"1997","unstructured":"Bertsekas, D.P., Tsitsiklis, J.N.: Parallel and Distributed Computation: Numerical Methods, 2nd edn. Athena Scientific, Belmont (1997)","edition":"2"},{"key":"1404_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-9298-9","volume-title":"Best Approximation in Inner Product Spaces","author":"F Deutsch","year":"2001","unstructured":"Deutsch, F.: Best Approximation in Inner Product Spaces. Springer, New York (2001)"},{"key":"1404_CR3","volume-title":"Matrix Computation","author":"G Golub","year":"1996","unstructured":"Golub, G., van Loan, C.: Matrix Computation. Johns Hopkins University Press, Baltimore (1996)"},{"key":"1404_CR4","unstructured":"Gower, R.M., Richtarik, P.: Stochastic dual ascent for solving linear systems (2015). ArXiv Preprint: \n                    arXiv:1512.06890"},{"issue":"5","key":"1404_CR5","doi-asserted-by":"publisher","first-page":"S528","DOI":"10.1137\/16M1077891","volume":"39","author":"A Hefny","year":"2017","unstructured":"Hefny, A., Needell, D., Ramdas, A.: Rows versus columns: randomized Kaczmarz or Gauss\u2013Seidel for ridge regression. SIAM J. Sci. Comput. 39(5), S528\u2013S542 (2017)","journal-title":"SIAM J. Sci. Comput."},{"key":"1404_CR6","unstructured":"Johnson, R., Zhang, T.: Accelerating stochastic gradient descent using predictive variance reduction. In: The Proceedings of the Neural Information Processing (NIPS) (2013)"},{"issue":"6","key":"1404_CR7","doi-asserted-by":"publisher","first-page":"1269","DOI":"10.1080\/00207179308934446","volume":"57","author":"S Kaczmarz","year":"1993","unstructured":"Kaczmarz, S.: Approximate solution of systems of linear equations. Int. J. Control 57(6), 1269\u20131271 (1993). Translated from German original of 1933","journal-title":"Int. J. Control"},{"key":"1404_CR8","doi-asserted-by":"crossref","unstructured":"Karimi, H., Nutini, J., Schmidt, M.: Linear convergence of gradient and proximal-gradient methods under the Polyak-\u0141ojasiewicz condition. In: Joint European Conference on Machine Learning and Knowledge Discovery in Databases, pp. 795\u2013811. Springer (2016)","DOI":"10.1007\/978-3-319-46128-1_50"},{"key":"1404_CR9","unstructured":"Konecny, J., Qu, Z., Richtarik, P.: Semi-stochastic coordinate descent (2014). Preprint \n                    arXiv:1412.6293"},{"issue":"3","key":"1404_CR10","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1287\/moor.1100.0456","volume":"35","author":"D Leventhal","year":"2010","unstructured":"Leventhal, D., Lewis, A.S.: Randomized methods for linear constraints: convergence rates and conditioning. Math. Oper. Res. 35(3), 641\u2013654 (2010)","journal-title":"Math. Oper. Res."},{"key":"1404_CR11","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1090\/mcom\/2971","volume":"85","author":"J Liu","year":"2016","unstructured":"Liu, J., Wright, S.: An accelerated randomized Kaczmarz algorithm. Math. Comput. 85, 153\u2013178 (2016)","journal-title":"Math. Comput."},{"key":"1404_CR12","unstructured":"Liu, J., Wright, S.J., R\u00e9, C., Bittorf, V.: An asynchronous parallel stochastic coordinate descent algorithm. In: The Proceedings of the International Conference on Machine Learning (ICML) (2014)"},{"issue":"5","key":"1404_CR13","doi-asserted-by":"publisher","first-page":"S66","DOI":"10.1137\/16M1073807","volume":"39","author":"JAD Loera","year":"2017","unstructured":"Loera, J.A.D., Haddock, J., Needell, D.: A sampling Kaczmarz\u2013Motzkin algorithm for linear feasibility. SIAM J. Sci. Comput. 39(5), S66\u2013S87 (2017)","journal-title":"SIAM J. Sci. Comput."},{"issue":"4","key":"1404_CR14","doi-asserted-by":"publisher","first-page":"1590","DOI":"10.1137\/15M1014425","volume":"36","author":"A Ma","year":"2015","unstructured":"Ma, A., Needell, D., Ramdas, A.: Convergence properties of the randomized extended Gauss\u2013Seidel and Kaczmarz methods. SIAM J. Matrix Anal. Appl. 36(4), 1590\u20131604 (2015)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"1404_CR15","doi-asserted-by":"publisher","first-page":"393","DOI":"10.4153\/CJM-1954-038-x","volume":"6","author":"TS Motzkin","year":"1954","unstructured":"Motzkin, T.S., Schoenberg, I.J.: The relaxation method for linear inequalities. Can. J. Math. 6, 393\u2013404 (1954)","journal-title":"Can. J. Math."},{"key":"1404_CR16","doi-asserted-by":"crossref","unstructured":"Necoara, I., Nesterov, Y., Glineur, F.: Linear convergence of first order methods for non-strongly convex optimization. In: Mathematical Programming, pp. 1\u201339 (2018)","DOI":"10.1007\/s10107-018-1232-1"},{"issue":"2","key":"1404_CR17","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/s10543-010-0265-5","volume":"50","author":"D Needell","year":"2010","unstructured":"Needell, D.: Randomized Kaczmarz solver for noisy linear systems. BIT Numer. Math. 50(2), 395\u2013403 (2010)","journal-title":"BIT Numer. Math."},{"key":"1404_CR18","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/j.laa.2012.12.022","volume":"441","author":"D Needell","year":"2013","unstructured":"Needell, D., Tropp, J.A.: Paved with good intentions: analysis of a randomized block Kaczmarz method. Linear Algebra Appl. 441, 199\u2013221 (2013)","journal-title":"Linear Algebra Appl."},{"key":"1404_CR19","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611971323","volume-title":"Numerical analysis: a second course","author":"JM Ortega","year":"1990","unstructured":"Ortega, J.M.: Numerical analysis: a second course. SIAM, Philadelphia (1990)"},{"key":"1404_CR20","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/j.laa.2015.03.028","volume":"478","author":"P Oswald","year":"2015","unstructured":"Oswald, P., Zhou, W.: Convergence analysis for Kaczmarz-type methods in a Hilbert space framework. Linear Algebra Appl. 478, 131\u2013161 (2015)","journal-title":"Linear Algebra Appl."},{"issue":"4","key":"1404_CR21","doi-asserted-by":"publisher","first-page":"1207","DOI":"10.1007\/s00211-016-0829-7","volume":"135","author":"P Oswald","year":"2017","unstructured":"Oswald, P., Zhou, W.: Random reordering in SOR-type methods. Numer. Math. 135(4), 1207\u20131220 (2017)","journal-title":"Numer. Math."},{"key":"1404_CR22","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718003","volume-title":"Iterative Methods for Sparse Linear Systems","author":"Y Saad","year":"2003","unstructured":"Saad, Y.: Iterative Methods for Sparse Linear Systems. Society for Industrial and Applied Mathematics, Philadelphia (2003)"},{"issue":"2","key":"1404_CR23","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1007\/s00041-008-9030-4","volume":"15","author":"T Strohmer","year":"2008","unstructured":"Strohmer, T., Vershynin, R.: A randomized Kaczmarz algorithm with exponential convergence. J. Fourier Anal. Appl. 15(2), 262 (2008)","journal-title":"J. Fourier Anal. Appl."},{"issue":"Supplement C","key":"1404_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.cam.2017.03.021","volume":"322","author":"I Wheaton","year":"2017","unstructured":"Wheaton, I., Awoniyi, S.: A new iterative method for solving non-square systems of linear equations. J. Comput. Appl. Math. 322(Supplement C), 1\u20136 (2017)","journal-title":"J. Comput. Appl. Math."},{"key":"1404_CR25","unstructured":"Yu, A.W., Lin, Q., Yang, T.: Doubly stochastic primal\u2013dual coordinate method for bilinear saddle-point problem (2015). ArXiv preprint \n                    arXiv:1508.03390"},{"key":"1404_CR26","doi-asserted-by":"crossref","unstructured":"Zhang, A., Gu, Q.: Accelerated stochastic block coordinate descent with optimal sampling. In: Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 2035\u20132044. ACM (2016)","DOI":"10.1145\/2939672.2939819"},{"issue":"2","key":"1404_CR27","doi-asserted-by":"publisher","first-page":"773","DOI":"10.1137\/120889897","volume":"34","author":"A Zouzias","year":"2013","unstructured":"Zouzias, A., Freris, N.M.: Randomized extended Kaczmarz for solving least squares. SIAM J. Matrix Anal. Appl. 34(2), 773\u2013793 (2013)","journal-title":"SIAM J. Matrix Anal. Appl."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-019-01404-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-019-01404-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-019-01404-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,20]],"date-time":"2020-05-20T23:23:32Z","timestamp":1590017012000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-019-01404-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,5,22]]},"references-count":27,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2019,7]]}},"alternative-id":["1404"],"URL":"https:\/\/doi.org\/10.1007\/s10107-019-01404-0","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,5,22]]},"assertion":[{"value":"1 May 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 May 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 May 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}