{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T22:58:17Z","timestamp":1778626697257,"version":"3.51.4"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,11,15]],"date-time":"2022-11-15T00:00:00Z","timestamp":1668470400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,11,15]],"date-time":"2022-11-15T00:00:00Z","timestamp":1668470400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"NSRF via the Program Management Unit for Human Resources & Institutional Development, Research and Innovation","award":["B05F640183"],"award-info":[{"award-number":["B05F640183"]}]},{"DOI":"10.13039\/501100004704","name":"National Research Council of Thailand","doi-asserted-by":"crossref","award":["R2565B074"],"award-info":[{"award-number":["R2565B074"]}],"id":[{"id":"10.13039\/501100004704","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Numer Algor"],"published-print":{"date-parts":[[2023,6]]},"DOI":"10.1007\/s11075-022-01430-8","type":"journal-article","created":{"date-parts":[[2022,11,15]],"date-time":"2022-11-15T06:02:59Z","timestamp":1668492179000},"page":"639-668","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["A dynamic distributed conjugate gradient method for variational inequality problem over the common fixed-point constraints"],"prefix":"10.1007","volume":"93","author":[{"given":"Narin","family":"Petrot","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mootta","family":"Prangprakhon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Porntip","family":"Promsinchai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1640-8919","authenticated-orcid":false,"given":"Nimit","family":"Nimana","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,11,15]]},"reference":[{"key":"1430_CR1","volume-title":"Optimisation: Methods Numeriques","author":"A Auslender","year":"1976","unstructured":"Auslender, A.: Optimisation: Methods Numeriques. Masson, Paris (1976)"},{"key":"1430_CR2","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1080\/02331934.2018.1512109","volume":"68","author":"C Bargetz","year":"2018","unstructured":"Bargetz, C., Kolobov, V.I., Reich, S., Zalas, R.: Linear convergence rates for extrapolated fixed point algorithms. Optimization 68, 163\u2013195 (2018)","journal-title":"Optimization"},{"key":"1430_CR3","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1137\/S0036144593251710","volume":"38","author":"HH Bauschke","year":"1996","unstructured":"Bauschke, H.H., Borwein, J.: On projection algorithms for solving convex feasibility problems. SIAM Rev. 38, 367\u2013426 (1996)","journal-title":"SIAM Rev."},{"key":"1430_CR4","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1080\/00207169008803865","volume":"34","author":"D Butnariu","year":"1990","unstructured":"Butnariu, D., Censor, Y.: On the behavior of a block-iterative projection method for solving convex feasibility problems. Int. J. Comp. Math. 34, 79\u201394 (1990)","journal-title":"Int. J. Comp. Math."},{"key":"1430_CR5","volume-title":"Iterative Methods for Fixed Point Problems in Hilbert Spaces","author":"A Cegielski","year":"2012","unstructured":"Cegielski, A.: Iterative Methods for Fixed Point Problems in Hilbert Spaces. Springer, Heidelberg (2012)"},{"issue":"2","key":"1430_CR6","first-page":"211","volume":"15","author":"A Cegielski","year":"2014","unstructured":"Cegielski, A.: Extrapolated simultaneous subgradient projection method for variational inequality over the intersection of convex subsets. J Nonlinear Convex Anal. 15(2), 211\u2013218 (2014)","journal-title":"J Nonlinear Convex Anal."},{"key":"1430_CR7","doi-asserted-by":"crossref","unstructured":"Cegielski, A., Censor, Y.: Opial-type theorems and the common fixed point problem. In: Bauschke, H.H., Burachik, R.S., Combettes, P.L., Elser, V., Luke, D.R., Wolkowicz, H. (eds.) Fixed-Point Algorithms for Inverse Problems in Science and Engineering, pp 155\u2013183. Springer, New York (2011)","DOI":"10.1007\/978-1-4419-9569-8_9"},{"issue":"2","key":"1430_CR8","doi-asserted-by":"publisher","first-page":"809","DOI":"10.1016\/j.jmaa.2012.04.072","volume":"394","author":"A Cegielski","year":"2012","unstructured":"Cegielski, A., Censor, Y.: Extrapolation and local acceleration of an iterative process for common fixed point problems. J. Math. Anal. Appl. 394(2), 809\u2013818 (2012)","journal-title":"J. Math. Anal. Appl."},{"issue":"10","key":"1430_CR9","doi-asserted-by":"publisher","first-page":"1067","DOI":"10.1080\/01630563.2013.771656","volume":"34","author":"A Cegielski","year":"2013","unstructured":"Cegielski, A., Gibali, A., Reich, S., Zalas, R.: An algorithm for solving the variational inequality problem over the fixed point set of a quasi-nonexpansive operator in Euclidean space. Numer Funct Anal Optim. 34(10), 1067\u20131096 (2013)","journal-title":"Numer Funct Anal Optim."},{"issue":"10","key":"1430_CR10","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1080\/01630563.2012.716807","volume":"34","author":"A Cegielski","year":"2013","unstructured":"Cegielski, A., Zalas, R.: Methods for variational inequality problem over the intersection of fixed point sets of quasi-nonexpansive operators. Numer Funct Anal Optim. 34(10), 255\u2013283 (2013)","journal-title":"Numer Funct Anal Optim."},{"key":"1430_CR11","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/0024-3795(82)90149-5","volume":"42","author":"Y Censor","year":"1982","unstructured":"Censor, Y., Elfving, T.: New methods for linear inequalities. Lin Algebra Appl. 42, 199\u2013211 (1982)","journal-title":"Lin Algebra Appl."},{"key":"1430_CR12","doi-asserted-by":"publisher","first-page":"1217","DOI":"10.1080\/01630560701749524","volume":"28","author":"W Cheng","year":"2014","unstructured":"Cheng, W.: A two-term PRP-based descent method. Numer Funct Anal Optim. 28, 1217\u20131230 (2014)","journal-title":"Numer Funct Anal Optim."},{"key":"1430_CR13","first-page":"326","volume":"9","author":"G Cimmino","year":"1938","unstructured":"Cimmino, G.: Calcolo approssimato per le soluzioni dei sistemi di equazioni lineari. Ric Sci. 9, 326\u2013333 (1938)","journal-title":"Ric Sci."},{"key":"1430_CR14","doi-asserted-by":"publisher","first-page":"2955","DOI":"10.1109\/78.330356","volume":"42","author":"PL Combettes","year":"1994","unstructured":"Combettes, P.L.: Inconsistent signal feasibility problems: least-square solutions in a product space. IEEE Trans Signal Process. 42, 2955\u20132966 (1994)","journal-title":"IEEE Trans Signal Process."},{"key":"1430_CR15","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1109\/83.563316","volume":"6","author":"PL Combettes","year":"1997","unstructured":"Combettes, P.L.: Convex set theoretic image recovery by extrapolated iterations of parallel subgradient projections. IEEE Trans Image Process. 6, 493\u2013506 (1997)","journal-title":"IEEE Trans Image Process."},{"key":"1430_CR16","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1016\/0377-0427(87)90004-5","volume":"18","author":"LT Dos Santos","year":"1987","unstructured":"Dos Santos, L.T.: A parallel subgradient projections method for the convex feasibility problem. J Comput Appl Math. 18, 307\u2013320 (1987)","journal-title":"J Comput Appl Math."},{"issue":"4","key":"1430_CR17","doi-asserted-by":"publisher","first-page":"775","DOI":"10.1007\/s11784-015-0256-x","volume":"17","author":"A Gibali","year":"2015","unstructured":"Gibali, A., Reich, S., Zalas, R.: Iterative methods for solving variational inequalities in Euclidean space. J Fixed Point Theory Appl. 17(4), 775\u2013811 (2015)","journal-title":"J Fixed Point Theory Appl."},{"issue":"3","key":"1430_CR18","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1080\/02331934.2016.1271800","volume":"66","author":"A Gibali","year":"2017","unstructured":"Gibali, A., Reich, S., Zalas, R.: Outer approximation methods for solving variational inequalities in Hilbert space. Optimization. 66(3), 417\u2013437 (2017)","journal-title":"Optimization."},{"key":"1430_CR19","doi-asserted-by":"publisher","first-page":"709","DOI":"10.1090\/S0002-9904-1964-11178-2","volume":"70","author":"AA Goldstein","year":"1964","unstructured":"Goldstein, A.A.: Convex programming in Hilbert space. Bull Amer Math Soc. 70, 709\u2013710 (1964)","journal-title":"Bull Amer Math Soc."},{"key":"1430_CR20","first-page":"6315","volume":"217","author":"H Iiduka","year":"2011","unstructured":"Iiduka, H.: Three-term conjugate gradient method for the convex optimization problem over the fixed point set of a nonexpansive mapping. Appl Math Comput. 217, 6315\u20136327 (2011)","journal-title":"Appl Math Comput."},{"key":"1430_CR21","doi-asserted-by":"publisher","first-page":"1354","DOI":"10.1109\/TCNS.2018.2889011","volume":"6","author":"H Iiduka","year":"2019","unstructured":"Iiduka, H.: Distributed optimization for network resource allocation with nonsmooth utility functions. IEEE Trans Control Netw Syst. 6, 1354\u20131365 (2019)","journal-title":"IEEE Trans Control Netw Syst."},{"issue":"10","key":"1430_CR22","doi-asserted-by":"publisher","first-page":"4370","DOI":"10.1109\/TCYB.2019.2921369","volume":"50","author":"H Iiduka","year":"2020","unstructured":"Iiduka, H.: Stochastic fixed point optimization algorithm for classifier ensemble. IEEE Trans Cybern. 50(10), 4370\u20134380 (2020)","journal-title":"IEEE Trans Cybern."},{"key":"1430_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10852-008-9099-4","volume":"8","author":"H Iiduka","year":"2009","unstructured":"Iiduka, H., Yamada, I.: An ergodic algorithm for the power-control games for CDMA data networks. J Math Model Algorithms. 8, 1\u201318 (2009)","journal-title":"J Math Model Algorithms."},{"key":"1430_CR24","doi-asserted-by":"publisher","first-page":"1881","DOI":"10.1137\/070702497","volume":"19","author":"H Iiduka","year":"2009","unstructured":"Iiduka, H., Yamada, I.: A use of conjugate gradient direction for the convex optimization problem over the fixed point set of a nonexpansive mapping. SIAM J Optim. 19, 1881\u20131893 (2009)","journal-title":"SIAM J Optim."},{"key":"1430_CR25","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/0024-3795(93)00089-I","volume":"215","author":"KC Kiwiel","year":"1995","unstructured":"Kiwiel, K.C.: Block-iterative surrogate projection methods for convex feasibility problems. Lin Algebra Appl. 215, 225\u2013259 (1995)","journal-title":"Lin Algebra Appl."},{"key":"1430_CR26","doi-asserted-by":"publisher","first-page":"899","DOI":"10.1007\/s11228-008-0102-z","volume":"16","author":"PE Maing\u00e9","year":"2008","unstructured":"Maing\u00e9, P.E.: Strong convergence of projected subgradient methods for nonsmooth and nonstrictly convex minimization. Set-Valued Anal. 16, 899\u2013912 (2008)","journal-title":"Set-Valued Anal."},{"key":"1430_CR27","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1090\/S0002-9904-1967-11761-0","volume":"73","author":"Z Opial","year":"1967","unstructured":"Opial, Z.: Weak convergence of the sequence of successive approximations for nonexpansive mappings. Bull Am Math Soc. 73, 591\u2013597 (1967)","journal-title":"Bull Am Math Soc."},{"key":"1430_CR28","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1007\/BF02612715","volume":"28","author":"G Pierra","year":"1984","unstructured":"Pierra, G.: Decomposition through formalization in a product space. Math Program. 28, 96\u2013115 (1984)","journal-title":"Math Program."},{"issue":"3","key":"1430_CR29","first-page":"1105","volume":"18","author":"M Prangprakhon","year":"2020","unstructured":"Prangprakhon, M., Nimana, N., Petrot, N.: A sequential constraint method for solving variational inequality over the intersection of fixed point sets. Thai J Math. 18(3), 1105\u20131123 (2020)","journal-title":"Thai J Math."},{"key":"1430_CR30","doi-asserted-by":"publisher","first-page":"1051","DOI":"10.1007\/s11075-021-01067-z","volume":"88","author":"M Prangprakhon","year":"2021","unstructured":"Prangprakhon, M., Nimana, N.: Extrapolated sequential constraint method for variational inequality over the intersection of fixed-point sets. Numer Algor. 88, 1051\u20131075 (2021)","journal-title":"Numer Algor."},{"key":"1430_CR31","doi-asserted-by":"publisher","first-page":"1135","DOI":"10.1016\/S0165-1684(03)00002-1","volume":"83","author":"K Slavakis","year":"2003","unstructured":"Slavakis, K., Yamada, I., Sakaniwa, K.: Computation of symmetric positive definite Toeplitz matrices by the hybrid steepest descent method. Signal Process. 83, 1135\u20131140 (2003)","journal-title":"Signal Process."},{"key":"1430_CR32","doi-asserted-by":"publisher","first-page":"4511","DOI":"10.1109\/TSP.2007.896252","volume":"55","author":"K Slavakis","year":"2007","unstructured":"Slavakis, K., Yamada, I.: Robust wideband beamforming by the hybrid steepest descent method. IEEE Trans Signal Process. 55, 4511\u20134522 (2007)","journal-title":"IEEE Trans Signal Process."},{"key":"1430_CR33","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/j.jat.2008.03.001","volume":"153","author":"N Takahashi","year":"2008","unstructured":"Takahashi, N., Yamada, I.: Parallel algorithms for variational inequalities over the Cartesian product of the intersections of the fixed point sets of nonexpansive mappings. J Approx Theory. 153, 139\u2013160 (2008)","journal-title":"J Approx Theory."},{"key":"1430_CR34","doi-asserted-by":"publisher","first-page":"4105","DOI":"10.1016\/j.na.2011.03.044","volume":"74","author":"F Wang","year":"2011","unstructured":"Wang, F., Xu, H.-K.: Cyclic algorithms for split feasibility problems in Hilbert spaces. Nonlinear Anal. 74, 4105\u20134111 (2011)","journal-title":"Nonlinear Anal."},{"key":"1430_CR35","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1112\/S0024610702003332","volume":"66","author":"HK Xu","year":"2020","unstructured":"Xu, H.K.: Iterative algorithm for nonlinear operators. J London Math Soc. 66, 240\u2013256 (2020)","journal-title":"J London Math Soc."},{"issue":"1","key":"1430_CR36","doi-asserted-by":"publisher","first-page":"626","DOI":"10.1137\/20M1337910","volume":"31","author":"HK Xu","year":"2021","unstructured":"Xu, H.K., Cegielski, A.: The Landweber operator approach to the split equality problem. SIAM J. Optim. 31(1), 626\u2013652 (2021)","journal-title":"SIAM J. Optim."},{"key":"1430_CR37","doi-asserted-by":"crossref","unstructured":"Yamada, I.: The hybrid steepest descent method for the variational inequality problem over the intersection of fixed point sets of nonexpansive mappings. In: Butnariu, D., Censor, Y., Reich, S. (eds.) Inherently Parallel Algorithms in Feasibility and Optimization and their Applications, pp 473\u2013504. Amsterdam, Elsevier (2001)","DOI":"10.1016\/S1570-579X(01)80028-8"},{"key":"1430_CR38","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1090\/conm\/313\/05379","volume":"313","author":"I Yamada","year":"2002","unstructured":"Yamada, I., Ogura, N., Shirakawa, N.: A numerical robust hybrid steepest descent method for the convexly constrained generalized inverse problems. Contemp Math. 313, 269\u2013305 (2002)","journal-title":"Contemp Math."},{"key":"1430_CR39","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1093\/imanum\/drl016","volume":"26","author":"L Zhang","year":"2006","unstructured":"Zhang, L., Zhou, W., Li, D.H.: A descent modified Polak-Ribiere-Polyak conjugate gradient method and its global convergence. IMA J Numer Anal. 26, 629\u2013640 (2006)","journal-title":"IMA J Numer Anal."},{"key":"1430_CR40","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1007\/s00211-006-0028-z","volume":"104","author":"L Zhang","year":"2006","unstructured":"Zhang, L., Zhou, W., Li, D.H.: Global convergence of a modified fletcher-reeves conjugate gradient method with Armijo-type line search. Numer Math. 104, 561\u2013572 (2006)","journal-title":"Numer Math."},{"key":"1430_CR41","doi-asserted-by":"publisher","first-page":"697","DOI":"10.1080\/10556780701223293","volume":"22","author":"L Zhang","year":"2007","unstructured":"Zhang, L., Zhou, W., Li, D.H.: Some descent three-term conjugate gradient methods and their global convergence. Optim Methods Softw. 22, 697\u2013711 (2007)","journal-title":"Optim Methods Softw."}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-022-01430-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11075-022-01430-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-022-01430-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,8]],"date-time":"2023-05-08T05:11:27Z","timestamp":1683522687000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11075-022-01430-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11,15]]},"references-count":41,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,6]]}},"alternative-id":["1430"],"URL":"https:\/\/doi.org\/10.1007\/s11075-022-01430-8","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,11,15]]},"assertion":[{"value":"10 March 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 September 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 November 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"<!--Emphasis Type='Bold' removed-->Conflict of interest"}}]}}