{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T15:29:53Z","timestamp":1726414193866},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2019,11,21]],"date-time":"2019-11-21T00:00:00Z","timestamp":1574294400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,11,21]],"date-time":"2019-11-21T00:00:00Z","timestamp":1574294400000},"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":["Numer Algor"],"published-print":{"date-parts":[[2020,9]]},"DOI":"10.1007\/s11075-019-00818-3","type":"journal-article","created":{"date-parts":[[2019,11,21]],"date-time":"2019-11-21T23:02:11Z","timestamp":1574377331000},"page":"353-374","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["On perturbed hybrid steepest descent method with minimization or superiorization for subdifferentiable functions"],"prefix":"10.1007","volume":"85","author":[{"given":"Mohsen","family":"Hoseini","sequence":"first","affiliation":[]},{"given":"Shahram","family":"Saeidi","sequence":"additional","affiliation":[]},{"given":"Do Sang","family":"Kim","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,11,21]]},"reference":[{"key":"818_CR1","doi-asserted-by":"crossref","first-page":"957","DOI":"10.1090\/S0002-9904-1967-11864-0","volume":"73","author":"B Halpern","year":"1967","unstructured":"Halpern, B.: Fixed points of nonexpanding maps. Bull. Am. Math. Soc. 73, 957\u2013961 (1967)","journal-title":"Bull. Am. Math. Soc."},{"key":"818_CR2","doi-asserted-by":"crossref","unstructured":"Yamada, I.: The hybrid steepest descent method for the variational inequality problems 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. Studies in Computational Mathematics, vol. 8, pp 473\u2013504. North-Holland, Amsterdam (2001)","DOI":"10.1016\/S1570-579X(01)80028-8"},{"key":"818_CR3","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1090\/conm\/313\/05379","volume":"313","author":"I Yamada","year":"2002","unstructured":"Yamada, I., Ogura, N., Shirakawa, N.: A numerically robust hybrid steepest descent method for the convexly constrained generalized inverse problems. Contemp. Math. 313, 269\u2013305 (2002)","journal-title":"Contemp. Math."},{"key":"818_CR4","doi-asserted-by":"crossref","first-page":"065008","DOI":"10.1088\/0266-5611\/26\/6\/065008","volume":"26","author":"Y Censor","year":"2010","unstructured":"Censor, Y., Davidi, R., Herman, G.T.: Perturbation resilience and superiorization of iterative algorithms. Inverse Prob. 26, 065008 (2010)","journal-title":"Inverse Prob."},{"key":"818_CR5","doi-asserted-by":"crossref","first-page":"035005","DOI":"10.1088\/0266-5611\/28\/3\/035005","volume":"28","author":"T Nikazad","year":"2012","unstructured":"Nikazad, T., Davidi, R., Herman, G.T.: Accelerated perturbation-resilient block-iterative projection methods with application to image reconstruction. Inverse Prob. 28, 035005 (2012)","journal-title":"Inverse Prob."},{"key":"818_CR6","first-page":"41","volume":"23","author":"Y Censor","year":"2015","unstructured":"Censor, Y.: Weak and strong superiorization: between feasibility-seeking and minimization. An. St. Univ. Ovidius Constanta, Ser. Mat. 23, 41\u201354 (2015)","journal-title":"An. St. Univ. Ovidius Constanta, Ser. Mat."},{"key":"818_CR7","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1007\/s10957-014-0591-x","volume":"165","author":"Y Censor","year":"2015","unstructured":"Censor, Y., Zaslavski, A.J.: Strict fej\u00e9r monotonicity by superiorization of feasibility-seeking projection methods. J. Optim. Theory Appl. 165, 172\u2013187 (2015)","journal-title":"J. Optim. Theory Appl."},{"key":"818_CR8","doi-asserted-by":"crossref","first-page":"044009","DOI":"10.1088\/1361-6420\/aa5d79","volume":"33","author":"A Cegielski","year":"2017","unstructured":"Cegielski, A., Al-Musallam, F.: Superiorization with level control. Inverse Prob. 33, 044009 (2017)","journal-title":"Inverse Prob."},{"key":"818_CR9","doi-asserted-by":"crossref","first-page":"730","DOI":"10.1007\/s10957-013-0408-3","volume":"160","author":"Y Censor","year":"2014","unstructured":"Censor, Y., Davidi, R., Herman, G.T., Schulte, R.W., Tetruashvili, L.: Projected subgradient minimization versus superiorization. J. Optim. Theory Appl. 160, 730\u2013747 (2014)","journal-title":"J. Optim. Theory Appl."},{"key":"818_CR10","unstructured":"Censor, Y.: Superiorization and perturbation resilience of algorithms: a bibliography compiled and continuously updated. http:\/\/math.haifa.ac.il\/yair\/bib-superiorization-censor.html see also: arXiv:1506.04219"},{"key":"818_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-30921-7","volume-title":"Numerical Optimization with Computational Errors, vol. 108","author":"AJ Zaslavski","year":"2016","unstructured":"Zaslavski, A.J.: Numerical Optimization with Computational Errors, vol. 108. Springer, Berlin (2016)"},{"key":"818_CR12","doi-asserted-by":"crossref","first-page":"5532","DOI":"10.1118\/1.4745566","volume":"39","author":"GT Herman","year":"2012","unstructured":"Herman, G.T., Gardu\u00f1o, E., Davidi, R., Censor, Y.: Superiorization: an optimization heuristic for medical physics. Med. Phys. 39, 5532\u20135546 (2012)","journal-title":"Med. Phys."},{"key":"818_CR13","doi-asserted-by":"crossref","first-page":"044004","DOI":"10.1088\/1361-6420\/33\/4\/044004","volume":"33","author":"AJ Zaslavski","year":"2017","unstructured":"Zaslavski, A.J.: Asymptotic behavior of two algorithms for solving common fixed point problems. Inverse Prob. 33, 044004 (2017)","journal-title":"Inverse Prob."},{"key":"818_CR14","doi-asserted-by":"crossref","first-page":"044006","DOI":"10.1088\/1361-6420\/33\/4\/044006","volume":"33","author":"Y Censor","year":"2017","unstructured":"Censor, Y.: Can linear superiorization be useful for linear optimization problems. Inverse Prob. 33, 044006 (2017)","journal-title":"Inverse Prob."},{"key":"818_CR15","doi-asserted-by":"crossref","first-page":"044007","DOI":"10.1088\/1361-6420\/33\/4\/044007","volume":"33","author":"H He","year":"2017","unstructured":"He, H., Xu, H.K.: Perturbation resilience and superiorization methodology of averaged mappings. Inverse Prob. 33, 044007 (2017)","journal-title":"Inverse Prob."},{"key":"818_CR16","doi-asserted-by":"crossref","first-page":"1219","DOI":"10.1007\/s11075-018-0524-0","volume":"80","author":"Y Censor","year":"2019","unstructured":"Censor, Y., Heaton, H., Schulte, R.: Derivative-free superiorization with component-wise perturbations. Numer. Algor. 80, 1219\u20131240 (2019)","journal-title":"Numer. Algor."},{"key":"818_CR17","doi-asserted-by":"crossref","first-page":"911","DOI":"10.1007\/s10957-013-0397-2","volume":"160","author":"S Saeidi","year":"2014","unstructured":"Saeidi, S., Kim, D.S.: Combination of the hybrid steepest-descent method and the viscosity approximation. J. Optim. Theory Appl. 160, 911\u2013930 (2014)","journal-title":"J. Optim. Theory Appl."},{"key":"818_CR18","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-48311-5","volume-title":"Convex Analysis and Monotone Operator Theory in Hilbert Spaces","author":"HH Bauschke","year":"2017","unstructured":"Bauschke, H.H., Combettes, P.L.: Convex Analysis and Monotone Operator Theory in Hilbert Spaces. Springer, New York (2017)"},{"key":"818_CR19","doi-asserted-by":"crossref","unstructured":"Mordukhovich, B.S.: Variational analysis and applications. Vol. 8 springer (2018)","DOI":"10.1007\/978-3-319-92775-6"},{"key":"818_CR20","doi-asserted-by":"crossref","first-page":"240","DOI":"10.1112\/S0024610702003332","volume":"66","author":"HK Xu","year":"2002","unstructured":"Xu, H.K.: Iterative algorithms for nonlinear operators. J. London Math. Soc. 66, 240\u2013256 (2002)","journal-title":"J. London Math. Soc."},{"key":"818_CR21","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1023\/B:JOTA.0000005048.79379.b6","volume":"119","author":"HK Xu","year":"2003","unstructured":"Xu, H.K., Kim, T.H.: Convergence ofhybrid steepest-descent method for variational inequalities. J. Optim. Theory Appl. 119, 185\u2013201 (2003)","journal-title":"J. Optim. Theory Appl."},{"key":"818_CR22","doi-asserted-by":"crossref","first-page":"619","DOI":"10.1081\/NFA-200045815","volume":"25","author":"I Yamada","year":"2004","unstructured":"Yamada, I., Ogura, N.: Hybrid steepest descent method for variational inequality problem over the fixed point set of certain quasi-nonexpansive mappings. Numer. Funct. Anal. Optim. 25, 619\u2013655 (2004)","journal-title":"Numer. Funct. Anal. Optim."},{"key":"818_CR23","doi-asserted-by":"crossref","first-page":"1463","DOI":"10.1080\/02331934.2016.1147038","volume":"65","author":"A Cegielski","year":"2016","unstructured":"Cegielski, A., Al-Musallam, F.: Strong convergence of a hybrid steepest descent method for the split common fixed point problem. Optimization 65, 1463\u20131476 (2016)","journal-title":"Optimization"},{"key":"818_CR24","doi-asserted-by":"crossref","first-page":"659","DOI":"10.1023\/A:1023073621589","volume":"116","author":"HK Xu","year":"2003","unstructured":"Xu, H.K.: An iterative approach to quadratic optimization. J. Optim. Theory Appl. 116, 659\u2013678 (2003)","journal-title":"J. Optim. Theory Appl."},{"key":"818_CR25","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1006\/jmaa.1999.6615","volume":"241","author":"A Moudafi","year":"2000","unstructured":"Moudafi, A.: Viscosity approximation methods for fixed-points problems. J. Math. Anal. Appl. 241, 46\u201355 (2000)","journal-title":"J. Math. Anal. Appl."},{"key":"818_CR26","doi-asserted-by":"crossref","first-page":"1257","DOI":"10.1016\/j.na.2006.01.016","volume":"66","author":"J Garcia-Falset","year":"2007","unstructured":"Garcia-Falset, J., Llorens-Fuster, E., Prus, S.: The fixed point property for mappings admitting a center. Nonlinear Anal. 66, 1257\u20131274 (2007)","journal-title":"Nonlinear Anal."},{"key":"818_CR27","doi-asserted-by":"crossref","first-page":"044003","DOI":"10.1088\/1361-6420\/33\/4\/044003","volume":"33","author":"M Yamagishi","year":"2017","unstructured":"Yamagishi, M., Yamada, I.: Nonexpansiveness of a linearized augmented Lagrangian operator for hierarchical convex optimization. Inverse Prob. 33, 044003 (2017)","journal-title":"Inverse Prob."},{"key":"818_CR28","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1007\/s11075-017-0310-4","volume":"77","author":"C Bargetz","year":"2018","unstructured":"Bargetz, C., Reich, S., Zalas, R.: Convergence properties of dynamic string-averaging projection methods in the presence of perturbations. Numer. Algor. 77, 185\u2013209 (2018)","journal-title":"Numer. Algor."},{"key":"818_CR29","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."}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-019-00818-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11075-019-00818-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-019-00818-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,20]],"date-time":"2020-11-20T02:56:30Z","timestamp":1605840990000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11075-019-00818-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11,21]]},"references-count":29,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,9]]}},"alternative-id":["818"],"URL":"https:\/\/doi.org\/10.1007\/s11075-019-00818-3","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"type":"print","value":"1017-1398"},{"type":"electronic","value":"1572-9265"}],"subject":[],"published":{"date-parts":[[2019,11,21]]},"assertion":[{"value":"18 December 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 September 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 November 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}