메뉴 건너뛰기




Volumn 2057, Issue , 2012, Pages 1-314

Iterative methods for fixed point problems in Hilbert spaces

Author keywords

[No Author keywords available]

Indexed keywords


EID: 84868334106     PISSN: 00758434     EISSN: None     Source Type: Book Series    
DOI: 10.1007/978-3-642-30901-4_1     Document Type: Article
Times cited : (248)

References (369)
  • 1
    • 0000026159 scopus 로고
    • The relaxation method for linear inequalities
    • S. Agmon, The relaxation method for linear inequalities. Can. J. Math. 6, 382-392 (1954)
    • (1954) Can. J. Math. , vol.6 , pp. 382-392
    • Agmon, S.1
  • 2
    • 0011353229 scopus 로고
    • An interior point algorithm for the convex feasibility problem
    • R. Aharoni, A. Berman, Y. Censor, An interior point algorithm for the convex feasibility problem. Adv. Appl. Math. 4, 479-489 (1983)
    • (1983) Adv. Appl. Math. , vol.4 , pp. 479-489
    • Aharoni, R.1    Berman, A.2    Censor, Y.3
  • 3
    • 0000198744 scopus 로고
    • Block-iterative projection methods for parallel computation of solutions to convex feasibility problems
    • R. Aharoni, Y. Censor, Block-iterative projection methods for parallel computation of solutions to convex feasibility problems. Lin. Algebra Appl. 120, 165-175 (1989)
    • (1989) Lin. Algebra Appl. , vol.120 , pp. 165-175
    • Aharoni, R.1    Censor, Y.2
  • 5
    • 41449115301 scopus 로고    scopus 로고
    • Block-iterative algorithms for solving convex feasibility problems in hilbert and in banach spaces
    • A. Aleyner, S. Reich, Block-iterative algorithms for solving convex feasibility problems in Hilbert and in Banach spaces. J. Math. Anal. Appl. 343, 427-435 (2008)
    • (2008) J. Math. Anal. Appl. , vol.343 , pp. 427-435
    • Aleyner, A.1    Reich, S.2
  • 6
    • 73349091224 scopus 로고    scopus 로고
    • Random products of quasi-nonexpansive mappings in hilbert space
    • A. Aleyner, S. Reich, Random products of quasi-nonexpansive mappings in Hilbert space. J. Convex Anal. 16, 633-640 (2009)
    • (2009) J. Convex Anal. , vol.16 , pp. 633-640
    • Aleyner, A.1    Reich, S.2
  • 8
    • 0013467971 scopus 로고
    • Convergence of random products of contractions in hilbert space
    • Szeged
    • I. Amemiya, T. Ando, Convergence of random products of contractions in Hilbert space. Acta Sci. Math. (Szeged) 26, 239-244 (1965)
    • (1965) Acta Sci. Math. , vol.26 , pp. 239-244
    • Amemiya, I.1    Ando, T.2
  • 9
    • 0021618633 scopus 로고
    • Connections between the cimmino-method and the kaczmarz-method for the solution of singular and regular systems of equations
    • R. Ansorge, Connections between the Cimmino-method and the Kaczmarz-method for solution of singular and regular systems of equations. Computing 33, 367-375 (1984) (Pubitemid 15459762)
    • (1984) Computing (Vienna/New York) , vol.33 , Issue.3-4 , pp. 367-375
    • Ansorge, R.1
  • 11
    • 5844297152 scopus 로고
    • Theory of reproducing kernels
    • N. Aronszajn, Theory of reproducing kernels. Trans. Am. Math. Soc. 68, 337-404 (1950)
    • (1950) Trans. Am. Math. Soc. , vol.68 , pp. 337-404
    • Aronszajn, N.1
  • 13
    • 84868335719 scopus 로고
    • Convergence of the kaczmarz projection algorithm
    • (in Russian)
    • V.N. Babenko, Convergence of the Kaczmarz projection algorithm. Zh. Vychisl. Mat. Mat. Fiz. 24, 1571-1573 (1984) (in Russian)
    • (1984) Zh. Vychisl. Mat. Mat. Fiz. , vol.24 , pp. 1571-1573
    • Babenko, V.N.1
  • 14
    • 0002057574 scopus 로고
    • On the asymptotic behavior of nonexpansive mappings and semigroups in banach spaces
    • J.B. Baillon, R.E. Bruck, S. Reich, On the asymptotic behavior of nonexpansive mappings and semigroups in Banach spaces. Houston J. Math. 4, 1-9 (1978)
    • (1978) Houston J. Math. , vol.4 , pp. 1-9
    • Baillon, J.B.1    Bruck, R.E.2    Reich, S.3
  • 15
    • 0000307498 scopus 로고
    • Sur les opérations dans les ensembles abstraits et leur application aux équations intégrals
    • S. Banach, Sur les opérations dans les ensembles abstraits et leur application aux équations intégrals. Fundamenta Mathematicae 3, 133-181 (1922)
    • (1922) Fundamenta Mathematicae , vol.3 , pp. 133-181
    • Banach, S.1
  • 16
    • 0000746478 scopus 로고
    • A norm convergence result on random products of relaxed projections in hilbert space
    • H.H. Bauschke, A norm convergence result on random products of relaxed projections in Hilbert space. Trans. Am. Math. Soc. 347, 1365-1373 (1995)
    • (1995) Trans. Am. Math. Soc. , vol.347 , pp. 1365-1373
    • Bauschke, H.H.1
  • 17
    • 0003851536 scopus 로고    scopus 로고
    • Ph.D. Thesis, Department of Mathematics, Simon Fraser, University, Burnaby, BC, Canada
    • H.H. Bauschke, Projection Algorithms and Monotone Operators, Ph.D. Thesis, Department of Mathematics, Simon Fraser, University, Burnaby, BC, Canada, 1996
    • (1996) Projection Algorithms and Monotone Operators
    • Bauschke, H.H.1
  • 18
    • 0030586523 scopus 로고    scopus 로고
    • The approximation of fixed points of compositions of nonexpansive mappings in Hilbert space
    • DOI 10.1006/jmaa.1996.0308
    • H.H. Bauschke, The approximation of fixed points of compositions of nonexpansive mapping in Hilbert space. J. Math. Anal. Appl. 202, 150-159 (1996) (Pubitemid 126163209)
    • (1996) Journal of Mathematical Analysis and Applications , vol.202 , Issue.1 , pp. 150-159
    • Bauschke, H.H.1
  • 19
    • 0037237318 scopus 로고    scopus 로고
    • The composition of the projections onto closed convex sets in hilbert space is asymptotically regular
    • H.H. Bauschke, The composition of the projections onto closed convex sets in Hilbert space is asymptotically regular. Proc. Am. Math. Soc. 131, 141-146 (2002)
    • (2002) Proc. Am. Math. Soc. , vol.131 , pp. 141-146
    • Bauschke, H.H.1
  • 20
    • 0001448913 scopus 로고
    • On the convergence of von neumann's alternating projection algorithm for two sets
    • H.H. Bauschke, J. Borwein, On the convergence of von Neumann's alternating projection algorithm for two sets. Set-Valued Anal. 1, 185-212 (1993)
    • (1993) Set-Valued Anal. , vol.1 , pp. 185-212
    • Bauschke, H.H.1    Borwein, J.2
  • 21
    • 0037976260 scopus 로고
    • Dykstra's alternating projection algorithm for two sets
    • H.H. Bauschke, J. Borwein, Dykstra's alternating projection algorithm for two sets. J. Approx. Theor. 79, 418-443 (1994)
    • (1994) J. Approx. Theor. , vol.79 , pp. 418-443
    • Bauschke, H.H.1    Borwein, J.2
  • 22
    • 0030246542 scopus 로고    scopus 로고
    • On projection algorithms for solving convex feasibility problems
    • H.H. Bauschke, J. Borwein, On projection algorithms for solving convex feasibility problems. SIAM Rev. 38, 367-426 (1996) (Pubitemid 126599619)
    • (1996) SIAM Review , vol.38 , Issue.3 , pp. 367-426
    • Bauschke, H.H.1    Borwein, J.M.2
  • 23
    • 0002351732 scopus 로고    scopus 로고
    • The method of cyclic projections for closed convex sets in hilbert space
    • H.H. Bauschke, J.M. Borwein, A.S. Lewis, The method of cyclic projections for closed convex sets in Hilbert space. Contemp. Math. 204, 1-38 (1997)
    • (1997) Contemp. Math. , vol.204 , pp. 1-38
    • Bauschke, H.H.1    Borwein, J.M.2    Lewis, A.S.3
  • 24
    • 0035351666 scopus 로고    scopus 로고
    • A weak-to-strong convergence principle for Fejér-monotone methods in Hilbert spaces
    • H.H. Bauschke, P.L. Combettes, A weak-to-strong convergence principle for Fejér-monotone methods in Hilbert spaces. Math. Oper. Res. 26, 248-264 (2001) (Pubitemid 34050614)
    • (2001) Mathematics of Operations Research , vol.26 , Issue.2 , pp. 248-264
    • Bauschke, H.H.1    Combettes, P.L.2
  • 25
    • 33645751712 scopus 로고    scopus 로고
    • Extrapolation algorithm for affine-convex feasibility problems
    • DOI 10.1007/s11075-005-9010-6
    • H.H. Bauschke, P.L. Combettes, S.G. Kruk, Extrapolation algorithm for affine-convex feasibility problems. Numer. Algorithms 41, 239-274 (2006) (Pubitemid 43550992)
    • (2006) Numerical Algorithms , vol.41 , Issue.3 , pp. 239-274
    • Bauschke, H.H.1    Combettes, P.L.2    Kruk, S.G.3
  • 26
    • 0038266150 scopus 로고    scopus 로고
    • Phase retrieval, error reduction algorithm, and fienup variants: A view from convex optimization
    • H.H. Bauschke, P.L. Combettes, D.R. Luke, Phase retrieval, error reduction algorithm, and Fienup variants: A view from convex optimization. J. Opt. Soc. Am. A 19, 1334-1345 (2002)
    • (2002) J. Opt. Soc. Am. A , vol.19 , pp. 1334-1345
    • Bauschke, H.H.1    Combettes, P.L.2    Luke, D.R.3
  • 27
    • 0041573292 scopus 로고    scopus 로고
    • Hybrid projection-reflection method for phase retrieval
    • H.H. Bauschke, P.L. Combettes, D.R. Luke, Hybrid projection-reflection method for phase retrieval. J. Opt. Soc. Am. A 20, 1025-1034 (2003)
    • (2003) J. Opt. Soc. Am. A , vol.20 , pp. 1025-1034
    • Bauschke, H.H.1    Combettes, P.L.2    Luke, D.R.3
  • 28
    • 2942687455 scopus 로고    scopus 로고
    • Finding best approximation pairs relative to two closed convex sets in Hilbert spaces
    • DOI 10.1016/j.jat.2004.02.006
    • H.H. Bauschke, P.L. Combettes, D.R. Luke, Finding best approximation pairs relative to two closed convex sets in Hilbert spaces. J. Approx. Theor. 127, 178-192 (2004) (Pubitemid 38782197)
    • (2004) Journal of Approximation Theory , vol.127 , Issue.2 , pp. 178-192
    • Bauschke, H.H.1    Combettes, P.L.2    Luke, D.R.3
  • 29
    • 33745856582 scopus 로고    scopus 로고
    • A strongly convergent reflection method for finding the projection onto the intersection of two closed convex sets in a Hilbert space
    • DOI 10.1016/j.jat.2006.01.003, PII S0021904506000049
    • H.H. Bauschke, P.L. Combettes, D.R. Luke, A strongly convergent reflection method for finding the projection onto the intersection of two closed convex sets in a Hilbert space. J. Approx. Theor. 141, 63-69 (2006) (Pubitemid 44028643)
    • (2006) Journal of Approximation Theory , vol.141 , Issue.1 , pp. 63-69
    • Bauschke, H.H.1    Combettes, P.L.2    Luke, D.R.3
  • 31
    • 3843099227 scopus 로고    scopus 로고
    • Reflection-projection method for convex feasibility problems with an obtuse cone
    • DOI 10.1023/B:JOTA.0000025708.31430.22
    • H.H. Bauschke, S.G. Kruk, Reflection-projection method for convex feasibility problems with an obtuse cone. J. Optim. Theor. Appl. 120, 503-531 (2004) (Pubitemid 39046632)
    • (2004) Journal of Optimization Theory and Applications , vol.120 , Issue.3 , pp. 503-531
    • Bauschke, H.H.1    Kruk, S.G.2
  • 32
    • 0347269125 scopus 로고    scopus 로고
    • Projection and proximal point methods: Convergence results and counterexamples
    • H.H. Bauschke, E. Matoušková, S. Reich, Projection and proximal point methods: convergence results and counterexamples. Nonlinear Anal. 56, 715-738 (2004)
    • (2004) Nonlinear Anal. , vol.56 , pp. 715-738
    • Bauschke, H.H.1    Matoušková, E.2    Reich, S.3
  • 34
    • 0000654737 scopus 로고
    • A direct projection method for sparse linear systems
    • M. Benzi, C.D. Meyer, A direct projection method for sparse linear systems. SIAM J. Sci. Comput. 16, 1159-1176 (1995)
    • (1995) SIAM J. Sci. Comput. , vol.16 , pp. 1159-1176
    • Benzi, M.1    Meyer, C.D.2
  • 39
    • 33947126427 scopus 로고    scopus 로고
    • Energy-based sensor network source localization via projection onto convex sets
    • DOI 10.1109/TSP.2006.879312
    • D. Blatt, A.O. Hero, Energy-based sensor network source localization via projection onto convex sets (POCS). IEEE Trans. Signal Process. 54, 3614-3619 (2006) (Pubitemid 46405397)
    • (2006) IEEE Transactions on Signal Processing , vol.54 , Issue.9 , pp. 3614-3619
    • Blatt, D.1    Hero III, A.O.2
  • 41
    • 0000713765 scopus 로고
    • Row projection methods for large nonsymmetric linear systems
    • R. Bramley, A. Sameh, Row projection methods for large nonsymmetric linear systems. SIAM J. Sci. Stat. Comput. 13, 168-193 (1992)
    • (1992) SIAM J. Sci. Stat. Comput. , vol.13 , pp. 168-193
    • Bramley, R.1    Sameh, A.2
  • 42
    • 0001263852 scopus 로고
    • Finding the common point of convex sets by the method of successive projection (in Russian)
    • L.M. Bregman, Finding the common point of convex sets by the method of successive projection (in Russian). Dokl. Akad. Nauk SSSR 162, 487-490 (1965);
    • (1965) Dokl. Akad. Nauk SSSR , vol.162 , pp. 487-490
    • Bregman, L.M.1
  • 43
    • 0001336448 scopus 로고
    • English translation
    • English translation in: Soviet Math. Dokl. 6, 688-692 (1965)
    • (1965) Soviet Math. Dokl. , vol.6 , pp. 688-692
  • 44
    • 34250942645 scopus 로고
    • Über abbildung von mannigfaltigkeiten
    • L.E.J. Brouwer, Über Abbildung von Mannigfaltigkeiten. Math. Ann. 71, 97-115 (1912)
    • (1912) Math. Ann. , vol.71 , pp. 97-115
    • Brouwer, L.E.J.1
  • 45
    • 0000963707 scopus 로고
    • Fixed-point theorems for noncompact mappings in hilbert space
    • F.E. Browder, Fixed-point theorems for noncompact mappings in Hilbert space. Proc. Nat. Acad. Sci. USA 53, 1272-1276 (1965)
    • (1965) Proc. Nat. Acad. Sci. USA , vol.53 , pp. 1272-1276
    • Browder, F.E.1
  • 46
    • 0000445928 scopus 로고
    • Nonexpansive nonlinear operators in a banach space
    • F.E. Browder, Nonexpansive nonlinear operators in a Banach space. Proc. Nat. Acad. Sci. USA 54, 1041-1044 (1965)
    • (1965) Proc. Nat. Acad. Sci. USA , vol.54 , pp. 1041-1044
    • Browder, F.E.1
  • 47
    • 0002728205 scopus 로고
    • Convergence of approximants to fixed points of nonexpansive nonlinear mappings in banach spaces
    • F.E. Browder, Convergence of approximants to fixed points of nonexpansive nonlinear mappings in Banach spaces. Arch. Rational Mech. Anal. 24, 82-90 (1967)
    • (1967) Arch. Rational Mech. Anal. , vol.24 , pp. 82-90
    • Browder, F.E.1
  • 48
    • 0000887243 scopus 로고
    • Convergence theorems for sequences of nonlinear operators in banach spaces
    • F.E. Browder, Convergence theorems for sequences of nonlinear operators in Banach spaces. Math. Zeitschr. 100, 201-225 (1967)
    • (1967) Math. Zeitschr. , vol.100 , pp. 201-225
    • Browder, F.E.1
  • 49
    • 84968509692 scopus 로고
    • The solution by iteration of nonlinear functional equations in banach spaces
    • F.E. Browder, W.V. Petryshyn, The solution by iteration of nonlinear functional equations in Banach spaces. Bull. Am. Math. Soc. 72, 571-575 (1966)
    • (1966) Bull. Am. Math. Soc. , vol.72 , pp. 571-575
    • Browder, F.E.1    Petryshyn, W.V.2
  • 50
    • 84972558718 scopus 로고
    • Nonexpansive projections on subsets of banach spaces
    • R.E. Bruck, Nonexpansive projections on subsets of Banach spaces. Pac. J. Math. 47, 341-355 (1973)
    • (1973) Pac. J. Math. , vol.47 , pp. 341-355
    • Bruck, R.E.1
  • 51
    • 5244239809 scopus 로고
    • Random products of contractions in metric and banach spaces
    • R.E. Bruck, Random products of contractions in metric and Banach spaces. J. Math. Anal. Appl. 88, 319-332 (1982)
    • (1982) J. Math. Anal. Appl. , vol.88 , pp. 319-332
    • Bruck, R.E.1
  • 52
    • 0000256894 scopus 로고
    • Nonexpansive projections and resolvents of accretive operators in banach spaces
    • R.E. Bruck, S. Reich, Nonexpansive projections and resolvents of accretive operators in Banach spaces. Houston J. Math. 3, 459-470 (1977)
    • (1977) Houston J. Math. , vol.3 , pp. 459-470
    • Bruck, R.E.1    Reich, S.2
  • 53
    • 27844548828 scopus 로고    scopus 로고
    • An outer approximation method for the variational inequality problem
    • DOI 10.1137/S0363012902415487
    • R.S. Burachik, J.O. Lopes, B.F. Svaiter, An outer approximation method for the variational inequality problem. SIAM J. Contr. Optim. 43, 2071-2088 (2005) (Pubitemid 41641377)
    • (2005) SIAM Journal on Control and Optimization , vol.43 , Issue.6 , pp. 2071-2088
    • Burachik, R.S.1    Lopes, J.O.2    Svaiter, B.F.3
  • 54
    • 5744237139 scopus 로고
    • On the behavior of a block-iterative projection method for solving convex feasibility problems
    • D. Butnariu, Y. Censor, On the behavior of a block-iterative projection method for solving convex feasibility problems. Int. J. Comp. Math. 34, 79-94 (1990)
    • (1990) Int. J. Comp. Math. , vol.34 , pp. 79-94
    • Butnariu, D.1    Censor, Y.2
  • 55
    • 67649551066 scopus 로고    scopus 로고
    • On the behavior of subgradient projections methods for convex feasibility problems in euclidean spaces
    • D. Butnariu, Y. Censor, P. Gurfil, E. Hadar, On the behavior of subgradient projections methods for convex feasibility problems in Euclidean spaces. SIAM J. Opt. 19, 786-807 (2008)
    • (2008) SIAM J. Opt. , vol.19 , pp. 786-807
    • Butnariu, D.1    Censor, Y.2    Gurfil, P.3    Hadar, E.4
  • 56
    • 0036538286 scopus 로고    scopus 로고
    • Iterative oblique projection onto convex sets and the split feasibility problem
    • DOI 10.1088/0266-5611/18/2/310, PII S0266561102271579
    • C. Byrne, Iterative oblique projection onto convex sets and the split feasibility problem. Inverse Probl. 18, 441-453 (2002) (Pubitemid 34428529)
    • (2002) Inverse Problems , vol.18 , Issue.2 , pp. 441-453
    • Byrne, C.1
  • 57
    • 1342265919 scopus 로고    scopus 로고
    • A unified treatment of some iterative algorithms in signal processing and image reconstruction
    • C. Byrne, A unified treatment of some iterative algorithms in signal processing and image reconstruction. Inverse Probl. 20, 103-120 (2004)
    • (2004) Inverse Probl. , vol.20 , pp. 103-120
    • Byrne, C.1
  • 59
    • 84867130633 scopus 로고    scopus 로고
    • Bounds on the largest singular value of a matrix and the convergence of simultaneous and block-iterative algorithms for sparse linear systems
    • C.L. Byrne, Bounds on the largest singular value of a matrix and the convergence of simultaneous and block-iterative algorithms for sparse linear systems. Int. Trans. Oper. Res. 16, 465-479 (2009)
    • (2009) Int. Trans. Oper. Res. , vol.16 , pp. 465-479
    • Byrne, C.L.1
  • 60
    • 33746243883 scopus 로고    scopus 로고
    • Parallel block-iterative reconstruction algorithms for binary tomography
    • T.D. Capricelli, P.L. Combettes, Parallel block-iterative reconstruction algorithms for binary tomography. Electron. Notes Discr. Math. 20, 263-280 (2005)
    • (2005) Electron. Notes Discr. Math. , vol.20 , pp. 263-280
    • Capricelli, T.D.1    Combettes, P.L.2
  • 61
    • 0032051665 scopus 로고    scopus 로고
    • A geostatistical framework for incorporating seismic tomography auxiliary data into hydraulic conductivity estimation
    • DOI 10.1016/S0022-1694(98)00084-5, PII S0022169498000845
    • G. Casssiani, G. Böhm, A. Vesnaver, R. Nicolich, A geostatistical framework for incorporating seismic tomography auxiliary data into hydraulic conductivity estimation. J. Hydrol. 206, 58-74 (1998) (Pubitemid 28265846)
    • (1998) Journal of Hydrology , vol.206 , Issue.1-2 , pp. 58-74
    • Cassiani, G.1    Bohm, G.2    Vesnaver, A.3    Nicolich, R.4
  • 64
    • 84868315201 scopus 로고
    • Relaxation methods in convex optimization problems (in polish)
    • Institute of Mathematics, Higher College of Engineering, Zielona Góra
    • A. Cegielski, Relaxation Methods in Convex Optimization Problems (in Polish). Monographs, Vol. 67, Institute of Mathematics, Higher College of Engineering, Zielona Góra, 1993
    • (1993) Monographs , vol.67
    • Cegielski, A.1
  • 65
    • 0345295873 scopus 로고
    • Projection onto an acute cone and convex feasibility problems
    • by J. Henry i J.-P. Yvon Springer, London
    • A. Cegielski, in Projection Onto an Acute Cone and Convex Feasibility Problems, ed. by J. Henry i J.-P. Yvon. Lecture Notes in Control and Inform. Sci., Vol. 197 (Springer, London, 1994), pp. 187-194
    • (1994) Lecture Notes in Control and Inform. Sci. , vol.197 , pp. 187-194
    • Cegielski, A.1
  • 66
    • 0013108490 scopus 로고    scopus 로고
    • A method of projection onto an acute cone with level control in convex minimization
    • A. Cegielski, A method of projection onto an acute cone with level control in convex minimization. Math. Program. 85, 469-490 (1999)
    • (1999) Math. Program , vol.85 , pp. 469-490
    • Cegielski, A.1
  • 67
    • 0035885360 scopus 로고    scopus 로고
    • Obtuse cones and Gram matrices with nonnegative inverse
    • DOI 10.1016/S0024-3795(01)00284-1, PII S0024379501002841
    • A. Cegielski, Obtuse cones and Gram matrices with nonnegative inverse. Lin. Algebra Appl. 335, 167-181 (2001) (Pubitemid 33676055)
    • (2001) Linear Algebra and Its Applications , vol.335 , Issue.1-3 , pp. 167-181
    • Cegielski, A.1
  • 68
    • 35348971022 scopus 로고    scopus 로고
    • A generalization of the opial's theorem
    • A. Cegielski, A generalization of the Opial's theorem. Contr. Cybern. 36, 601-610 (2007)
    • (2007) Contr. Cybern. , vol.36 , pp. 601-610
    • Cegielski, A.1
  • 69
    • 33947577015 scopus 로고    scopus 로고
    • Convergence of the projected surrogate constraints method for the linear split feasibility problems
    • A. Cegielski, Convergence of the projected surrogate constraints method for the linear split feasibility problems. J. Convex Anal. 14, 169-183 (2007)
    • (2007) J. Convex Anal. , vol.14 , pp. 169-183
    • Cegielski, A.1
  • 70
    • 45749130611 scopus 로고    scopus 로고
    • Projection methods for the linear split feasibility problems
    • A. Cegielski, Projection methods for the linear split feasibility problems. Optimization 57, 491-504 (2008)
    • (2008) Optimization , vol.57 , pp. 491-504
    • Cegielski, A.1
  • 71
    • 79955764039 scopus 로고    scopus 로고
    • Generalized relaxations of nonexpansive operators and convex feasibility problems
    • A. Cegielski, Generalized relaxations of nonexpansive operators and convex feasibility problems. Contemp. Math. 513, 111-123 (2010)
    • (2010) Contemp. Math. , vol.513 , pp. 111-123
    • Cegielski, A.1
  • 73
    • 84862007245 scopus 로고    scopus 로고
    • Extrapolation and local acceleration of an iterative process for common fixed point problems
    • A. Cegielski, Y. Censor, Extrapolation and local acceleration of an iterative process for common fixed point problems. J. Math. Anal. Appl. 394, 809-818 (2012)
    • (2012) J. Math. Anal. Appl. , vol.394 , pp. 809-818
    • Cegielski, A.1    Censor, Y.2
  • 74
    • 0013147453 scopus 로고    scopus 로고
    • Selection strategies in projection methods for convex minimization problems
    • A. Cegielski, R. Dylewski, Selection strategies in projection methods for convex minimization problems. Discuss. Math. Differ. Incl. Contr. Optim. 22, 97-123 (2002)
    • (2002) Discuss. Math. Differ. Incl. Contr. Optim. , vol.22 , pp. 97-123
    • Cegielski, A.1    Dylewski, R.2
  • 75
    • 0037394920 scopus 로고    scopus 로고
    • Residual selection in a projection method for convex minimization problems
    • DOI 10.1080/0233193031000079883
    • A. Cegielski, R. Dylewski, Residual selection in a projection method for convex minimization problems. Optimization 52, 211-220 (2003) (Pubitemid 36470911)
    • (2003) Optimization , vol.52 , Issue.2 , pp. 211-220
    • Cegielski, A.1    Dylewski, R.2
  • 76
    • 78650043897 scopus 로고    scopus 로고
    • Variable target value relaxed alternating projection method
    • A. Cegielski, R. Dylewski, Variable target value relaxed alternating projection method. Comput. Optim. Appl. 47, 455-476 (2010)
    • (2010) Comput. Optim. Appl. , vol.47 , pp. 455-476
    • Cegielski, A.1    Dylewski, R.2
  • 77
    • 38149078967 scopus 로고    scopus 로고
    • Incomplete alternating projection method for large inconsistent linear systems
    • A. Cegielski, A. Suchocka, Incomplete alternating projection method for large inconsistent linear systems. Lin. Algebra Appl. 428, 1313-1324 (2008)
    • (2008) Lin. Algebra Appl. , vol.428 , pp. 1313-1324
    • Cegielski, A.1    Suchocka, A.2
  • 78
    • 69649097714 scopus 로고    scopus 로고
    • Relaxed alternating projection methods
    • A. Cegielski, A. Suchocka, Relaxed alternating projection methods. SIAM J. Optim. 19, 1093-1106 (2008)
    • (2008) SIAM J. Optim. , vol.19 , pp. 1093-1106
    • Cegielski, A.1    Suchocka, A.2
  • 79
    • 84868336319 scopus 로고    scopus 로고
    • Methods for variational inequality problem over the intersection of fixed point sets of quasi-nonexpansive operators
    • (in print)
    • A. Cegielski, R. Zalas, Methods for variational inequality problem over the intersection of fixed point sets of quasi-nonexpansive operators (2012) Numer. Funct. Anal. Optim. (in print)
    • (2012) Numer. Funct. Anal. Optim.
    • Cegielski, A.1    Zalas, R.2
  • 80
    • 0000439725 scopus 로고
    • Row-action methods for huge and sparse systems and their applications
    • Y. Censor, Row-action methods for huge and sparse systems and their applications. SIAM Rev. 23, 444-466 (1981)
    • (1981) SIAM Rev. , vol.23 , pp. 444-466
    • Censor, Y.1
  • 81
    • 2442750738 scopus 로고
    • Iterative methods for convex feasibility problems
    • Y. Censor, Iterative methods for convex feasibility problems. Ann. Discrete Math. 20, 83-91 (1984)
    • (1984) Ann. Discrete Math. , vol.20 , pp. 83-91
    • Censor, Y.1
  • 82
    • 0022013462 scopus 로고
    • Automatic relaxation method for solving interval linear inequalities
    • DOI 10.1016/0022-247X(85)90127-1
    • Y. Censor, An automatic relaxation method for solving interval linear inequalities. J. Math. Anal. Appl. 106, 19-25 (1985) (Pubitemid 15476170)
    • (1985) Journal of Mathematical Analysis and Applications , vol.106 , Issue.1 , pp. 19-25
    • Censor Yair1
  • 83
    • 34250085515 scopus 로고
    • Parallel application of block-iterative methods in medical imaging and radiation therapy
    • Y. Censor, Parallel application of block-iterative methods in medical imaging and radiation therapy. Math. Program. 42, 307-325 (1988)
    • (1988) Math. Program. , vol.42 , pp. 307-325
    • Censor, Y.1
  • 84
    • 0035892315 scopus 로고    scopus 로고
    • Binary steering in discrete tomography reconstruction with sequential and simultaneous iterative algorithms
    • DOI 10.1016/S0024-3795(01)00470-0, PII S0024379501004700
    • Y. Censor, Binary steering in discrete tomography reconstruction with sequential and simultaneous iterative algorithms. Lin. Algebra Appl. 339, 111-124 (2001) (Pubitemid 33676098)
    • (2001) Linear Algebra and Its Applications , vol.339 , Issue.1-3 , pp. 111-124
    • Censor, Y.1
  • 85
    • 0000488266 scopus 로고
    • On the use of cimmino's simultaneous projections method for computing a solution of the inverse problem in radiation therapy treatment planning
    • Y. Censor, M.D. Altschuler, W.D. Powlis, On the use of Cimmino's simultaneous projections method for computing a solution of the inverse problem in radiation therapy treatment planning. Inverse Probl. 4, 607-623 (1988)
    • (1988) Inverse Probl. , vol.4 , pp. 607-623
    • Censor, Y.1    Altschuler, M.D.2    Powlis, W.D.3
  • 86
    • 38349077143 scopus 로고    scopus 로고
    • On linear infeasibility arising in intensity-modulated radiation therapy inverse planning
    • Y. Censor, A. Ben-Israel, Y. Xiao, J.M. Galvin, On linear infeasibility arising in intensity-modulated radiation therapy inverse planning. Lin. Algebra Appl. 428, 1406-1420 (2008)
    • (2008) Lin. Algebra Appl. , vol.428 , pp. 1406-1420
    • Censor, Y.1    Ben-Israel, A.2    Xiao, Y.3    Galvin, J.M.4
  • 87
    • 33646480792 scopus 로고    scopus 로고
    • A unified approach for inversion problems in intensity-modulated radiation therapy
    • Y. Censor, T. Bortfeld, B. Martin, A. Trofimov, A unified approach for inversion problems in intensity-modulated radiation therapy. Phys. Med. Biol. 51, 2353-2365 (2006)
    • (2006) Phys. Med. Biol. , vol.51 , pp. 2353-2365
    • Censor, Y.1    Bortfeld, T.2    Martin, B.3    Trofimov, A.4
  • 88
    • 0002206795 scopus 로고
    • Strong underrelaxation in kaczmarz's method for inconsistent systems
    • Y. Censor, P.P.B. Eggermont, D. Gordon, Strong underrelaxation in Kaczmarz's method for inconsistent systems. Numer. Math. 41, 83-92 (1983)
    • (1983) Numer. Math. , vol.41 , pp. 83-92
    • Censor, Y.1    Eggermont, P.P.B.2    Gordon, D.3
  • 89
    • 0001464734 scopus 로고
    • New methods for linear inequalities
    • Y. Censor, T. Elfving, New methods for linear inequalities. Lin. Algebra Appl. 42, 199-211 (1982)
    • (1982) Lin. Algebra Appl. , vol.42 , pp. 199-211
    • Censor, Y.1    Elfving, T.2
  • 90
    • 0000424337 scopus 로고
    • A multiprojection algorithm using bregman projections in a product space
    • Y. Censor, T. Elfving, A multiprojection algorithm using Bregman projections in a product space. Numer. Algorithm 8, 221-239 (1994)
    • (1994) Numer. Algorithm , vol.8 , pp. 221-239
    • Censor, Y.1    Elfving, T.2
  • 91
    • 0037287566 scopus 로고    scopus 로고
    • Block-iterative algorithms with diagonally scaled oblique projections for the linear feasibility problem
    • PII S089547980138705X
    • Y. Censor, T. Elfving, Block-iterative algorithms with diagonal scaled oblique projections for the linear feasibility problems. SIAM J. Matrix Anal. Appl. 24, 40-58 (2002) (Pubitemid 36260151)
    • (2003) SIAM Journal on Matrix Analysis and Applications , vol.24 , Issue.1 , pp. 40-58
    • Censor, Y.1    Elfving, T.2
  • 92
    • 1842449599 scopus 로고    scopus 로고
    • Iterative algorithms with seminorm-induced oblique projections
    • DOI 10.1155/S108533750321201X
    • Y. Censor, T. Elfving, Iterative algorithms with seminorm-induced oblique projections. Abstr. Appl. Anal. 8, 387-406 (2003) (Pubitemid 38458003)
    • (2003) Abstract and Applied Analysis , vol.2003 , Issue.7 , pp. 387-406
    • Censor, Y.1    Elfving, T.2
  • 95
    • 28544451131 scopus 로고    scopus 로고
    • The multiple-sets split feasibility problem and its applications for inverse problems
    • DOI 10.1088/0266-5611/21/6/017, PII S0266561105005708
    • Y. Censor, T. Elfving, N. Kopf, T. Bortfeld, The multiple-sets split feasibility problem and its applications for inverse problems. Inverse Probl. 21, 2071-2084 (2005) (Pubitemid 41744516)
    • (2005) Inverse Problems , vol.21 , Issue.6 , pp. 2071-2084
    • Censor, Y.1    Elfving, T.2    Kopf, N.3    Bortfeld, T.4
  • 96
    • 80052948318 scopus 로고    scopus 로고
    • Projections onto super-half-spaces for monotone variational inequality problems in finite-dimensional spaces
    • Y. Censor, A. Gibali, Projections onto super-half-spaces for monotone variational inequality problems in finite-dimensional spaces. J. Nonlinear Convex Anal. 9, 461-475 (2008)
    • (2008) J. Nonlinear Convex Anal. , vol.9 , pp. 461-475
    • Censor, Y.1    Gibali, A.2
  • 97
    • 79952253025 scopus 로고    scopus 로고
    • The subgradient extragradient method for solving variational inequalities in hilbert space
    • Y. Censor, A. Gibali, S. Reich, The subgradient extragradient method for solving variational inequalities in Hilbert space. J. Optim. Theory Appl. 148, 318-335 (2011)
    • (2011) J. Optim. Theory Appl. , vol.148 , pp. 318-335
    • Censor, Y.1    Gibali, A.2    Reich, S.3
  • 98
    • 84864683937 scopus 로고    scopus 로고
    • Extensions of korpelevich's extragradient method for the variational inequality problem in euclidean space
    • Y. Censor, A. Gibali, S. Reich, Extensions of Korpelevich's extragradient method for the variational inequality problem in Euclidean space. Optimization 61, 1119-1132 (2012)
    • (2012) Optimization , vol.61 , pp. 1119-1132
    • Censor, Y.1    Gibali, A.2    Reich, S.3
  • 99
    • 80053286495 scopus 로고    scopus 로고
    • Strong convergence of subgradient extragradient methods for the variational inequality problem in hilbert space
    • Y. Censor, A. Gibali, S. Reich, Strong convergence of subgradient extragradient methods for the variational inequality problem in Hilbert space. Optim. Meth. Software 26, 827-845 (2011)
    • (2011) Optim. Meth. Software , vol.26 , pp. 827-845
    • Censor, Y.1    Gibali, A.2    Reich, S.3
  • 100
    • 0035341879 scopus 로고    scopus 로고
    • Component averaging: An efficient iterative parallel algorithm for large and sparse unstructured problems
    • DOI 10.1016/S0167-8191(00)00100-9, PII S0167819100001009
    • Y. Censor, D. Gordon, R. Gordon, Component averaging: An efficient iterative parallel algorithm for large and sparse unstructured problems. Parallel Comput. 27, 777-808 (2001) (Pubitemid 32279564)
    • (2001) Parallel Computing , vol.27 , Issue.6 , pp. 777-808
    • Censor, Y.1    Gordon, D.2    Gordon, R.3
  • 101
    • 0035487602 scopus 로고    scopus 로고
    • BICAV: A block-iterative parallel algorithm for sparse systems with pixel-related weighting
    • PII S0278006201093090
    • Y. Censor, D. Gordon, R. Gordon, BICAV: A block-iterative, parallel algorithm for sparse systems with pixel-related weighting. IEEE Trans. Med. Imag. 20, 1050-1060 (2001) (Pubitemid 33777722)
    • (2001) IEEE Transactions on Medical Imaging , vol.20 , Issue.10 , pp. 1050-1060
    • Censor, Y.1    Gordon, D.2    Gordon, R.3
  • 102
    • 0023438279 scopus 로고
    • On some optimization techniques in image reconstruction from projections
    • Y. Censor, G.T. Herman, On some optimization techniques in image reconstruction from projections. Appl. Numer. Math. 3, 365-391 (1987)
    • (1987) Appl. Numer. Math. , vol.3 , pp. 365-391
    • Censor, Y.1    Herman, G.T.2
  • 103
    • 0000683866 scopus 로고    scopus 로고
    • An interior point method with Bregman functions for the variational inequality problem with paramonotone operators
    • PII S0025561097000336
    • Y. Censor, A.N. Iusem, S.A. Zenios, An interior point method with Bregman functions for the variational inequality problem with paramonotone operators. Math. Program. 81, 373-400 (1998) (Pubitemid 128393286)
    • (1998) Mathematical Programming, Series B , vol.81 , Issue.3 , pp. 373-400
    • Censor, Y.1    Iusem, A.N.2    Zenios, S.A.3
  • 104
    • 34250232993 scopus 로고
    • Cyclic Subgradient Projections
    • Y. Censor, A. Lent, Cyclic subgradient projections. Math. Program. 24, 233-235 (1982) (Pubitemid 13461136)
    • (1982) Mathematical Programming , vol.24 , Issue.2 , pp. 233-235
    • Censor Yair1    Lent Arnold2
  • 105
    • 33751021369 scopus 로고    scopus 로고
    • Perturbed projections and subgradient projections for the multiple-sets split feasibility problem
    • DOI 10.1016/j.jmaa.2006.05.010, PII S0022247X06004975
    • Y. Censor, A. Motova, A. Segal, Perturbed projections and subgradient projections for the multiple-sets split feasibility problem. J. Math. Anal. Appl. 327, 1244-1256 (2007) (Pubitemid 44742806)
    • (2007) Journal of Mathematical Analysis and Applications , vol.327 , Issue.2 , pp. 1244-1256
    • Censor, Y.1    Motova, A.2    Segal, A.3
  • 106
    • 70349775725 scopus 로고    scopus 로고
    • The split common fixed point problem for directed operators
    • Y. Censor, A. Segal, The split common fixed point problem for directed operators. J. Convex Anal. 16, 587-600 (2009)
    • (2009) J. Convex Anal. , vol.16 , pp. 587-600
    • Censor, Y.1    Segal, A.2
  • 107
    • 70349775963 scopus 로고    scopus 로고
    • On the string averaging method for sparse common fixed point problems
    • Y. Censor, A. Segal, On the string averaging method for sparse common fixed point problems. Int. Trans. Oper. Res. 16, 481-494 (2009)
    • (2009) Int. Trans. Oper. Res. , vol.16 , pp. 481-494
    • Censor, Y.1    Segal, A.2
  • 108
    • 84855344880 scopus 로고    scopus 로고
    • Sparse string-averaging and split common fixed points
    • Y. Censor, A. Segal, Sparse string-averaging and split common fixed points. Contemp. Math. 513, 125-142 (2010)
    • (2010) Contemp. Math. , vol.513 , pp. 125-142
    • Censor, Y.1    Segal, A.2
  • 109
    • 0242468035 scopus 로고    scopus 로고
    • Convergence of string-averaging projection schemes for inconsistent convex feasibility problems
    • Y. Censor, E. Tom, Convergence of string-averaging projection schemes for inconsistent convex feasibility problems. Optim. Meth. Software 18, 543-554 (2003)
    • (2003) Optim. Meth. Software , vol.18 , pp. 543-554
    • Censor, Y.1    Tom, E.2
  • 111
    • 0347022767 scopus 로고    scopus 로고
    • Resolution enhancement of low resolution wavefields with POCS algorithm
    • A.E. Ç etin, H. Özaktaş, H.M. Ozaktas, Resolution enhancement of low resolution wavefields with POCS algorithm. Electron. Lett. 9, 1808-1810 (2003)
    • (2003) Electron. Lett. , vol.9 , pp. 1808-1810
    • Çetin, A.E.1    Özaktaş, H.2    Ozaktas, H.M.3
  • 112
    • 77956320062 scopus 로고    scopus 로고
    • A fast optimization algorithm for multicriteria intensity modulated proton therapy planning
    • W. Chen, D. Craft, T.M. Madden, K. Zhang, H.M. Kooy, G.T. Herman, A fast optimization algorithm for multicriteria intensity modulated proton therapy planning. Med. Phys. 7, 4938-4945 (2010)
    • (2010) Med. Phys. , vol.7 , pp. 4938-4945
    • Chen, W.1    Craft, D.2    Madden, T.M.3    Zhang, K.4    Kooy, H.M.5    Herman, G.T.6
  • 113
    • 77951898452 scopus 로고    scopus 로고
    • Efficient controls for finitely convergent sequential algorithms
    • W. Chen, G.T. Herman, Efficient controls for finitely convergent sequential algorithms. ACM Trans. Math. Software 37, 1-23 (2010)
    • (2010) ACM Trans. Math. Software , vol.37 , pp. 1-23
    • Chen, W.1    Herman, G.T.2
  • 115
    • 34247551750 scopus 로고
    • Quasi-nonexpansive mappings and uniform asymptotic regularity
    • C.E. Chidume, Quasi-nonexpansive mappings and uniform asymptotic regularity. Kobe J. Math. 3, 29-35 (1986)
    • (1986) Kobe J. Math. , vol.3 , pp. 29-35
    • Chidume, C.E.1
  • 117
    • 4444382791 scopus 로고    scopus 로고
    • Multiple wavelet basis image denoising using besov ball projections
    • H. Choi, R.G. Baraniuk, Multiple wavelet basis image denoising using Besov ball projections. IEEE Signal Process. Lett. 11, 717-720 (2004)
    • (2004) IEEE Signal Process. Lett. , vol.11 , pp. 717-720
    • Choi, H.1    Baraniuk, R.G.2
  • 118
    • 0001054069 scopus 로고
    • Calcolo approssimato per le soluzioni dei sistemi di equazioni lineari
    • G. Cimmino, Calcolo approssimato per le soluzioni dei sistemi di equazioni lineari. La Ricerca Scientifica, II 9, 326-333 (1938)
    • (1938) La Ricerca Scientifica, II , vol.9 , pp. 326-333
    • Cimmino, G.1
  • 119
    • 0028543165 scopus 로고
    • Inconsistent signal feasibility problems: Least-square solutions in a product space
    • P.L. Combettes, Inconsistent signal feasibility problems: Least-square solutions in a product space. IEEE Trans. Signal Process. 42, 2955-2966 (1994)
    • (1994) IEEE Trans. Signal Process. , vol.42 , pp. 2955-2966
    • Combettes, P.L.1
  • 120
    • 77954607855 scopus 로고    scopus 로고
    • The convex feasibility problem in image recovery
    • ed. by P. Hawkes Academic, New York
    • P.L. Combettes, in The Convex Feasibility Problem in Image Recovery, ed. by P. Hawkes. Advances in Imaging and Electron Physics, Vol. 95 (Academic, New York, 1996), pp. 155-270
    • (1996) Advances in Imaging and Electron Physics , vol.95 , pp. 155-270
    • Combettes, P.L.1
  • 121
    • 0031148181 scopus 로고    scopus 로고
    • Hilbertian convex feasibility problem: Convergence of projection methods
    • P.L. Combettes, Hilbertian convex feasibility problem: Convergence of projection methods. Appl. Math. Optim. 35, 311-330 (1997) (Pubitemid 127715737)
    • (1997) Applied Mathematics and Optimization , vol.35 , Issue.3 , pp. 311-330
    • Combettes, P.L.1
  • 122
    • 0031118954 scopus 로고    scopus 로고
    • Convex set theoretic image recovery by extrapolated iterations of parallel subgradient projections
    • PII S1057714997003412
    • P.L. Combettes, Convex set theoretic image recovery by extrapolated iterations of parallel subgradient projections. IEEE Trans. Image Process. 6, 493-506 (1997) (Pubitemid 127768380)
    • (1997) IEEE Transactions on Image Processing , vol.6 , Issue.4 , pp. 493-506
    • Combettes, P.L.1
  • 124
    • 13244295576 scopus 로고    scopus 로고
    • Solving monotone inclusions via compositions of nonexpansive averaged operators
    • DOI 10.1080/02331930412331327157
    • P.L. Combettes, Solving monotone inclusions via compositions of nonexpansive averaged operators. Optimization 53, 475-504 (2004) (Pubitemid 40190083)
    • (2004) Optimization , vol.53 , Issue.5-6 , pp. 475-504
    • Combettes, P.L.1
  • 125
    • 0032653272 scopus 로고    scopus 로고
    • Hard-constrained inconsistent signal feasibility problems
    • P.L. Combettes, P. Bondon, Hard-constrained inconsistent signal feasibility problems. IEEE Trans. Signal Process. 47, 2460-2468 (1999)
    • (1999) IEEE Trans. Signal Process. , vol.47 , pp. 2460-2468
    • Combettes, P.L.1    Bondon, P.2
  • 127
    • 0000621610 scopus 로고
    • Iterations of parallel convex projections in hilbert spaces
    • P.L. Combettes, H. Puh, Iterations of parallel convex projections in Hilbert spaces. Numer. Funct. Anal. Optim. 15, 225-243 (1994)
    • (1994) Numer. Funct. Anal. Optim. , vol.15 , pp. 225-243
    • Combettes, P.L.1    Puh, H.2
  • 128
    • 22844449195 scopus 로고    scopus 로고
    • A geometrical look at iterative methods for operators with fixed points
    • DOI 10.1081/NFA-200063882
    • G. Crombez, A geometrical look at iterative methods for operators with fixed points. Numer. Funct. Anal. Optim. 26, 157-175 (2005) (Pubitemid 41036936)
    • (2005) Numerical Functional Analysis and Optimization , vol.26 , Issue.2 , pp. 157-175
    • Crombez, G.1
  • 129
    • 73349140384 scopus 로고    scopus 로고
    • A hierarchical presentation of operators with fixed points on hilbert spaces
    • G. Crombez, A hierarchical presentation of operators with fixed points on Hilbert spaces. Numer. Funct. Anal. Optim. 27, 259-277 (2006)
    • (2006) Numer. Funct. Anal. Optim. , vol.27 , pp. 259-277
    • Crombez, G.1
  • 130
    • 33750907699 scopus 로고    scopus 로고
    • Fast algorithms for projection on an ellipsoid
    • DOI 10.1137/040613305
    • Y.-H. Dai, Fast algorithms for projection on an ellipsoid. SIAM J. Optim. 16, 986-1006 (2006) (Pubitemid 44729407)
    • (2006) SIAM Journal on Optimization , vol.16 , Issue.4 , pp. 986-1006
    • Dai, Y.-H.1
  • 131
    • 45149136746 scopus 로고
    • A note of the convergence of linear stationary iterative process
    • A. Dax, A note of the convergence of linear stationary iterative process. Lin. Algebra Appl. 129, 131-142 (1990)
    • (1990) Lin. Algebra Appl. , vol.129 , pp. 131-142
    • Dax, A.1
  • 132
    • 0013050305 scopus 로고
    • Linear search acceleration of iterative methods
    • A. Dax, Linear search acceleration of iterative methods. Lin. Algebra Appl. 130, 43-63 (1990)
    • (1990) Lin. Algebra Appl. , vol.130 , pp. 43-63
    • Dax, A.1
  • 133
    • 45149139003 scopus 로고
    • On hybrid acceleration of a linear stationary iterative process
    • A. Dax, On hybrid acceleration of a linear stationary iterative process. Lin. Algebra Appl. 130, 99-110 (1990)
    • (1990) Lin. Algebra Appl. , vol.130 , pp. 99-110
    • Dax, A.1
  • 134
    • 0025566496 scopus 로고
    • The convergence of linear stationary iterative processes for solving singular unstructured systems of linear equations
    • A. Dax, The convergence of linear stationary iterative processes for solving singular unstructured systems of linear equations. SIAM Rev. 32, 611-635 (1990)
    • (1990) SIAM Rev. , vol.32 , pp. 611-635
    • Dax, A.1
  • 136
    • 0039336108 scopus 로고
    • A simultaneous projections method for linear inequalities
    • A.R. De Pierro, A.N. Iusem, A simultaneous projections method for linear inequalities. Lin. Algebra Appl. 64, 243-253 (1985)
    • (1985) Lin. Algebra Appl. , vol.64 , pp. 243-253
    • De Pierro, A.R.1    Iusem, A.N.2
  • 137
    • 0039756214 scopus 로고
    • A parallel projection method of finding a common point of a family of convex sets
    • A.R. De Pierro, A.N. Iusem, A parallel projection method of finding a common point of a family of convex sets. Pesquisa Operacional 5, 1-20 (1985)
    • (1985) Pesquisa Operacional , vol.5 , pp. 1-20
    • De Pierro, A.R.1    Iusem, A.N.2
  • 138
    • 0004895718 scopus 로고
    • A finitely convergent "row-action," method for the convex feasibility problem
    • A.R. De Pierro, A.N. Iusem, A finitely convergent "row-action," method for the convex feasibility problem. Appl. Math. Optim. 17, 225-235 (1988)
    • (1988) Appl. Math. Optim. , vol.17 , pp. 225-235
    • De Pierro, A.R.1    Iusem, A.N.2
  • 139
    • 38249019931 scopus 로고
    • On the asymptotic behavior of some alternate smoothing series expansion iterative methods
    • A.R. De Pierro, A.N. Iusem, On the asymptotic behavior of some alternate smoothing series expansion iterative methods. Lin. Algebra Appl. 130, 3-24 (1990)
    • (1990) Lin. Algebra Appl. , vol.130 , pp. 3-24
    • De Pierro, A.R.1    Iusem, A.N.2
  • 140
    • 0009941202 scopus 로고
    • Applications of von neumann's alternating projections algorithm
    • ed. by P. Kenderov Sophia, Bulgaria
    • F. Deutsch, in Applications of von Neumann's Alternating Projections Algorithm, ed. by P. Kenderov. Mathematical Methods in Operations Research (Sophia, Bulgaria, 1983), pp. 44-51
    • (1983) Mathematical Methods in Operations Research , pp. 44-51
    • Deutsch, F.1
  • 141
    • 0001770096 scopus 로고
    • The method of alternating orthogonal projections
    • ed. by S.P. Singh Kluwer Academic, The Netherlands
    • F. Deutsch, in The Method of Alternating Orthogonal Projections, ed. by S.P. Singh. Approximation Theory, Spline Functions and Applications (Kluwer Academic, The Netherlands, 1992), pp. 105-121
    • (1992) Approximation Theory, Spline Functions and Applications , pp. 105-121
    • Deutsch, F.1
  • 143
    • 77954215357 scopus 로고    scopus 로고
    • Accelerating the convergence of the method of alternating projections via a line search: A brief survey
    • ed. by D. Butnariu, Y. Censor, S. Reich Elsevier Science, Amsterdam
    • F. Deutsch, in Accelerating the Convergence of the Method of Alternating Projections via a Line Search: A Brief Survey, ed. by D. Butnariu, Y. Censor, S. Reich. Inherently Parallel Algorithms in Feasibility and Optimization and their Application, Studies in Computational Mathematics, Vol. 8 (Elsevier Science, Amsterdam, 2001), pp. 203-217
    • (2001) Inherently Parallel Algorithms in Feasibility and Optimization and their Application, Studies in Computational Mathematics , vol.8 , pp. 203-217
    • Deutsch, F.1
  • 144
    • 33748169660 scopus 로고    scopus 로고
    • The rate of convergence for the cyclic projections algorithm I: Angles between convex sets
    • DOI 10.1016/j.jat.2006.02.005, PII S0021904506000463
    • F. Deutsch, H. Hundal, The rate of convergence for the cyclic projections algorithm, I. Angles between convex sets. J. Approx. Theor. 142, 36-55 (2006) (Pubitemid 44309204)
    • (2006) Journal of Approximation Theory , vol.142 , Issue.1 , pp. 36-55
    • Deutsch, F.1    Hundal, H.2
  • 145
    • 33748195922 scopus 로고    scopus 로고
    • The rate of convergence for the cyclic projections algorithm II: Norms of nonlinear operators
    • DOI 10.1016/j.jat.2006.02.006, PII S0021904506000475
    • F. Deutsch, H. Hundal, The rate of convergence for the cyclic projections algorithm, II. Norms of nonlinear operators. J. Approx. Theor. 142, 56-82 (2006) (Pubitemid 44309205)
    • (2006) Journal of Approximation Theory , vol.142 , Issue.1 , pp. 56-82
    • Deutsch, F.1    Hundal, H.2
  • 146
    • 0031999680 scopus 로고    scopus 로고
    • Minimizing certain convex functions over the intersection of the fixed point sets of nonexpansive mappings
    • F. Deutsch, I. Yamada, Minimizing certain convex functions over the intersection of the fixed point sets of nonexpansive mappings. Numer. Funct. Anal. Optim. 19, 33-56 (1998) (Pubitemid 128588222)
    • (1998) Numerical Functional Analysis and Optimization , vol.19 , Issue.1-2 , pp. 33-56
    • Deutsch, F.1    Yamada, I.2
  • 147
    • 84968504361 scopus 로고
    • On the set of subsequential limit points of successive approximations
    • J.B. Diaz, F.T. Metcalf, On the set of subsequential limit points of successive approximations. Trans. Am. Math. Soc. 135, 459-485 (1969)
    • (1969) Trans. Am. Math. Soc. , vol.135 , pp. 459-485
    • Diaz, J.B.1    Metcalf, F.T.2
  • 148
    • 0023363030 scopus 로고
    • A parallel subgradient projections method for the convex feasibility problem
    • L.T. Dos Santos, A parallel subgradient projections method for the convex feasibility problem. J. Comput. Appl. Math. 18, 307-320 (1987)
    • (1987) J. Comput. Appl. Math. , vol.18 , pp. 307-320
    • Dos Santos, L.T.1
  • 149
    • 0002364055 scopus 로고
    • On the mann iterative process
    • W.G. Dotson Jr., On the Mann iterative process. Trans. Am. Math. Soc. 149, 65-73 (1970)
    • (1970) Trans. Am. Math. Soc. , vol.149 , pp. 65-73
    • Dotson Jr., W.G.1
  • 150
    • 84974085393 scopus 로고
    • Fixed points of quasi-nonexpansive mappings
    • W.G. Dotson, Fixed points of quasi-nonexpansive mappings. J. Austral. Math. Soc. 13, 167-170 (1972)
    • (1972) J. Austral. Math. Soc. , vol.13 , pp. 167-170
    • Dotson, W.G.1
  • 151
    • 84967782959 scopus 로고
    • On the numerical solution of heat conduction problems in two or three space variables
    • J. Douglas, H.H. Rachford, On the numerical solution of heat conduction problems in two or three space variables. Trans. Am. Math. Soc. 82, 421-439 (1956)
    • (1956) Trans. Am. Math. Soc. , vol.82 , pp. 421-439
    • Douglas, J.1    Rachford, H.H.2
  • 152
    • 34547293633 scopus 로고    scopus 로고
    • Iterative method for solving the linear feasibility problem
    • R. Dudek, Iterative method for solving the linear feasibility problem. J. Optim Theor. Appl. 132, 401-410 (2007)
    • (2007) J. Optim Theor. Appl. , vol.132 , pp. 401-410
    • Dudek, R.1
  • 153
    • 0013499061 scopus 로고
    • Random products of contractions in banach spaces
    • J. Dye, M.A. Khamsi, S. Reich, Random products of contractions in Banach spaces. Trans. Am. Math. Soc. 325, 87-99 (1991)
    • (1991) Trans. Am. Math. Soc. , vol.325 , pp. 87-99
    • Dye, J.1    Khamsi, M.A.2    Reich, S.3
  • 154
    • 0040069594 scopus 로고
    • On the unrestricted iteration of projections in hilbert space
    • J.M. Dye, S. Reich, On the unrestricted iteration of projections in Hilbert space. J. Math. Anal. Appl. 156, 101-119 (1991)
    • (1991) J. Math. Anal. Appl. , vol.156 , pp. 101-119
    • Dye, J.M.1    Reich, S.2
  • 155
    • 0040663105 scopus 로고
    • Unrestricted iterations of nonexpansive mappings in hilbert space
    • J. Dye, S. Reich, Unrestricted iterations of nonexpansive mappings in Hilbert space. Nonlinear Anal. 18, 199-207 (1992)
    • (1992) Nonlinear Anal. , vol.18 , pp. 199-207
    • Dye, J.1    Reich, S.2
  • 157
    • 80755127786 scopus 로고    scopus 로고
    • Projection method with residual selection for linear feasibility problems
    • R. Dylewski, Projection method with residual selection for linear feasibility problems. Discuss. Math. Differ. Incl. Contr. Optim. 27, 43-50 (2007)
    • (2007) Discuss. Math. Differ. Incl. Contr. Optim. , vol.27 , pp. 43-50
    • Dylewski, R.1
  • 159
    • 0027113845 scopus 로고
    • On the douglas-rachford splitting method and the proximal point algorithm for maximal monotone operators
    • J. Eckstein, D.P. Bertsekas, On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators. Math. Program. 55, 293-318 (1992)
    • (1992) Math. Program. , vol.55 , pp. 293-318
    • Eckstein, J.1    Bertsekas, D.P.2
  • 161
    • 4644326855 scopus 로고    scopus 로고
    • A projection method for semidefinite linear systems and its applications
    • T. Elfving, A projection method for semidefinite linear systems and its applications. Lin. Algebra Appl. 391, 57-73 (2004)
    • (2004) Lin. Algebra Appl. , vol.391 , pp. 57-73
    • Elfving, T.1
  • 162
    • 34548692513 scopus 로고    scopus 로고
    • Stopping rules for Landweber-type iteration
    • DOI 10.1088/0266-5611/23/4/004, PII S026656110730796X, 004
    • T. Elfving, T. Nikazad, Stopping rules for Landweber-type iteration. Inverse Probl. 23, 1417-1432 (2007) (Pubitemid 47411218)
    • (2007) Inverse Problems , vol.23 , Issue.4 , pp. 1417-1432
    • Elfving, T.1    Nikazad, T.2
  • 164
    • 34249916783 scopus 로고
    • Convergence properties of ART and SOR algorithms
    • L. Elsner, I. Koltracht, P. Lancaster, Convergence properties of ART and SOR algorithms. Numer. Math. 59, 91-106 (1991)
    • (1991) Numer. Math. , vol.59 , pp. 91-106
    • Elsner, L.1    Koltracht, I.2    Lancaster, P.3
  • 165
    • 0007264047 scopus 로고
    • On the convergence of asynchronous paracontractions with application to tomographic reconstruction from incomplete data
    • L. Elsner, I. Koltracht, M. Neumann, On the convergence of asynchronous paracontractions with application to tomographic reconstruction from incomplete data. Lin. Algebra Appl. 130, 65-82 (1990)
    • (1990) Lin. Algebra Appl. , vol.130 , pp. 65-82
    • Elsner, L.1    Koltracht, I.2    Neumann, M.3
  • 166
    • 0000695406 scopus 로고
    • Convergence of sequential and asynchronous nonlinear paracontractions
    • L. Elsner, I. Koltracht, M. Neumann, Convergence of sequential and asynchronous nonlinear paracontractions. Numer. Math. 62, 305-319 (1992)
    • (1992) Numer. Math. , vol.62 , pp. 305-319
    • Elsner, L.1    Koltracht, I.2    Neumann, M.3
  • 168
    • 0000803454 scopus 로고
    • On matrices with non-positive off-diagonal elements and positive principal minors
    • M. Fiedler, V. Pták, On matrices with non-positive off-diagonal elements and positive principal minors. Czech. Math. J. 12, 382-400 (1962)
    • (1962) Czech. Math. J. , vol.12 , pp. 382-400
    • Fiedler, M.1    Pták, V.2
  • 169
    • 0043115314 scopus 로고
    • Differentiability of the metric projection in hilbert space
    • S. Fitzpatrick, R.R. Phelps, Differentiability of the metric projection in Hilbert space. Trans. Am. Math. Soc. 270, 483-501 (1982)
    • (1982) Trans. Am. Math. Soc. , vol.270 , pp. 483-501
    • Fitzpatrick, S.1    Phelps, R.R.2
  • 170
    • 0012088394 scopus 로고
    • Relaxed outer projections, weighted averages and convex feasibility
    • S.D. Flåm, J. Zowe, Relaxed outer projections, weighted averages and convex feasibility. BIT 30, 289-300 (1990)
    • (1990) BIT , vol.30 , pp. 289-300
    • Flåm, S.D.1    Zowe, J.2
  • 172
    • 84968486297 scopus 로고
    • On certain inequalities and characteristic value problems for analytic functions and for functions of two variables
    • K. Friedricks, On certain inequalities and characteristic value problems for analytic functions and for functions of two variables. Trans. Am. Math. Soc. 41, 321-364 (1937)
    • (1937) Trans. Am. Math. Soc. , vol.41 , pp. 321-364
    • Friedricks, K.1
  • 173
    • 0022717559 scopus 로고
    • Relaxed projection method for variational inequalities
    • M. Fukushima, A relaxed projection method for variational inequalities. Math. Program. 35, 58-70 (1986) (Pubitemid 16572074)
    • (1986) Mathematical Programming , vol.35 , Issue.1 , pp. 58-70
    • Fukushima Masao1
  • 174
    • 0021522309 scopus 로고
    • Two metric projection methods for constrained optimization
    • E.M. Gafni, D.P. Bertsekas, Two metric projection methods for constrained optimization. SIAM J. Contr. Optim. 22, 936-964 (1984)
    • (1984) SIAM J. Contr. Optim. , vol.22 , pp. 936-964
    • Gafni, E.M.1    Bertsekas, D.P.2
  • 176
    • 23844486226 scopus 로고    scopus 로고
    • On the rate of convergence of the alternating projection method in finite dimensional spaces
    • DOI 10.1016/j.jmaa.2004.12.050, PII S0022247X04010716
    • A. Galántai, On the rate of convergence of the alternating projection method in finite dimensional spaces. J. Math. Anal. Appl. 310, 30-44 (2005) (Pubitemid 41149445)
    • (2005) Journal of Mathematical Analysis and Applications , vol.310 , Issue.1 , pp. 30-44
    • Galantai, A.1
  • 177
    • 0001001503 scopus 로고
    • Parallel projected aggregation methods for solving the convex feasibility problem
    • U. García-Palomares, Parallel projected aggregation methods for solving the convex feasibility problem. SIAM J. Optim. 3, 882-900 (1993)
    • (1993) SIAM J. Optim. , vol.3 , pp. 882-900
    • García-Palomares, U.1
  • 178
    • 0032010261 scopus 로고    scopus 로고
    • A superlinearly convergent projection algorithm for solving the convex inequality problem
    • PII S0167637798000030
    • U. García-Palomares, A superlinearly convergent projection algorithm for solving the convex inequality problem. Oper. Res. Lett. 22, 97-103 (1998) (Pubitemid 128458163)
    • (1998) Operations Research Letters , vol.22 , Issue.2-3 , pp. 97-103
    • Garcia-Palomares, U.M.1
  • 179
    • 0040265494 scopus 로고
    • Acceleration schemes for the method of alternating projections
    • W.B. Gearhart, M. Koshy, Acceleration schemes for the method of alternating projections. J. Comput. Appl. Math. 26, 235-249 (1989)
    • (1989) J. Comput. Appl. Math. , vol.26 , pp. 235-249
    • Gearhart, W.B.1    Koshy, M.2
  • 184
    • 0032237879 scopus 로고    scopus 로고
    • The Nearest 'Doubly Stochastic' Matrix to a Real Matrix with the same First Moment
    • W. Glunt, T.L. Hayden, R. Reams, The nearest 'doubly stochastic' matrix to a real matrix with the same first moment. Numer. Lin. Algebra Appl. 5, 475-482 (1998) (Pubitemid 128475850)
    • (1998) Numerical Linear Algebra with Applications , vol.5 , Issue.6 , pp. 475-482
    • Glunt, W.1    Hayden, T.L.2    Reams, R.3
  • 186
    • 85009422913 scopus 로고    scopus 로고
    • Polish translation Wydawnictwo UMCS, Lublin
    • Polish translation: Twierdzenia o punktach stałych (Wydawnictwo UMCS, Lublin, 2005)
    • (2005) Twierdzenia O Punktach Stałych
  • 190
    • 0019049551 scopus 로고
    • Relaxation method for solving systems of linear inequalities
    • J.L. Goffin, The relaxation method for solving systems of linear inequalities. Math. Oper. Res. 5, 388-414 (1980) (Pubitemid 11438184)
    • (1980) Mathematics of Operations Research , vol.5 , Issue.3 , pp. 388-414
    • Goffin, J.L.1
  • 192
    • 84979309102 scopus 로고
    • Zum Prinzip der kontraktiven Abbildung
    • D. Göhde, Zum Prinzip der kontraktiven Abbildung. Math. Nachr. 30, 251-258 (1965)
    • (1965) Math. Nachr. , vol.30 , pp. 251-258
    • Göhde, D.1
  • 193
    • 0014905513 scopus 로고
    • Algebraic reconstruction techniques (ART) for three-dimensional electron microscopy and X-ray photography
    • R. Gordon, R. Bender, G.T. Herman, Algebraic reconstruction techniques (ART) for three-dimensional electron microscopy and X-ray photography. J. Theoret. Biol. 29, 471-481 (1970)
    • (1970) J. Theoret. Biol. , vol.29 , pp. 471-481
    • Gordon, R.1    Bender, R.2    Herman, G.T.3
  • 194
    • 33646553890 scopus 로고    scopus 로고
    • Component-averaged row projections: A robust, block-parallel scheme for sparse linear systems
    • D. Gordon, R. Gordon, Component-averaged row projections: a robust, block-parallel scheme for sparse linear systems. SIAM J. Sci. Comput. 27, 1092-1117 (2005)
    • (2005) SIAM J. Sci. Comput. , vol.27 , pp. 1092-1117
    • Gordon, D.1    Gordon, R.2
  • 196
    • 0028467590 scopus 로고
    • Application of alternating convex projection methods for computation of positive toeplitz matrices
    • K.M. Grigoriadis, A.E. Frazho, R.E. Skelton, Application of alternating convex projection methods for computation of positive Toeplitz matrices. IEEE Trans. Signal Process. 42, 1873-1875 (1994)
    • (1994) IEEE Trans. Signal Process. , vol.42 , pp. 1873-1875
    • Grigoriadis, K.M.1    Frazho, A.E.2    Skelton, R.E.3
  • 197
    • 0030219267 scopus 로고    scopus 로고
    • Low-order control design for LMI problems using alternating projection methods
    • DOI 10.1016/0005-1098(96)00057-X, PII S000510989600057X
    • K.M. Grigoriadis, R.E. Skelton, Low-order control design for LMI problems using alternating projection methods. Automatica 32, 1117-1125 (1996) (Pubitemid 126363662)
    • (1996) Automatica , vol.32 , Issue.8 , pp. 1117-1125
    • Grigoriadis, K.M.1    Skelton, R.E.2
  • 198
    • 0030553244 scopus 로고    scopus 로고
    • Alternating convex projection methods for discrete-time covariance control design
    • K.M. Grigoriadis, R.E. Skelton, Alternating convex projection methods for discrete-time covariance control design. J. Optim. Theor. Appl. 88, 399-432 (1996)
    • (1996) J. Optim. Theor. Appl. , vol.88 , pp. 399-432
    • Grigoriadis, K.M.1    Skelton, R.E.2
  • 199
    • 11144256555 scopus 로고    scopus 로고
    • Wide-Band smart antenna design using vector space projection methods
    • DOI 10.1109/TAP.2004.836408
    • J. Gu, H. Stark, Y. Yang, Wide-band smart antenna design using vector space projection methods. IEEE Trans. Antenn. Propag. 52, 3228-3236 (2004) (Pubitemid 40025707)
    • (2004) IEEE Transactions on Antennas and Propagation , vol.52 , Issue.12 , pp. 3228-3236
    • Gu, J.1    Stark, H.2    Yang, Y.3
  • 200
    • 0000320260 scopus 로고
    • The method of projection for finding the common point in convex sets
    • in Russian
    • L.G. Gurin, B.T. Polyak, E.V. Raik, The method of projection for finding the common point in convex sets. Zh. Vychisl. Mat. Mat. Fiz. 7, 1211-1228 (1967) (in Russian)
    • (1967) Zh. Vychisl. Mat. Mat. Fiz. , vol.7 , pp. 1211-1228
    • Gurin, L.G.1    Polyak, B.T.2    Raik, E.V.3
  • 201
    • 84868309110 scopus 로고
    • English translation in
    • English translation in: USSR Comput. Math. Phys. 7, 1-24 (1967)
    • (1967) USSR Comput. Math. Phys. , vol.7 , pp. 1-24
  • 202
    • 18444412939 scopus 로고    scopus 로고
    • Kaczmarz algorithm in Hilbert space
    • R. Haller, R. Szwarc, Kaczmarz algorithm in Hilbert space. Studia Math. 169, 123-132 (2005) (Pubitemid 40653605)
    • (2005) Studia Mathematica , vol.169 , Issue.2 , pp. 123-132
    • Haller, R.1    Szwarc, R.2
  • 203
    • 0002477272 scopus 로고
    • The product of projection operators
    • I. Halperin, The product of projection operators. Acta Sci. Math. (Szeged) 23, 96-99 (1962)
    • (1962) Acta Sci. Math. (Szeged) , vol.23 , pp. 96-99
    • Halperin, I.1
  • 204
    • 84867961843 scopus 로고    scopus 로고
    • Inverse radiation therapy planning - A multiple objective optimization approach
    • H.W. Hamacher, K.-H. Küfer, Inverse radiation therapy planning - a multiple objective optimization approach. Discrete Appl. Math. 118, 145-161 (2002)
    • (2002) Discrete Appl. Math. , vol.118 , pp. 145-161
    • Hamacher, H.W.1    Küfer, K.-H.2
  • 205
    • 0023860607 scopus 로고
    • A successive projection method
    • S.-P. Han, A successive projection method. Math. Program. (Ser. A) 40, 1-14 (1988)
    • (1988) Math. Program. (Ser. A) , vol.40 , pp. 1-14
    • Han, S.-P.1
  • 206
    • 0039081637 scopus 로고
    • On the acceleration of kaczmarz's method for inconsistent linear systems
    • M. Hanke, W. Niethammer, On the acceleration of Kaczmarz's method for inconsistent linear systems. Lin. Algebra Appl. 130, 83-98 (1990)
    • (1990) Lin. Algebra Appl. , vol.130 , pp. 83-98
    • Hanke, M.1    Niethammer, W.2
  • 208
    • 73249146888 scopus 로고    scopus 로고
    • An explicit method for finding common solutions of variational inequalities and systems of equilibrium problems and fixed points of an infinite family of nonexpansive mappings
    • H. He, S. Liu, H. Zhou, An explicit method for finding common solutions of variational inequalities and systems of equilibrium problems and fixed points of an infinite family of nonexpansive mappings. Nonlinear Anal. 72, 3124-3135 (2010)
    • (2010) Nonlinear Anal. , vol.72 , pp. 3124-3135
    • He, H.1    Liu, S.2    Zhou, H.3
  • 209
    • 0016472823 scopus 로고
    • A relaxation method for reconstructing objects from noisy X-rays
    • G.T. Herman, A relaxation method for reconstructing objects from noisy X-rays. Math. Program. 8, 1-19 (1975)
    • (1975) Math. Program. , vol.8 , pp. 1-19
    • Herman, G.T.1
  • 211
    • 38149118220 scopus 로고    scopus 로고
    • A fast algorithm for solving a linear feasibility problem with application to intensity-modulated radiation therapy
    • G.T. Herman, W. Chen, A fast algorithm for solving a linear feasibility problem with application to intensity-modulated radiation therapy. Lin. Algebra Appl. 428, 1207-1217 (2008)
    • (2008) Lin. Algebra Appl. , vol.428 , pp. 1207-1217
    • Herman, G.T.1    Chen, W.2
  • 212
    • 0000379660 scopus 로고
    • Computing a nearest symmetric positive semidefinite matrix
    • N.J. Higham, Computing a nearest symmetric positive semidefinite matrix. Lin. Algebra Appl. 103, 103-118 (1988)
    • (1988) Lin. Algebra Appl. , vol.103 , pp. 103-118
    • Higham, N.J.1
  • 213
    • 0344153904 scopus 로고    scopus 로고
    • Computing the nearest correlation matrix - A problem from finance
    • DOI 10.1093/imanum/22.3.329
    • N.J. Higham, Computing the nearest correlation matrix - a problem from finance. IMA J. Numer. Anal. 22, 329-343 (2002) (Pubitemid 37445900)
    • (2002) IMA Journal of Numerical Analysis , vol.22 , Issue.3 , pp. 329-343
    • Higham, N.J.1
  • 216
    • 33749525830 scopus 로고    scopus 로고
    • Iterative selection methods for common fixed point problems
    • DOI 10.1016/j.jmaa.2005.12.064, PII S0022247X05013430
    • S.A. Hirstoaga, Iterative selection methods for common fixed point problems. J. Math. Anal. Appl. 324, 1020-1035 (2006) (Pubitemid 44524549)
    • (2006) Journal of Mathematical Analysis and Applications , vol.324 , Issue.2 , pp. 1020-1035
    • Hirstoaga, S.A.1
  • 218
    • 2042504393 scopus 로고    scopus 로고
    • An alternating projection that does not converge in norm
    • H.S. Hundal, An alternating projection that does not converge in norm. Nonlinear Anal. 57, 35-61 (2004)
    • (2004) Nonlinear Anal. , vol.57 , pp. 35-61
    • Hundal, H.S.1
  • 220
    • 34250130112 scopus 로고
    • Convergence results for an accelerated nonlinear cimmino algorithm
    • A.N. Iusem, A.R. De Pierro, Convergence results for an accelerated nonlinear Cimmino algorithm. Numer. Math. 49, 367-378 (1986)
    • (1986) Numer. Math. , vol.49 , pp. 367-378
    • Iusem, A.N.1    De Pierro, A.R.2
  • 221
    • 0023111682 scopus 로고
    • A simultaneous iterative method for computing projections on polyhedra
    • A.N. Iusem, A.R. De Pierro, A simultaneous iterative method for computing projections on polyhedra. SIAM J. Contr. Optim. 25, 231-243 (1987)
    • (1987) SIAM J. Contr. Optim. , vol.25 , pp. 231-243
    • Iusem, A.N.1    De Pierro, A.R.2
  • 222
    • 0011313525 scopus 로고
    • On the convergence properties of hildreth's quadratic programming algorithm
    • A.N. Iusem, A.R. De Pierro, On the convergence properties of Hildreth's quadratic programming algorithm. Math. Program. (Ser. A) 47, 37-51 (1990)
    • (1990) Math. Program. (Ser. A) , vol.47 , pp. 37-51
    • Iusem, A.N.1    De Pierro, A.R.2
  • 223
    • 27144477647 scopus 로고
    • A row-action method for convex programming
    • A.N. Iusem, B.F. Svaiter, A row-action method for convex programming. Math. Program. 64, 149-171 (1994)
    • (1994) Math. Program. , vol.64 , pp. 149-171
    • Iusem, A.N.1    Svaiter, B.F.2
  • 224
    • 0024680218 scopus 로고
    • Iterative approaches to computer-generated holography
    • B.K. Jennison, J.P. Allebach, D.W. Sweeney, Iterative approaches to computer-generated holography. Opt. Eng. 28, 629-637 (1989)
    • (1989) Opt. Eng. , vol.28 , pp. 629-637
    • Jennison, B.K.1    Allebach, J.P.2    Sweeney, D.W.3
  • 225
    • 0036037934 scopus 로고    scopus 로고
    • Development of iterative algorithms for image reconstruction
    • Clinical Applications of Modern Imaging Technology
    • M. Jiang, G. Wang, Development of iterative algorithms for image reconstruction. J. X-Ray Sci. Tech. 10, 77-86 (2002) (Pubitemid 35019705)
    • (2002) Journal of X-Ray Science and Technology , vol.10 , Issue.1-2 , pp. 77-86
    • Jiang, M.1    Wang, G.2
  • 226
    • 0038444409 scopus 로고    scopus 로고
    • Convergence studies on iterative algorithms for image reconstruction
    • M. Jiang, G. Wang, Convergence studies on iterative algorithms for image reconstruction. IEEE Trans. Med. Imag. 22, 569-579 (2003)
    • (2003) IEEE Trans. Med. Imag. , vol.22 , pp. 569-579
    • Jiang, M.1    Wang, G.2
  • 229
    • 0042506433 scopus 로고
    • Approximate solution of systems of linear equations
    • English translation
    • English translation: S. Kaczmarz, Approximate solution of systems of linear equations. Int. J. Contr. 57, 1269-1271 (1993)
    • (1993) Int. J. Contr. , vol.57 , pp. 1269-1271
    • Kaczmarz, S.1
  • 231
    • 70350686771 scopus 로고    scopus 로고
    • A discrete spherical x-ray transform of orientation distribution functions using bounding cubes
    • I.G. Kazantsev, S. Schmidt, H.F. Poulsen, A discrete spherical x-ray transform of orientation distribution functions using bounding cubes. Inverse Probl. 25, 105009 (2009)
    • (2009) Inverse Probl. , vol.25 , pp. 105009
    • Kazantsev, I.G.1    Schmidt, S.2    Poulsen, H.F.3
  • 233
    • 0001287604 scopus 로고
    • A fixed point theorem for mappings which do not increase distances
    • W.A. Kirk, A fixed point theorem for mappings which do not increase distances. Am. Math. Mon. 72, 1004-1006 (1965)
    • (1965) Am. Math. Mon. , vol.72 , pp. 1004-1006
    • Kirk, W.A.1
  • 234
    • 34249768092 scopus 로고
    • Algorithms of projection of a point onto an ellipsoid
    • Yu. N. Kiseliov, Algorithms of projection of a point onto an ellipsoid. Lithuanian Math. J. 34, 141-159 (1994)
    • (1994) Lithuanian Math. J. , vol.34 , pp. 141-159
    • Kiseliov Yu., N.1
  • 235
    • 0345295872 scopus 로고
    • Block-iterative surrogate projection methods for convex feasibility problems
    • K.C. Kiwiel, Block-iterative surrogate projection methods for convex feasibility problems. Lin. Algebra Appl. 215, 225-259 (1995)
    • (1995) Lin. Algebra Appl. , vol.215 , pp. 225-259
    • Kiwiel, K.C.1
  • 236
    • 0030110299 scopus 로고    scopus 로고
    • The efficiency of subgradient projection methods for convex optimization, Part I: General level methods
    • K.C. Kiwiel, The efficiency of subgradient projection methods for convex optimization. I. General level methods. SIAM J. Contr. Optim. 34, 660-676 (1996) (Pubitemid 126564976)
    • (1996) SIAM Journal on Control and Optimization , vol.34 , Issue.2 , pp. 660-676
    • Kiwiel, K.C.1
  • 237
    • 0030104971 scopus 로고    scopus 로고
    • The efficiency of subgradient projection methods for convex optimization, Part II: Implementations and extensions
    • K.C. Kiwiel, The efficiency of subgradient projection methods for convex optimization, II. Implementations and extensions. SIAM J. Contr. Optim. 34, 677-697 (1996) (Pubitemid 126564977)
    • (1996) SIAM Journal on Control and Optimization , vol.34 , Issue.2 , pp. 677-697
    • Kiwiel, K.C.1
  • 238
    • 0038913767 scopus 로고    scopus 로고
    • Monotone gram matrices and deepest surrogate inequalities in accelerated relaxation methods for convex feasibility problems
    • K.C. Kiwiel, Monotone Gram matrices and deepest surrogate inequalities in accelerated relaxation methods for convex feasibility problems. Lin. Algebra Appl. 252, 27-33 (1997) (Pubitemid 127380434)
    • (1997) Linear Algebra and Its Applications , vol.252 , Issue.1-3 , pp. 27-33
    • Kiwiel, K.C.1
  • 239
    • 0031285686 scopus 로고    scopus 로고
    • Surrogate projection methods for finding fixed points of firmly nonexpansive mappings
    • K.C. Kiwiel, B. Łopuch, Surrogate projection methods for finding fixed points of firmly nonexpansive mappings. SIAM J. Opt. 7, 1084-1102 (1997)
    • (1997) SIAM J. Opt. , vol.7 , pp. 1084-1102
    • Kiwiel, K.C.1    Łopuch, B.2
  • 241
    • 0012032523 scopus 로고
    • Polish translation WNT, Warszawa
    • Polish translation: Numeryczna algebra liniowa (WNT, Warszawa, 1992)
    • (1992) Numeryczna Algebra Liniowa
  • 242
    • 33646672554 scopus 로고    scopus 로고
    • A note on the von neumann alternating projections algorithm
    • E. Kopecká, S. Reich, A note on the von Neumann alternating projections algorithm. J. Nonlinear Convex Anal. 5, 379-386 (2004)
    • (2004) J. Nonlinear Convex Anal. , vol.5 , pp. 379-386
    • Kopecká, E.1    Reich, S.2
  • 243
    • 84861794243 scopus 로고    scopus 로고
    • Another note on the von neumann alternating projections algorithm
    • E. Kopecká, S. Reich, Another note on the von Neumann alternating projections algorithm. J. Nonlinear Convex Anal. 11, 455-460 (2010)
    • (2010) J. Nonlinear Convex Anal. , vol.11 , pp. 455-460
    • Kopecká, E.1    Reich, S.2
  • 244
    • 0000005602 scopus 로고
    • The extragradient method for finding saddle points and other problems
    • G.M. Korpelevich, The extragradient method for finding saddle points and other problems. Ekonomika i Matematicheskie Metody 12, 747-756 (1976)
    • (1976) Ekonomika i Matematicheskie Metody , vol.12 , pp. 747-756
    • Korpelevich, G.M.1
  • 245
    • 0001188942 scopus 로고
    • Two remarks on the method of successive approximations (in Russian)
    • M.A. Krasnosel'skiǐ, Two remarks on the method of successive approximations (in Russian). Uspehi Mat. Nauk 10, 123-127 (1955)
    • (1955) Uspehi Mat. Nauk , vol.10 , pp. 123-127
    • Krasnosel'skiǐ, M.A.1
  • 246
    • 0035667805 scopus 로고    scopus 로고
    • On the kaczmarz algorithm of approximation in infinitedimensional spaces
    • S. Kwapień, J. Mycielski, On the Kaczmarz algorithm of approximation in infinitedimensional spaces. Studia Math. 148, 5-86 (2001)
    • (2001) Studia Math. , vol.148 , pp. 5-86
    • Kwapień, S.1    Mycielski, J.2
  • 247
    • 0000518587 scopus 로고
    • An iteration formula for fredholm integral equations of the first kind
    • L. Landweber, An iteration formula for Fredholm integral equations of the first kind. Am. J. Math. 73, 615-624 (1951)
    • (1951) Am. J. Math. , vol.73 , pp. 615-624
    • Landweber, L.1
  • 248
    • 0030919794 scopus 로고    scopus 로고
    • Conformal radiotherapy computation by the method of alternating projections onto convex sets
    • DOI 10.1088/0031-9155/42/6/006, PII S0031915597729403
    • S. Lee, P.S. Cho, R.J. Marks, S. Oh, Conformal radiotherapy computation by the method of alternating projections onto convex sets. Phys. Med. Biol. 42, 1065-1086 (1997) (Pubitemid 27232476)
    • (1997) Physics in Medicine and Biology , vol.42 , Issue.6 , pp. 1065-1086
    • Lee, S.1    Cho, P.S.2    Marks II, R.J.3    Oh, S.4
  • 249
    • 38849112689 scopus 로고    scopus 로고
    • Mesh watermarking based projection onto two convex sets
    • DOI 10.1007/s00530-007-0095-8
    • S.-H. Lee, K.-R. Kwon, Mesh watermarking based projection onto two convex sets. Multimedia Syst. 13, 323-330 (2008) (Pubitemid 351191231)
    • (2008) Multimedia Systems , vol.13 , Issue.5-6 , pp. 323-330
    • Lee, S.-H.1    Kwon, K.-R.2
  • 250
    • 0040071985 scopus 로고    scopus 로고
    • A convergent algorithm for maximum entropy image restoration with a medical X-ray application
    • ed. by R. Shaw SPSE, Washington DC
    • A. Lent, in A Convergent Algorithm for Maximum Entropy Image Restoration with a Medical X-ray Application, ed. by R. Shaw. Image Analysis and Evaluation (SPSE, Washington DC), pp. 249-257
    • Image Analysis and Evaluation , pp. 249-257
    • Lent, A.1
  • 251
    • 0009571096 scopus 로고
    • Extensions of hildreth's row-action method for quadratic programming
    • A. Lent, Y. Censor, Extensions of Hildreth's row-action method for quadratic programming. SIAM J. Contr. Optim. 18, 444-454 (1980)
    • (1980) SIAM J. Contr. Optim. , vol.18 , pp. 444-454
    • Lent, A.1    Censor, Y.2
  • 252
    • 20444451298 scopus 로고    scopus 로고
    • POCS-based blocking artifacts suppression using a smoothness constraint set with explicit region modeling
    • DOI 10.1109/TCSVT.2005.848303
    • A.W.-C. Liew, H. Yan, N.-F. Law, POCS-based blocking artifacts suppression using a smoothness constraint set with explicit region modeling. IEEE Trans. Circ. Syst. Video Tech. 15, 795-800 (2005) (Pubitemid 40819647)
    • (2005) IEEE Transactions on Circuits and Systems for Video Technology , vol.15 , Issue.6 , pp. 795-800
    • Liew, A.W.-C.1    Yan, H.2    Law, N.-F.3
  • 253
    • 0000345334 scopus 로고
    • Splitting algorithms for the sum of two nonlinear operators
    • P.L. Lions, B. Mercier, Splitting algorithms for the sum of two nonlinear operators. SIAM J. Numer. Anal. 16, 964-979 (1979)
    • (1979) SIAM J. Numer. Anal. , vol.16 , pp. 964-979
    • Lions, P.L.1    Mercier, B.2
  • 254
    • 0029253944 scopus 로고
    • An acceleration scheme for row projection methods
    • C. Liu, An acceleration scheme for row projection methods. J. Comput. Appl. Math. 57, 363-391 (1995)
    • (1995) J. Comput. Appl. Math. , vol.57 , pp. 363-391
    • Liu, C.1
  • 255
    • 77954713962 scopus 로고    scopus 로고
    • Demosaicking by alternating projections: Theory and fast one-step implementation
    • Y.M. Lu, M. Karzand, M. Vetterli, Demosaicking by alternating projections: theory and fast one-step implementation. IEEE Trans. Image Process. 19, 2085-2098 (2010)
    • (2010) IEEE Trans. Image Process. , vol.19 , pp. 2085-2098
    • Lu, Y.M.1    Karzand, M.2    Vetterli, M.3
  • 256
    • 33847332022 scopus 로고    scopus 로고
    • Inertial iterative process for fixed points of certain quasi-nonexpansive mappings
    • P.-E. Maingé, Inertial iterative process for fixed points of certain quasi-nonexpansive mappings. Set-Valued Anal. 15, 67-79 (2007)
    • (2007) Set-Valued Anal. , vol.15 , pp. 67-79
    • Maingé, P.-E.1
  • 257
    • 52149108926 scopus 로고    scopus 로고
    • Extension of the hybrid steepest descent method to a class of variational inequalities and fixed point problems with nonself-mappings
    • P.-E. Maingé, Extension of the hybrid steepest descent method to a class of variational inequalities and fixed point problems with nonself-mappings. Numer. Funct. Anal. Optim. 29, 820-834 (2008)
    • (2008) Numer. Funct. Anal. Optim. , vol.29 , pp. 820-834
    • Maingé, P.-E.1
  • 258
    • 49249094666 scopus 로고    scopus 로고
    • New approach to solving a system of variational inequalities and hierarchical problems
    • P.-E. Maingé, New approach to solving a system of variational inequalities and hierarchical problems. J. Optim. Theor. Appl. 138, 459-477 (2008)
    • (2008) J. Optim. Theor. Appl. , vol.138 , pp. 459-477
    • Maingé, P.-E.1
  • 259
    • 84968518052 scopus 로고
    • Mean value methods in iteration
    • W.R. Mann, Mean value methods in iteration. Proc. Am. Math. Soc. 4, 506-510 (1953)
    • (1953) Proc. Am. Math. Soc. , vol.4 , pp. 506-510
    • Mann, W.R.1
  • 260
    • 84966244659 scopus 로고
    • The solution by iteration of nonlinear equations in hilbert spaces
    • Şt. Mǎruşter, The solution by iteration of nonlinear equations in Hilbert spaces. Proc. Am. Math. Soc. 63, 69-73 (1977)
    • (1977) Proc. Am. Math. Soc. , vol.63 , pp. 69-73
    • Mǎruşter, S.1
  • 261
    • 84883540935 scopus 로고    scopus 로고
    • Quasi-nonexpansivity and the convex feasibility problem
    • N.S.
    • Şt. Mǎruşter, Quasi-nonexpansivity and the convex feasibility problem. An. Ştiinţ. Univ. Al. I. Cuza Iaşi Inform. (N.S.) 15, 47-56 (2005)
    • (2005) An. Ştiinţ. Univ. Al. I. Cuza Iaşi Inform. , vol.15 , pp. 47-56
    • Mǎruşter, S.1
  • 262
    • 37249079096 scopus 로고    scopus 로고
    • On the Mann-type iteration and the convex feasibility problem
    • DOI 10.1016/j.cam.2006.12.012, PII S0377042706007382
    • Şt. Mǎruşter, C. Popîrlan, On the Mann-type iteration and the convex feasibility problem. J. Comput. Appl. Math. 212, 390-396 (2008) (Pubitemid 350266221)
    • (2008) Journal of Computational and Applied Mathematics , vol.212 , Issue.2 , pp. 390-396
    • Maruster, S.1    Popirlan, C.2
  • 263
    • 58149186949 scopus 로고    scopus 로고
    • On the regularity condition in a convex feasibility problem
    • Şt. Mǎruşter, C. Popírlan, On the regularity condition in a convex feasibility problem. Nonlinear Anal. 70, 1923-1928 (2009)
    • (2009) Nonlinear Anal. , vol.70 , pp. 1923-1928
    • Mǎruşter, S.1    Popírlan, C.2
  • 264
    • 70349770458 scopus 로고    scopus 로고
    • A note on the multiple-set split convex feasibility problem in hilbert space
    • E. Masad, S. Reich, A note on the multiple-set split convex feasibility problem in Hilbert space. J. Nonlinear Convex Anal. 8, 367-371 (2007)
    • (2007) J. Nonlinear Convex Anal. , vol.8 , pp. 367-371
    • Masad, E.1    Reich, S.2
  • 266
    • 5644249938 scopus 로고
    • The methods of kaczmarz and row orthogonalization for solving linear equations and least squares problems in hilbert space
    • S.F. McCormick, The methods of Kaczmarz and row orthogonalization for solving linear equations and least squares problems in Hilbert space. Indiana Univ. Math. J. 26, 1137-1150 (1977)
    • (1977) Indiana Univ. Math. J. , vol.26 , pp. 1137-1150
    • McCormick, S.F.1
  • 267
    • 0010761925 scopus 로고
    • On a relaxation method of solving systems of linear inequalities (in Russian)
    • Yu. I. Merzlyakov, On a relaxation method of solving systems of linear inequalities (in Russian). Zh. Vychisl. Mat. Mat. Fiz. 2, 482-487 (1962)
    • (1962) Zh. Vychisl. Mat. Mat. Fiz. , vol.2 , pp. 482-487
    • Merzlyakov Yu., I.1
  • 268
    • 1342288377 scopus 로고    scopus 로고
    • The dose-volume constraint satisfaction problem for inverse treatment planning with field segments
    • DOI 10.1088/0031-9155/49/4/010, PII S0031915504677992
    • D. Michalski, Y. Xiao, Y. Censor, J.M. Galvin, The dose-volume constraint satisfaction problem for inverse treatment planning with field segments. Phys. Med. Biol. 49, 601-616 (2004) (Pubitemid 38255941)
    • (2004) Physics in Medicine and Biology , vol.49 , Issue.4 , pp. 601-616
    • Michalski, D.1    Xiao, Y.2    Censor, Y.3    Galvin, J.M.4
  • 271
    • 0001650577 scopus 로고
    • Décomposition orthogonale d'un espace hilbertien selon deux cônes mutuellement polaires
    • J.-J. Moreau, Décomposition orthogonale d'un espace hilbertien selon deux cônes mutuellement polaires. C. R. Acad. Sci. Paris 255, 238-240 (1962)
    • (1962) C. R. Acad. Sci. Paris , vol.255 , pp. 238-240
    • Moreau, J.-J.1
  • 272
    • 67349116530 scopus 로고    scopus 로고
    • A symmetry preserving alternating projection method for matrix model updating
    • J. Moreno, B. Datta, M. Raydan, A symmetry preserving alternating projection method for matrix model updating. Mech. Syst. Signal Process. 23, 1784-1791 (2009)
    • (2009) Mech. Syst. Signal Process. , vol.23 , pp. 1784-1791
    • Moreno, J.1    Datta, B.2    Raydan, M.3
  • 273
    • 0000026160 scopus 로고
    • The relaxation method for linear inequalities
    • T.S. Motzkin, I.J. Schoenberg, The relaxation method for linear inequalities. Can. J. Math. 6, 393-404 (1954)
    • (1954) Can. J. Math. , vol.6 , pp. 393-404
    • Motzkin, T.S.1    Schoenberg, I.J.2
  • 275
    • 0007467075 scopus 로고    scopus 로고
    • Uniform approximation with linear combinations of reproducing kernels
    • J. Mycielski, S. Świerczkowski, Uniform approximation with linear combinations of reproducing kernels. Studia Math. 121, 105-114 (1996) (Pubitemid 126313314)
    • (1996) Studia Mathematica , vol.121 , Issue.2 , pp. 105-114
    • Mycielski, J.1    Swierczkowski, S.2
  • 276
    • 33750918646 scopus 로고    scopus 로고
    • Strong convergence theorem by a hybrid method for nonexpansive mappings and Lipschitz-continuous monotone mappings
    • DOI 10.1137/050624315
    • N. Nadezhkina, W. Takahashi, Strong convergence theorem by a hybrid method for nonexpansive mappings and Lipschitz-continuous monotone mappings. SIAM J. Optim. 16, 1230-1241 (2006) (Pubitemid 44729420)
    • (2006) SIAM Journal on Optimization , vol.16 , Issue.4 , pp. 1230-1241
    • Nadezhkina, N.1    Takahashi, W.2
  • 279
    • 51249185817 scopus 로고
    • Strong convergence of contraction semigroups and of iterative methods for accretive operators in banach spaces
    • O. Nevanlinna, S. Reich, Strong convergence of contraction semigroups and of iterative methods for accretive operators in Banach spaces. Israel J. Math. 32, 44-58 (1979)
    • (1979) Israel J. Math. , vol.32 , pp. 44-58
    • Nevanlinna, O.1    Reich, S.2
  • 280
    • 0036477752 scopus 로고    scopus 로고
    • Non-strictly convex minimization over the fixed point set of an asymptotically shrinking nonexpansive mapping
    • DOI 10.1081/NFA-120003674
    • N. Ogura, I. Yamada, Non-strictly convex minimization over the fixed point set of an asymptotically shrinking nonexpansive mapping. Numer. Funct. Anal. Optim. 23, 113-137 (2002) (Pubitemid 34598859)
    • (2002) Numerical Functional Analysis and Optimization , vol.23 , Issue.1-2 , pp. 113-137
    • Ogura, N.1    Yamada, I.2
  • 281
    • 0037930573 scopus 로고    scopus 로고
    • Nonstrictly convex minimization over the bounded fixed point set of a nonexpansive mapping
    • N. Ogura, I. Yamada, Nonstrictly convex minimization over the bounded fixed point set of a nonexpansive mapping. Numer. Funct. Anal. Optim. 24, 129-135 (2003)
    • (2003) Numer. Funct. Anal. Optim. , vol.24 , pp. 129-135
    • Ogura, N.1    Yamada, I.2
  • 282
    • 0028465832 scopus 로고
    • Kernel synthesis for generalized time-frequency distributions using the method of alternating projections onto convex sets
    • S. Oh, R.J. Marks, L.E. Atlas, Kernel synthesis for generalized time-frequency distributions using the method of alternating projections onto convex sets. IEEE Trans. Signal Process. 42, 1653-1661 (1994)
    • (1994) IEEE Trans. Signal Process. , vol.42 , pp. 1653-1661
    • Oh, S.1    Marks, R.J.2    Atlas, L.E.3
  • 283
    • 0042128551 scopus 로고    scopus 로고
    • Iterative approaches to finding nearest common fixed points of nonexpansive mappings in hilbert spaces
    • J.G. O'Hara, P. Pillay, H.-K. Xu, Iterative approaches to finding nearest common fixed points of nonexpansive mappings in Hilbert spaces. Nonlinear Anal. 54, 1417-1426 (2003)
    • (2003) Nonlinear Anal. , vol.54 , pp. 1417-1426
    • O'Hara, J.G.1    Pillay, P.2    Xu, H.-K.3
  • 284
    • 0026822012 scopus 로고
    • Surrogate methods for linear inequalities
    • S.O. Oko, Surrogate methods for linear inequalities. J. Optim. Theor. Appl. 72, 247-268 (1992)
    • (1992) J. Optim. Theor. Appl. , vol.72 , pp. 247-268
    • Oko, S.O.1
  • 285
    • 0010897470 scopus 로고
    • Lecture Notes 67-1, Center for Dynamical Systems, Brown University, Providence, RI
    • Z. Opial, Nonexpansive and Monotone Mappings in Banach Spaces. Lecture Notes 67-1, Center for Dynamical Systems, Brown University, Providence, RI, 1967
    • (1967) Nonexpansive and Monotone Mappings in Banach Spaces
    • Opial, Z.1
  • 286
    • 84968481460 scopus 로고
    • Weak convergence of the sequence of successive approximations for nonexpansive mappings
    • Z. Opial, Weak convergence of the sequence of successive approximations for nonexpansive mappings. Bull. Am. Math. Soc. 73, 591-597 (1967)
    • (1967) Bull. Am. Math. Soc. , vol.73 , pp. 591-597
    • Opial, Z.1
  • 287
    • 85032751363 scopus 로고    scopus 로고
    • Super-resolution image reconstruction: A technical overview
    • S.C. Park, M.K. Park, M.G. Kang, Super-resolution image reconstruction: A technical overview. IEEE Signal Process. Mag. 20, 21-36 (2003)
    • (2003) IEEE Signal Process. Mag. , vol.20 , pp. 21-36
    • Park, S.C.1    Park, M.K.2    Kang, M.G.3
  • 288
  • 289
    • 78149449856 scopus 로고    scopus 로고
    • Total variation superiorization schemes in proton computed tomography image reconstruction
    • S.N. Penfold, R.W. Schulte, Y. Censor, A.B. Rosenfeld, Total variation superiorization schemes in proton computed tomography image reconstruction. Med. Phys. 37, 5887-5895 (2010)
    • (2010) Med. Phys. , vol.37 , pp. 5887-5895
    • Penfold, S.N.1    Schulte, R.W.2    Censor, Y.3    Rosenfeld, A.B.4
  • 290
    • 0000824964 scopus 로고
    • Strong and weak convergence of the sequence of successive approximations for quasi-nonexpansive mappings
    • W.V. Petryshyn, T.E. Williamson Jr., Strong and weak convergence of the sequence of successive approximations for quasi-nonexpansive mappings. J. Math. Anal. Appl. 43, 459-497 (1973)
    • (1973) J. Math. Anal. Appl. , vol.43 , pp. 459-497
    • Petryshyn, W.V.1    Williamson Jr., T.E.2
  • 291
    • 0021201713 scopus 로고
    • Decomposition through formalization in a product space
    • G. Pierra, Decomposition through formalization in a product space. Math. Program. 28, 96-115 (1984) (Pubitemid 14526382)
    • (1984) Mathematical Programming , vol.28 , Issue.1 , pp. 96-115
    • Pierra, G.1
  • 292
    • 0038425949 scopus 로고
    • Least-squared solution of overdetermined inconsistent linear systems using kaczmarz's relaxation
    • C. Popa, Least-squared solution of overdetermined inconsistent linear systems using Kaczmarz's relaxation. Int. J. Comp. Math. 55, 79-89 (1995)
    • (1995) Int. J. Comp. Math. , vol.55 , pp. 79-89
    • Popa, C.1
  • 293
    • 0038425948 scopus 로고    scopus 로고
    • Extensions of block-projections methods with relaxation parameters to inconsistent and rank-deficient least-squares problems
    • C. Popa, Extensions of block-projections methods with relaxation parameters to inconsistent and rank-deficient least-squares problems. BIT 38, 151-176 (1998) (Pubitemid 128434730)
    • (1998) BIT Numerical Mathematics , vol.38 , Issue.1 , pp. 151-176
    • Popa, C.1
  • 294
    • 2142825025 scopus 로고    scopus 로고
    • Kaczmarz extended algorithm for tomographic image reconstruction from limited data
    • C. Popa, R. Zdunek, Kaczmarz extended algorithm for tomographic image reconstruction from limited data. Math. Comput. Simulat. 65, 579-598 (2004)
    • (2004) Math. Comput. Simulat. , vol.65 , pp. 579-598
    • Popa, C.1    Zdunek, R.2
  • 295
    • 0019019734 scopus 로고
    • Generalized array pattern synthesis by the method of alternating orthogonal projections
    • S. Prasad, Generalized array pattern synthesis by the method of alternating orthogonal projections. IEEE Trans. Antenn. Propag. 28, 328-332 (1980) (Pubitemid 10486234)
    • (1980) IEEE Transactions on Antennas and Propagation , vol.AP-28 , Issue.3 , pp. 328-332
    • Prasad Surendra1
  • 296
    • 0347582868 scopus 로고
    • A geometric projection-space reconstruction algorithm
    • J.L. Prince, A.S. Willsky, A geometric projection-space reconstruction algorithm. Lin. Algebra Appl. 130, 151-191 (1990)
    • (1990) Lin. Algebra Appl. , vol.130 , pp. 151-191
    • Prince, J.L.1    Willsky, A.S.2
  • 297
    • 79955012169 scopus 로고    scopus 로고
    • Convergence of infinite products of nonexpansive operators in hilbert space
    • E. Pustylnik, S. Reich, A.J. Zaslavski, Convergence of infinite products of nonexpansive operators in Hilbert space. J. Nonlinear Convex Anal. 11, 461-474 (2010)
    • (2010) J. Nonlinear Convex Anal. , vol.11 , pp. 461-474
    • Pustylnik, E.1    Reich, S.2    Zaslavski, A.J.3
  • 298
    • 79955020762 scopus 로고    scopus 로고
    • Convergence of non-cyclic infinite products of operators
    • E. Pustylnik, S. Reich, A.J. Zaslavski, Convergence of non-cyclic infinite products of operators. J. Math. Anal. Appl. 380, 759-767 (2011)
    • (2011) J. Math. Anal. Appl. , vol.380 , pp. 759-767
    • Pustylnik, E.1    Reich, S.2    Zaslavski, A.J.3
  • 299
    • 25444477311 scopus 로고    scopus 로고
    • A note on the CQ algorithm for the split feasibility problem
    • DOI 10.1088/0266-5611/21/5/009, PII S0266561105930037
    • B. Qu, N. Xiu, A note on the CQ algorithm for the split feasibility problem. Inverse Probl. 21, 1655-1665 (2005) (Pubitemid 41376698)
    • (2005) Inverse Problems , vol.21 , Issue.5 , pp. 1655-1665
    • Qu, B.1    Xiu, N.2
  • 300
    • 38149116401 scopus 로고    scopus 로고
    • A new halfspace-relaxation projection method for the split feasibility problem
    • B. Qu, N. Xiu, A new halfspace-relaxation projection method for the split feasibility problem. Lin. Algebra Appl. 428, 1218-1229 (2008)
    • (2008) Lin. Algebra Appl. , vol.428 , pp. 1218-1229
    • Qu, B.1    Xiu, N.2
  • 301
    • 0001720708 scopus 로고
    • Weak convergence theorems for nonexpansive mappings in banach spaces
    • S. Reich, Weak convergence theorems for nonexpansive mappings in Banach spaces. J. Math. Anal. Appl. 67, 274-276 (1979)
    • (1979) J. Math. Anal. Appl. , vol.67 , pp. 274-276
    • Reich, S.1
  • 302
    • 0038313697 scopus 로고
    • A limit theorem for projections
    • S. Reich, A limit theorem for projections. Lin. Multilinear Algebra 13, 281-290 (1983)
    • (1983) Lin. Multilinear Algebra , vol.13 , pp. 281-290
    • Reich, S.1
  • 303
    • 84968513648 scopus 로고
    • The asymptotic behavior of firmly nonexpansive mappings
    • S. Reich and I. Shafrir, The asymptotic behavior of firmly nonexpansive mappings. Proc. Am. Math. Soc. 101, 246-250 (1987)
    • (1987) Proc. Am. Math. Soc. , vol.101 , pp. 246-250
    • Reich, S.1    Shafrir, I.2
  • 304
    • 0035217713 scopus 로고    scopus 로고
    • Attracting Mappings in Banach and Hyperbolic Spaces
    • DOI 10.1006/jmaa.2000.7105, PII S0022247X00971051
    • S. Reich, A.J. Zaslavski, Attracting mappings in Banach and hyperbolic spaces. J. Math. Anal. Appl. 253, 250-268 (2001) (Pubitemid 33380887)
    • (2001) Journal of Mathematical Analysis and Applications , vol.253 , Issue.1 , pp. 250-268
    • Reich, S.1    Zaslavski, A.J.2
  • 305
    • 0004267646 scopus 로고
    • Princeton University Press, Princeton
    • R.T. Rockafellar, Convex Analysis (Princeton University Press, Princeton, 1970)
    • (1970) Convex Analysis
    • Rockafellar, R.T.1
  • 306
    • 0016985417 scopus 로고
    • Monotone operators and the proximal point algorithm
    • R.T. Rockafellar, Monotone operators and the proximal point algorithm. SIAM J. Contr. Optim. 14, 877-898 (1976)
    • (1976) SIAM J. Contr. Optim. , vol.14 , pp. 877-898
    • Rockafellar, R.T.1
  • 307
    • 0004057553 scopus 로고
    • 2nd edn. McGraw-Hill, New York
    • W. Rudin, Functional Analysis, 2nd edn. (McGraw-Hill, New York, 1991)
    • (1991) Functional Analysis
    • Rudin, W.1
  • 308
    • 84868336339 scopus 로고    scopus 로고
    • Polish translation PWN, Warszawa
    • Polish translation: Analiza funkcjonalna (PWN, Warszawa, 2002)
    • (2002) Analiza Funkcjonalna
  • 309
    • 10044289695 scopus 로고    scopus 로고
    • POCSENSE: POCS-based reconstruction for sensitivity encoded magnetic resonance imaging
    • DOI 10.1002/mrm.20285
    • A.A. Samsonov, E.G. Kholmovski, D.L. Parker, C.R. Johnson, POCSENSE: POCS-based reconstruction for sensitivity encoded magnetic resonance imaging. Magn. Reson. Med. 52, 1397-1406 (2004) (Pubitemid 39612829)
    • (2004) Magnetic Resonance in Medicine , vol.52 , Issue.6 , pp. 1397-1406
    • Samsonov, A.A.1    Kholmovski, E.G.2    Parker, D.L.3    Johnson, C.R.4
  • 310
    • 0000118621 scopus 로고
    • Der Fixpunktsatz in Funktionalräumen
    • J. Schauder, Der Fixpunktsatz in Funktionalräumen. Studia Math. 2, 171-180 (1930)
    • (1930) Studia Math. , vol.2 , pp. 171-180
    • Schauder, J.1
  • 311
    • 0042240464 scopus 로고
    • A general iterative scheme with applications to convex optimization and related fields
    • D. Schott, A general iterative scheme with applications to convex optimization and related fields. Optimization 22, 885-902 (1991)
    • (1991) Optimization , vol.22 , pp. 885-902
    • Schott, D.1
  • 312
    • 0036643371 scopus 로고    scopus 로고
    • A class of optimized row projection methods for solving large nonsymmetric linear systems
    • DOI 10.1016/S0168-9274(01)00131-3, PII S0168927401001313
    • H.D. Scolnik, N. Echebest, M.T. Guardarucci, M.C. Vacchino, A class of optimized row projection methods for solving large nonsymmetric linear systems. Appl. Numer. Math. 41, 499-513 (2002) (Pubitemid 34498251)
    • (2002) Applied Numerical Mathematics , vol.41 , Issue.4 , pp. 499-513
    • Scolnik, H.1    Echebest, N.2    Guardarucci, M.T.3    Vacchino, M.C.4
  • 313
    • 0036959207 scopus 로고    scopus 로고
    • Acceleration scheme for parallel projected aggregation methods for solving large linear systems
    • H.D. Scolnik, N. Echebest, M.T. Guardarucci, M.C. Vacchino, Acceleration scheme for parallel projected aggregation methods for solving large linear systems. Ann. Oper. Res. 117, 95-115 (2002)
    • (2002) Ann. Oper. Res. , vol.117 , pp. 95-115
    • Scolnik, H.D.1    Echebest, N.2    Guardarucci, M.T.3    Vacchino, M.C.4
  • 314
    • 34347236956 scopus 로고    scopus 로고
    • Incomplete oblique projections for solving large inconsistent linear systems
    • DOI 10.1007/s10107-006-0066-4
    • H.D. Scolnik, N. Echebest, M.T. Guardarucci, M.C. Vacchino, Incomplete oblique projections for solving large inconsistent linear systems. Math. Program. 111, 273-300 (2008) (Pubitemid 46993963)
    • (2008) Mathematical Programming , vol.111 , Issue.1-2 , pp. 273-300
    • Scolnik, H.D.1    Echebest, N.2    Guardarucci, M.T.3    Vacchino, M.C.4
  • 316
    • 84968519140 scopus 로고
    • Approximating fixed points of nonexpansive mappings
    • H.F. Senter, W.G. Dotson Jr., Approximating fixed points of nonexpansive mappings. Proc. Am. Math. Soc. 44, 375-380 (1974)
    • (1974) Proc. Am. Math. Soc. , vol.44 , pp. 375-380
    • Senter, H.F.1    Dotson Jr., W.G.2
  • 317
    • 70349799077 scopus 로고    scopus 로고
    • Optimum signal and image recovery by the method of alternating projections in fractional fourier domains
    • A. Serbes, L. Durak, Optimum signal and image recovery by the method of alternating projections in fractional Fourier domains. Comm. Nonlinear Sci. Numer. Simulat. 15, 675-689 (2010)
    • (2010) Comm. Nonlinear Sci. Numer. Simulat. , vol.15 , pp. 675-689
    • Serbes, A.1    Durak, L.2
  • 318
    • 55049092166 scopus 로고    scopus 로고
    • Multiple-viewpoint projection holograms synthesized by spatially incoherent correlation with broadband functions
    • N.T. Shaked, J. Rosen, Multiple-viewpoint projection holograms synthesized by spatially incoherent correlation with broadband functions. J. Opt. Soc. Am. A 25, 2129-2138 (2008)
    • (2008) J. Opt. Soc. Am. A , vol.25 , pp. 2129-2138
    • Shaked, N.T.1    Rosen, J.2
  • 319
    • 0011128924 scopus 로고    scopus 로고
    • Set theoretic estimation for problems in subtractive color
    • G. Sharma, Set theoretic estimation for problems in subtractive color. Color Res. Appl. 25, 333-348 (2000)
    • (2000) Color Res. Appl. , vol.25 , pp. 333-348
    • Sharma, G.1
  • 320
    • 56749170311 scopus 로고    scopus 로고
    • Extrapolation of signals using the method of alternating projections in fractional fourier domains
    • K.K. Sharma, S.D. Joshi, Extrapolation of signals using the method of alternating projections in fractional Fourier domains. Signal Image Video Process. 2, 177-182 (2008)
    • (2008) Signal Image Video Process. , vol.2 , pp. 177-182
    • Sharma, K.K.1    Joshi, S.D.2
  • 321
    • 84966200203 scopus 로고
    • Practical and mathematical aspects of the problem of reconstructing objects from radiographs
    • K.T. Smith, D.C. Solman, S.L. Wagner, Practical and mathematical aspects of the problem of reconstructing objects from radiographs. Bull. Am. Math. Soc. 83, 1227-1270 (1977)
    • (1977) Bull. Am. Math. Soc. , vol.83 , pp. 1227-1270
    • Smith, K.T.1    Solman, D.C.2    Wagner, S.L.3
  • 323
    • 0024758573 scopus 로고
    • High resolution image recovery from image-plane arrays, using convex projections
    • H. Stark, P. Oskoui, High resolution image recovery from image-plane arrays, using convex projections. J. Opt. Soc. Am. A 6, 1715-1726 (1989)
    • (1989) J. Opt. Soc. Am. A , vol.6 , pp. 1715-1726
    • Stark, H.1    Oskoui, P.2
  • 326
    • 80053248602 scopus 로고    scopus 로고
    • Strong convergence theorems for fixed point problems, equilibrium problems and applications
    • C. Sudsukh, Strong convergence theorems for fixed point problems, equilibrium problems and applications. Int. J. Math. Anal. (Ruse) 3, 1867-1880 (2009)
    • (2009) Int. J. Math. Anal. (Ruse) , vol.3 , pp. 1867-1880
    • Sudsukh, C.1
  • 328
    • 38749141398 scopus 로고    scopus 로고
    • Strong convergence theorems by hybrid methods for families of nonexpansive mappings in hilbert spaces
    • W. Takahashi, Y. Takeuchi, R. Kubota, Strong convergence theorems by hybrid methods for families of nonexpansive mappings in Hilbert spaces. J. Math. Anal. Appl. 341, 276-286 (2008)
    • (2008) J. Math. Anal. Appl. , vol.341 , pp. 276-286
    • Takahashi, W.1    Takeuchi, Y.2    Kubota, R.3
  • 329
    • 1542269554 scopus 로고
    • Projection method for solving a singular system of linear equations and its applications
    • K. Tanabe, Projection method for solving a singular system of linear equations and its applications. Numer. Math. 17, 203-214 (1971)
    • (1971) Numer. Math. , vol.17 , pp. 203-214
    • Tanabe, K.1
  • 330
    • 0038087245 scopus 로고
    • Characterization of linear stationary iterative processes for solving a singular system of linear equations
    • K. Tanabe, Characterization of linear stationary iterative processes for solving a singular system of linear equations. Numer. Math. 22, 349-359 (1974)
    • (1974) Numer. Math. , vol.22 , pp. 349-359
    • Tanabe, K.1
  • 331
    • 0036702059 scopus 로고    scopus 로고
    • Observations of area averaged near-surface wind- and temperature-fields in real terrain using acoustic travel time tomography
    • DOI 10.1127/0941-2948/2002/0011-0273
    • G. Tetzlaff, K. Arnold, A. Raabe, A. Ziemann, Observations of area averaged near-surface wind- and temperature-fields in real terrain using acoustic travel time tomography. Meteorologische Zeitschrift 11, 273-283 (2002) (Pubitemid 35307799)
    • (2002) Meteorologische Zeitschrift , vol.11 , Issue.4 , pp. 273-283
    • Tetzlaff, G.1    Arnold, K.2    Raabe, A.3    Ziemann, A.4
  • 332
    • 0141631886 scopus 로고    scopus 로고
    • From physical dose constraints to equivalent uniform dose constraints in inverse radiotherapy planning
    • DOI 10.1118/1.1598852
    • Ch. Thieke, T. Bortfeld, A. Niemierko, S. Nill, From physical dose constraints to equivalent uniform dose constraints in inverse radiotherapy planning. Med. Phys. 30, 2332-2339 (2003) (Pubitemid 37129739)
    • (2003) Medical Physics , vol.30 , Issue.9 , pp. 2332-2339
    • Thieke, C.1    Bortfeld, T.2    Niemierko, A.3    Nill, S.4
  • 335
    • 0000198907 scopus 로고
    • Global convergence of a class of trust region methods for nonconvex minimization in hilbert space
    • Ph. L. Toint, Global convergence of a class of trust region methods for nonconvex minimization in Hilbert space. IMA J. Numer. Anal. 8, 231-252 (1988)
    • (1988) IMA J. Numer. Anal. , vol.8 , pp. 231-252
    • Toint Ph., L.1
  • 336
    • 4243435874 scopus 로고    scopus 로고
    • Two-dimensional reconstruction of small angle scattering patterns from rocking curves
    • PII S0921452697008351
    • W. Treimer, U. Feye-Treimer, Two dimensional reconstruction of small angle scattering patterns from rocking curves. Physica B 241-243, 1228-1230 (1998) (Pubitemid 128639426)
    • (1997) Physica B: Condensed Matter , vol.241-243 , pp. 1228-1230
    • Treimer, W.1    Feye-Treimer, U.2
  • 338
    • 5744234249 scopus 로고
    • SMART - An algorithm for reconstructing pictures from projections
    • M.R. Trummer, SMART - an algorithm for reconstructing pictures from projections. J. Appl. Math. Phys. 34, 746-753 (1983)
    • (1983) J. Appl. Math. Phys. , vol.34 , pp. 746-753
    • Trummer, M.R.1
  • 339
    • 0000320937 scopus 로고
    • On the convergence of the products of firmly nonexpansive mappings
    • P. Tseng, On the convergence of the products of firmly nonexpansive mappings. SIAM J. Optim. 2, 425-434 (1992)
    • (1992) SIAM J. Optim. , vol.2 , pp. 425-434
    • Tseng, P.1
  • 340
    • 0023519906 scopus 로고
    • Numerical solution of large sparse linear algebraic systems arising from tomographic problems
    • ed. by G. Nolet Reidel, Dordrecht
    • A. Van der Sluis, H.A. Van der Vorst, in Numerical Solution of Large Sparse Linear Algebraic Systems Arising from Tomographic Problems, ed. by G. Nolet. Seismic Tomography (Reidel, Dordrecht, 1987)
    • (1987) Seismic Tomography
    • Van Der Sluis, H.A.1    Van Der Vorst, A.2
  • 344
    • 0004145937 scopus 로고
    • Oxford University Press, Oxford
    • R. Webster, Convexity (Oxford University Press, Oxford, 1994)
    • (1994) Convexity
    • Webster, R.1
  • 345
    • 34249959151 scopus 로고
    • Conformal mapping by the method of alternating projections
    • R. Wegmann, Conformal mapping by the method of alternating projections. Numer. Math. 56, 291-307 (1989)
    • (1989) Numer. Math. , vol.56 , pp. 291-307
    • Wegmann, R.1
  • 346
    • 0001682125 scopus 로고
    • Approximation of fixed points of nonexpansive mappings
    • R. Wittmann, Approximation of fixed points of nonexpansive mappings. Arch. Math. 58, 486-491 (1992)
    • (1992) Arch. Math. , vol.58 , pp. 486-491
    • Wittmann, R.1
  • 347
    • 34250385434 scopus 로고
    • Finding the nearest point in a polytope
    • P. Wolfe, Finding the nearest point in a polytope. Math. Program. 11, 128-149 (1976)
    • (1976) Math. Program. , vol.11 , pp. 128-149
    • Wolfe, P.1
  • 349
    • 0037252237 scopus 로고    scopus 로고
    • The least-intensity feasible solution for aperture-based inverse planning in radiation therapy
    • Y. Xiao, Y. Censor, D. Michalski, J.M. Galvin, The least-intensity feasible solution for aperture-based inverse planning in radiation therapy. Ann. Oper. Res. 119, 183-203 (2003)
    • (2003) Ann. Oper. Res. , vol.119 , pp. 183-203
    • Xiao, Y.1    Censor, Y.2    Michalski, D.3    Galvin, J.M.4
  • 350
    • 0036692463 scopus 로고    scopus 로고
    • Iterative algorithms for nonlinear operators
    • H.-K. Xu, Iterative algorithms for nonlinear operators. J. Lond. Math. Soc. 66, 240-256 (2002)
    • (2002) J. Lond. Math. Soc. , vol.66 , pp. 240-256
    • Xu, H.-K.1
  • 351
    • 0037269525 scopus 로고    scopus 로고
    • An iterative approach to quadratic optimization
    • H.-K. Xu, An iterative approach to quadratic optimization. J. Optim. Theor. Appl. 116, 659-678 (2003)
    • (2003) J. Optim. Theor. Appl. , vol.116 , pp. 659-678
    • Xu, H.-K.1
  • 352
    • 33846078029 scopus 로고    scopus 로고
    • A variable Krasnosel'skii-Mann algorithm and the multiple-set split feasibility problem
    • DOI 10.1088/0266-5611/22/6/007, PII S0266561106153903, 007
    • H.-K. Xu, A variable Krasnosel'skiǐ-Mann algorithm and the multiple-set split feasibility problem. Inverse Probl. 22, 2021-2034 (2006) (Pubitemid 46069498)
    • (2006) Inverse Problems , vol.22 , Issue.6 , pp. 2021-2034
    • Xu, H.-K.1
  • 353
    • 77956693893 scopus 로고    scopus 로고
    • The hybrid steepest descent method for the variational inequality problem over the intersection of fixed point sets of nonexpansive mappings
    • ed. by D. Butnariu, Y. Censor, S. Reich Elsevier Science, Amsterdam
    • I. Yamada, in The Hybrid Steepest Descent Method for the Variational Inequality Problem Over the Intersection of Fixed Point Sets of Nonexpansive Mappings, ed. by D. Butnariu, Y. Censor, S. Reich. Inherently Parallel Algorithms in Feasibility and Optimization and their Applications, Studies in Computational Mathematics, Vol. 8 (Elsevier Science, Amsterdam, 2001), pp. 473-504
    • (2001) Inherently Parallel Algorithms in Feasibility and Optimization and their Applications, Studies in Computational Mathematics , vol.8 , pp. 473-504
    • Yamada, I.1
  • 354
    • 11144241645 scopus 로고    scopus 로고
    • Hybrid steepest descent method for variational inequality problem over the fixed point set of certain quasi-nonexpansive mappings
    • DOI 10.1081/NFA-200045815
    • I. Yamada, N. Ogura, Hybrid steepest descent method for variational inequality problem over the fixed point set of certain quasi-nonexpansive mappings. Numer. Funct. Anal. Optim. 25, 619-655 (2004) (Pubitemid 40050079)
    • (2004) Numerical Functional Analysis and Optimization , vol.25 , Issue.7-8 , pp. 619-655
    • Yamada, I.1    Ogura, N.2
  • 355
    • 11144235357 scopus 로고    scopus 로고
    • Adaptive projected subgradient method for asymptotic Minimization of sequence of nonnegative convex functions
    • DOI 10.1081/NFA-200045806
    • I. Yamada, N. Ogura, Adaptive projected subgradient method for asymptotic minimization of sequence of nonnegative convex functions. Numer. Funct. Anal. Optim. 25, 593-617 (2004) (Pubitemid 40050078)
    • (2004) Numerical Functional Analysis and Optimization , vol.25 , Issue.7-8 , pp. 593-617
    • Yamada, I.1    Ogura, N.2
  • 358
    • 4043102605 scopus 로고    scopus 로고
    • The relaxed CQ algorithm solving the split feasibility problem
    • Q.Z. Yang, The relaxed CQ algorithm solving the split feasibility problem. Inverse Probl. 20, 1261-1266 (2004)
    • (2004) Inverse Probl. , vol.20 , pp. 1261-1266
    • Yang, Q.Z.1
  • 359
    • 0026634445 scopus 로고
    • New iterative methods for linear inequalities
    • K. Yang, K.G. Murty, New iterative methods for linear inequalities. JOTA 72, 163-185 (1992)
    • (1992) JOTA , vol.72 , pp. 163-185
    • Yang, K.1    Murty, K.G.2
  • 360
    • 33744515112 scopus 로고    scopus 로고
    • Generalized KM theorems and their applications
    • DOI 10.1088/0266-5611/22/3/006, PII S0266561106054104
    • Q. Yang, J. Zhao, Generalized KM theorems and their applications. Inverse Probl. 22, 833-844 (2006) (Pubitemid 43814731)
    • (2006) Inverse Problems , vol.22 , Issue.3 , pp. 833-844
    • Yang, Q.1    Zhao, J.2
  • 361
    • 41849118386 scopus 로고    scopus 로고
    • Weak and strong convergence of krasnoselski-mann iteration for hierarchical fixed point problems
    • Y. Yao, Y.-C. Liou, Weak and strong convergence of Krasnoselski-Mann iteration for hierarchical fixed point problems. Inverse Probl. 24, 015015, 8 (2008)
    • (2008) Inverse Probl. , vol.24 , Issue.8 , pp. 015015
    • Yao, Y.1    Liou, Y.-C.2
  • 362
    • 0018008609 scopus 로고
    • Generalized image restoration by the method of alternating orthogonal projections
    • D. Youla, Generalized image restoration by the method of alternating orthogonal projections. IEEE Trans. Circ. Syst. 25, 694-702 (1978) (Pubitemid 9394315)
    • (1978) IEEE Trans Circuits Syst , vol.CAS-25 , Issue.9 , pp. 694-702
    • Youla Dante, C.1
  • 363
    • 33947144069 scopus 로고    scopus 로고
    • Pairwise optimal weight realization - Acceleration technique for set-theoretic adaptive parallel subgradient projection algorithm
    • DOI 10.1109/TSP.2006.881225
    • M. Yukawa, I. Yamada, Pairwise optimal weight realization - Acceleration technique for settheoretic adaptive parallel subgradient projection algorithm. IEEE Trans. Signal Process. 54, 4557-4571 (2006) (Pubitemid 46405600)
    • (2006) IEEE Transactions on Signal Processing , vol.54 , Issue.12 , pp. 4557-4571
    • Yukawa, M.1    Yamada, I.2
  • 365
    • 0002130882 scopus 로고
    • Projections on convex sets in hilbert space and spectral theory
    • ed. by E.H. Zarantonello Academic, New York
    • E.H. Zarantonello, in Projections on Convex Sets in Hilbert Space and Spectral Theory, ed. by E.H. Zarantonello. Contributions to Nonlinear Functional Analysis (Academic, New York, 1971), pp. 237-424
    • (1971) Contributions to Nonlinear Functional Analysis , pp. 237-424
    • Zarantonello, E.H.1
  • 367
    • 53149091440 scopus 로고    scopus 로고
    • Image recovery using the EM algorithm
    • ed. by V.K. Madisetti, D.B. Williams CRC Press LLC, Boca Raton
    • J. Zhang, A.K. Katsaggelos, in Image Recovery Using the EM Algorithm, ed. by V.K. Madisetti, D.B. Williams. Digital Signal Processing Handbook (CRC Press LLC, Boca Raton, 1999)
    • (1999) Digital Signal Processing Handbook
    • Zhang, J.1    Katsaggelos, A.K.2
  • 368
    • 0035402414 scopus 로고    scopus 로고
    • The principles and practice of iterative alternating projection algorithm: Solution for non-LTE stellar atmospheric model with the method of linearized separation
    • D.F. Zhao, The principles and practice of iterative alternating projection algorithm: Solution for non-LTE stellar atmospheric model with the method of linearized separation. Chin. Astron. Astrophys. 25, 305-316 (2001)
    • (2001) Chin. Astron. Astrophys. , vol.25 , pp. 305-316
    • Zhao, D.F.1
  • 369
    • 25444479430 scopus 로고    scopus 로고
    • Several solution methods for the split feasibility problem
    • DOI 10.1088/0266-5611/21/5/017, PII S0266561105988989
    • J. Zhao, Q. Yang, Several solution methods for the split feasibility problem. Inverse Probl. 21, 1791-1799 (2005) (Pubitemid 41376706)
    • (2005) Inverse Problems , vol.21 , Issue.5 , pp. 1791-1799
    • Zhao, J.1    Yang, Q.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.