{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,26]],"date-time":"2026-06-26T19:33:09Z","timestamp":1782502389896,"version":"3.54.5"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2019,10,24]],"date-time":"2019-10-24T00:00:00Z","timestamp":1571875200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,10,24]],"date-time":"2019-10-24T00:00:00Z","timestamp":1571875200000},"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":["J Glob Optim"],"published-print":{"date-parts":[[2020,6]]},"DOI":"10.1007\/s10898-019-00850-6","type":"journal-article","created":{"date-parts":[[2019,10,25]],"date-time":"2019-10-25T20:06:46Z","timestamp":1572034006000},"page":"361-382","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":19,"title":["Accelerated sampling Kaczmarz Motzkin algorithm for the linear feasibility problem"],"prefix":"10.1007","volume":"77","author":[{"given":"Md Sarowar","family":"Morshed","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Md Saiful","family":"Islam","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5353-9710","authenticated-orcid":false,"given":"Md.","family":"Noor-E-Alam","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2019,10,24]]},"reference":[{"issue":"2","key":"850_CR1","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":"3","key":"850_CR2","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."},{"issue":"2","key":"850_CR3","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."},{"issue":"2","key":"850_CR4","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/s00211-010-0331-6","volume":"117","author":"P Drineas","year":"2011","unstructured":"Drineas, P., Mahoney, M.W., Muthukrishnan, S., Sarl\u00f3s, T.: Faster least squares approximation. Numer. Math. 117(2), 219\u2013249 (2011)","journal-title":"Numer. Math."},{"issue":"2","key":"850_CR5","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."},{"key":"850_CR6","doi-asserted-by":"crossref","unstructured":"Lee, Y.T., Sidford, A.: Efficient accelerated coordinate descent methods and faster algorithms for solving linear systems. In: Proceedings of the 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, FOCS\u201913, Washington, DC, USA. IEEE Computer Society, pp. 147\u2013156 (2013)","DOI":"10.1109\/FOCS.2013.24"},{"issue":"4","key":"850_CR7","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 seidel and Kaczmarz methods. SIAM J. Matrix Anal. Appl. 36(4), 1590\u20131604 (2015)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"850_CR8","unstructured":"Qu, Z., Richtarik, P., Takac, M., Fercoq, O.: SDNA: stochastic dual Newton ascent for empirical risk minimization. In: Proceedings of the 33rd International Conference on Machine Learning, vol.\u00a048, New York, USA, 20\u201322 June 2016. PMLR, pp. 1823\u20131832 (2016)"},{"issue":"5","key":"850_CR9","doi-asserted-by":"publisher","first-page":"S66","DOI":"10.1137\/16M1073807","volume":"39","author":"J De Loera","year":"2017","unstructured":"De Loera, J., 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":"2","key":"850_CR10","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1137\/0719025","volume":"19","author":"RS Dembo","year":"1982","unstructured":"Dembo, R.S., Eisenstat, S.C., Steihaug, T.: Inexact Newton methods. SIAM J. Numer. Anal. 19(2), 400\u2013408 (1982)","journal-title":"SIAM J. Numer. Anal."},{"issue":"1","key":"850_CR11","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1137\/0917003","volume":"17","author":"SC Eisenstat","year":"1996","unstructured":"Eisenstat, S.C., Walker, H.F.: Choosing the forcing terms in an inexact Newton method. SIAM J. Sci. Comput. 17(1), 16\u201332 (1996)","journal-title":"SIAM J. Sci. Comput."},{"issue":"1","key":"850_CR12","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1023\/A:1022663100715","volume":"96","author":"S Bellavia","year":"1998","unstructured":"Bellavia, S.: Inexact interior-point method. J. Optim. Theory Appl. 96(1), 109\u2013121 (1998)","journal-title":"J. Optim. Theory Appl."},{"issue":"4","key":"850_CR13","doi-asserted-by":"publisher","first-page":"1737","DOI":"10.1137\/080718206","volume":"20","author":"X-Y Zhao","year":"2010","unstructured":"Zhao, X.-Y., Sun, D., Toh, K.-C.: A Newton-CG augmented lagrangian method for semidefinite programming. SIAM J. Optim. 20(4), 1737\u20131765 (2010)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"850_CR14","doi-asserted-by":"publisher","first-page":"436","DOI":"10.1007\/s10957-012-0150-2","volume":"157","author":"C Wang","year":"2013","unstructured":"Wang, C., Aimin, X.: An inexact accelerated proximal gradient method and a dual Newton-CG method for the maximal entropy problem. J. Optim. Theory Appl. 157(2), 436\u2013450 (2013)","journal-title":"J. Optim. Theory Appl."},{"issue":"3","key":"850_CR15","doi-asserted-by":"publisher","first-page":"1042","DOI":"10.1137\/110847081","volume":"22","author":"K Jiang","year":"2012","unstructured":"Jiang, K., Sun, D., Toh, K.-C.: An inexact accelerated proximal gradient method for large scale linearly constrained convex SDP. SIAM J. Optim. 22(3), 1042\u20131064 (2012)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"850_CR16","doi-asserted-by":"publisher","first-page":"1510","DOI":"10.1137\/120886017","volume":"23","author":"J Gondzio","year":"2013","unstructured":"Gondzio, J.: Convergence analysis of an inexact feasible interior point method for convex quadratic programming. SIAM J. Optim. 23(3), 1510\u20131527 (2013)","journal-title":"SIAM J. Optim."},{"key":"850_CR17","first-page":"355","volume":"35","author":"S Kaczmarz","year":"1937","unstructured":"Kaczmarz, S.: Angenaherte auflsung von systemen linearer gleichungen. Bull. Int. Acad. Pol. Sci. Lett. 35, 355\u2013357 (1937)","journal-title":"Bull. Int. Acad. Pol. Sci. Lett."},{"key":"850_CR18","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84628-723-7","volume-title":"Fundamentals of Computerized Tomography: Image Reconstruction from Projections","author":"GT Herman","year":"2009","unstructured":"Herman, G.T.: Fundamentals of Computerized Tomography: Image Reconstruction from Projections, 2nd edn. Springer, New York (2009)","edition":"2"},{"issue":"4","key":"850_CR19","doi-asserted-by":"publisher","first-page":"444","DOI":"10.1137\/1023097","volume":"23","author":"Y Censor","year":"1981","unstructured":"Censor, Y.: Row-action methods for huge and sparse systems and their applications. SIAM Rev. 23(4), 444\u2013466 (1981)","journal-title":"SIAM Rev."},{"issue":"297","key":"850_CR20","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1090\/mcom\/2971","volume":"85","author":"J Liu","year":"2016","unstructured":"Liu, J., Wright, S.J.: An accelerated randomized Kaczmarz algorithm. Math. Comput. 85(297), 153\u2013178 (2016)","journal-title":"Math. Comput."},{"key":"850_CR21","doi-asserted-by":"publisher","first-page":"382","DOI":"10.4153\/CJM-1954-037-2","volume":"6","author":"S Agamon","year":"1954","unstructured":"Agamon, S.: The relaxation method for linear inequalities. Can. J. Math. 6, 382\u2013392 (1954)","journal-title":"Can. J. Math."},{"key":"850_CR22","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":"850_CR23","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1037\/h0042519","volume":"65","author":"F Rosenblatt","year":"1958","unstructured":"Rosenblatt, F.: The perceptron: a probabilistic model for information storage and organization in the brain. Psychol. Rev. 65, 65\u2013386 (1958)","journal-title":"Psychol. Rev."},{"key":"850_CR24","unstructured":"Ramdas, A., Pe\u00f1a, J.: Margins, kernels and non-linear smoothed perceptrons. In: Proceedings of the 31st International Conference on Machine Learning, vol.\u00a032, Beijing, China, 22\u201324 June. PMLR, pp. 244\u2013252 (2014)"},{"issue":"2","key":"850_CR25","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1080\/10556788.2015.1099652","volume":"31","author":"A Ramdas","year":"2016","unstructured":"Ramdas, A., Pe\u00f1a, J.: Towards a deeper geometric, analytic and algorithmic understanding of margins. Optim. Methods Softw. 31(2), 377\u2013391 (2016)","journal-title":"Optim. Methods Softw."},{"key":"850_CR26","unstructured":"Nutini, J., Sepehry, B., Laradji, I., Schmidt, M., Koepke, H., Virani, A.: Convergence rates for greedy Kaczmarz algorithms, and faster randomized Kaczmarz rules using the orthogonality graph. In: Proceedings of the Thirty-Second Conference on Uncertainty in Artificial Intelligence, UAI\u201916, Arlington, Virginia, USA, 2016. AUAI Press, pp. 547\u2013556 (2016)"},{"issue":"3","key":"850_CR27","doi-asserted-by":"publisher","first-page":"791","DOI":"10.1007\/s11075-016-0118-7","volume":"73","author":"S Petra","year":"2016","unstructured":"Petra, S., Popa, C.: Single projection Kaczmarz extended algorithms. Numer. Algorithms 73(3), 791\u2013806 (2016)","journal-title":"Numer. Algorithms"},{"key":"850_CR28","doi-asserted-by":"crossref","unstructured":"Hoffman, A.J.: On approximate solutions of systems of linear inequalities. In: Selected Papers of Alan J Hoffman: With Commentary. World Scientific, pp. 174\u2013176 (2003)","DOI":"10.1142\/9789812796936_0018"},{"issue":"1","key":"850_CR29","first-page":"012017","volume":"814","author":"X Xu Xiang","year":"2017","unstructured":"Xu Xiang, X., Liu, W.T., Dai, X.: An accelerated randomized extended Kaczmarz algorithm. J. Phys.: Conf. Ser. 814(1), 012017 (2017)","journal-title":"J. Phys.: Conf. Ser."},{"key":"850_CR30","doi-asserted-by":"crossref","unstructured":"Morshed, M.S., Noor-E-Alam, M.: Generalized affine scaling algorithms for linear programming problems. Comput. Oper. Res. 114, 104807 (2020)","DOI":"10.1016\/j.cor.2019.104807"},{"key":"850_CR31","unstructured":"Nesterov, Y.: A method for solving the convex programming problem with convergence rate $$o(1\/k^{2})$$. Soviet Mathematics Doklady, vol. 27, pp. 372\u2013376 (1983)"},{"issue":"1","key":"850_CR32","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s10107-012-0629-5","volume":"140","author":"Y Nesterov","year":"2013","unstructured":"Nesterov, Y.: Gradient methods for minimizing composite functions. Math. Program. 140(1), 125\u2013161 (2013)","journal-title":"Math. Program."},{"key":"850_CR33","volume-title":"Introductory Lectures on Convex Optimization: A Basic Course","author":"Y Nesterov","year":"2014","unstructured":"Nesterov, Y.: Introductory Lectures on Convex Optimization: A Basic Course, 1st edn. Springer, New York (2014)","edition":"1"},{"issue":"1","key":"850_CR34","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(1), 127\u2013152 (2005)","journal-title":"Math. Program."},{"issue":"2","key":"850_CR35","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1137\/100802001","volume":"22","author":"Y Nesterov","year":"2012","unstructured":"Nesterov, Y.: Efficiency of coordinate descent methods on huge-scale optimization problems. SIAM J. Optim. 22(2), 341\u2013362 (2012)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"850_CR36","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1016\/0022-5193(70)90109-8","volume":"29","author":"R Gordon","year":"1970","unstructured":"Gordon, R., Bender, R., Herman, G.T.: Algebraic reconstruction techniques (art) for three-dimensional electron microscopy and x-ray photography. J. Theor. Biol. 29(3), 471\u2013481 (1970)","journal-title":"J. Theor. Biol."},{"key":"850_CR37","volume-title":"Optimization Models. Control Systems and Optimization Series","author":"G Calafiore","year":"2014","unstructured":"Calafiore, G., El Ghaoui, L.: Optimization Models. Control Systems and Optimization Series. Cambridge University Press, Cambridge (2014)"},{"key":"850_CR38","unstructured":"Lichman, M.: UCI machine learning repository. (2013). \nhttp:\/\/archive.ics.uci.edu\/ml"},{"issue":"2","key":"850_CR39","doi-asserted-by":"publisher","first-page":"2473","DOI":"10.1016\/j.eswa.2007.12.020","volume":"36","author":"I-C Yeh","year":"2009","unstructured":"Yeh, I.-C., Lien, C.: The comparisons of data mining techniques for the predictive accuracy of probability of default of credit card clients. Expert Syst. Appl. 36(2), 2473\u20132480 (2009)","journal-title":"Expert Syst. Appl."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-019-00850-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-019-00850-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-019-00850-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,22]],"date-time":"2020-10-22T23:19:09Z","timestamp":1603408749000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-019-00850-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,10,24]]},"references-count":39,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2020,6]]}},"alternative-id":["850"],"URL":"https:\/\/doi.org\/10.1007\/s10898-019-00850-6","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,10,24]]},"assertion":[{"value":"6 February 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 October 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 October 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}