메뉴 건너뛰기




Volumn 26, Issue 6, 2010, Pages

Perturbation resilience and superiorization of iterative algorithms

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER MEMORIES; COMPUTER RESOURCES; CONVEX FEASIBILITY PROBLEM; CONVEX SET; EXECUTION TIME; FINITE NUMBER; IMAGE RECONSTRUCTION FROM PROJECTIONS; ITERATIVE ALGORITHM; MATHEMATICAL FORMS; OPTIMIZATION PROBLEMS; ORIGINAL ALGORITHMS; PROJECTION ALGORITHMS; TOTAL VARIATION;

EID: 77954036226     PISSN: 02665611     EISSN: 13616420     Source Type: Journal    
DOI: 10.1088/0266-5611/26/6/065008     Document Type: Article
Times cited : (152)

References (35)
  • 1
    • 0000198744 scopus 로고
    • Block-iterative projection methods for parallel computation of solutions to convex feasibility problems
    • Aharoni R and Censor Y 1989 Block-iterative projection methods for parallel computation of solutions to convex feasibility problems Linear Algebra Appl. 120 165-75
    • (1989) Linear Algebra Appl. , vol.120 , pp. 165-175
    • Aharoni, R.1    Censor, Y.2
  • 2
    • 0030246542 scopus 로고    scopus 로고
    • On projection algorithms for solving convex feasibility problems
    • Bauschke H H and Borwein J M 1996 On projection algorithms for solving convex feasibility problems SIAM Rev. 38 367-426
    • (1996) SIAM Rev. , vol.38 , pp. 367-426
    • Bauschke, H.H.1    Borwein, J.M.2
  • 3
    • 33645751712 scopus 로고    scopus 로고
    • Extrapolation algorithm for affine-convex feasibility problems
    • Bauschke H H, Combettes P L and Kruk S G 2006 Extrapolation algorithm for affine-convex feasibility problems Numer. Algorithms 41 239-74
    • (2006) Numer. Algorithms , vol.41 , pp. 239-274
    • Bauschke, H.H.1    Combettes, P.L.2    Kruk, S.G.3
  • 4
    • 0347269125 scopus 로고    scopus 로고
    • Projection and proximal point methods: Convergence results and counterexamples
    • Bauschke H H, Matoukov E and Reich S 2004 Projection and proximal point methods: convergence results and counterexamples Nonlinear Anal. 56 715-38
    • (2004) Nonlinear Anal. , vol.56 , pp. 715-738
    • Bauschke, H.H.1    Matoukov, E.2    Reich, S.3
  • 5
    • 5744237139 scopus 로고
    • On the behavior of a block-iterative projection method for solving convex feasibility problems
    • Butnariu D and Censor Y 1990 On the behavior of a block-iterative projection method for solving convex feasibility problems Int. J. Comput. Math. 34 79-94
    • (1990) Int. J. Comput. Math. , vol.34 , pp. 79-94
    • Butnariu, D.1    Censor, Y.2
  • 6
    • 39449105966 scopus 로고    scopus 로고
    • Stable convergence behavior under summable perturbations of a class of projection methods for convex feasibility and optimization problems
    • Butnariu D, Davidi R, Herman G T and Kazantsev I G 2007 Stable convergence behavior under summable perturbations of a class of projection methods for convex feasibility and optimization problems IEEE J. Sel. Top. Sign. Process. 1 540-7
    • (2007) IEEE J. Sel. Top. Sign. Process. , vol.1 , pp. 540-547
    • Butnariu, D.1    Davidi, R.2    Herman, G.T.3    Kazantsev, I.G.4
  • 7
    • 39449117883 scopus 로고    scopus 로고
    • Convergence to fixed points of inexact orbits of Bregman-monotone and nonexpansive operators in Banach spaces
    • ed H F Nathansky, B G de Buen, K Goebel, W A Kirk and B Sims (Yokohama: Yokohama Publishers)
    • Butnariu D, Reich S and Zaslavski A J 2006 Convergence to fixed points of inexact orbits of Bregman-monotone and nonexpansive operators in Banach spaces Fixed Point Theory and Applications ed H F Nathansky, B G de Buen, K Goebel, W A Kirk and B Sims (Yokohama: Yokohama Publishers) pp 11-32
    • (2006) Fixed Point Theory and Applications , pp. 11-32
    • Butnariu, D.1    Reich, S.2    Zaslavski, A.J.3
  • 8
    • 46249089856 scopus 로고    scopus 로고
    • Stable convergence theorems for infinite products and powers of nonexpansive mappings
    • Butnariu D, Reich S and Zaslavski A J 2008 Stable convergence theorems for infinite products and powers of nonexpansive mappings Numer. Funct. Anal. Opt. 29 304-23
    • (2008) Numer. Funct. Anal. Opt. , vol.29 , pp. 304-323
    • Butnariu, D.1    Reich, S.2    Zaslavski, A.J.3
  • 12
    • 28544451131 scopus 로고    scopus 로고
    • The multiple-sets split feasibility problem and its applications for inverse problems
    • Censor Y, Elfving T, Kopf N and Bortfeld T 2005 The multiple-sets split feasibility problem and its applications for inverse problems Inverse Problems 21 2071-84
    • (2005) Inverse Problems , vol.21 , pp. 2071-2084
    • Censor, Y.1    Elfving, T.2    Kopf, N.3    Bortfeld, T.4
  • 13
    • 0035487602 scopus 로고    scopus 로고
    • BICAV: A block-iterative, parallel algorithm for sparse systems with pixel-related weighting
    • Censor Y, Gordon D and Gordon R 2001 BICAV: a block-iterative, parallel algorithm for sparse systems with pixel-related weighting IEEE Trans. Med. Imaging 20 1050-60
    • (2001) IEEE Trans. Med. Imaging , vol.20 , pp. 1050-1060
    • Censor, Y.1    Gordon, D.2    Gordon, R.3
  • 14
    • 70349775963 scopus 로고    scopus 로고
    • On the string averaging method for sparse common fixed points problems
    • Censor Y and Segal A 2009 On the string averaging method for sparse common fixed points problems Int. Trans. Oper. Res. 16 481-94
    • (2009) Int. Trans. Oper. Res. , vol.16 , pp. 481-494
    • Censor, Y.1    Segal, A.2
  • 15
    • 0242468035 scopus 로고    scopus 로고
    • Convergence of string-averaging projection schemes for inconsistent convex feasibility problems
    • Censor Y and Tom E 2003 Convergence of string-averaging projection schemes for inconsistent convex feasibility problems Optim. Methods Softw. 18 543-54
    • (2003) Optim. Methods Softw. , vol.18 , pp. 543-554
    • Censor, Y.1    Tom, E.2
  • 18
    • 77954607855 scopus 로고    scopus 로고
    • The convex feasibility problem in image recovery
    • Combettes P L 1996 The convex feasibility problem in image recovery Adv. Imag. Elec. Phys. 95 155-270
    • (1996) Adv. Imag. Elec. Phys. , vol.95 , pp. 155-270
    • Combettes, P.L.1
  • 19
    • 0031148181 scopus 로고    scopus 로고
    • Hilbertian convex feasibility problem: Convergence of projection methods
    • Combettes P L 1997 Hilbertian convex feasibility problem: convergence of projection methods Appl. Math. Opt. 35 311-30
    • (1997) Appl. Math. Opt. , vol.35 , pp. 311-330
    • Combettes, P.L.1
  • 20
    • 0031118954 scopus 로고    scopus 로고
    • Convex set theoretic image recovery by extrapolated iterations of parallel subgradient projections
    • Combettes P L 1997 Convex set theoretic image recovery by extrapolated iterations of parallel subgradient projections IEEE Trans. Image Process. 6 493-506
    • (1997) IEEE Trans. Image Process. , vol.6 , pp. 493-506
    • Combettes, P.L.1
  • 21
    • 0036871107 scopus 로고    scopus 로고
    • An adaptive level set method for nondifferentiable constrained image recovery
    • Combettes P L and Luo J 2002 An adaptive level set method for nondifferentiable constrained image recovery IEEE Trans. Image Process. 11 1295-304
    • (2002) IEEE Trans. Image Process. , vol.11 , pp. 1295-1304
    • Combettes, P.L.1    Luo, J.2
  • 22
    • 0242701031 scopus 로고    scopus 로고
    • Finding common fixed points of strict paracontractions by averaging strings of sequential iterations
    • Crombez G 2002 Finding common fixed points of strict paracontractions by averaging strings of sequential iterations J. Nonlinear Convex Anal. 3 345-51
    • (2002) J. Nonlinear Convex Anal. , vol.3 , pp. 345-351
    • Crombez, G.1
  • 23
    • 77954049138 scopus 로고    scopus 로고
    • Perturbation-resilient block-iterative projection methods with application to image reconstruction from projections
    • Davidi R, Herman G T and Censor Y 2009 Perturbation-resilient block-iterative projection methods with application to image reconstruction from projections Int. Trans. Oper. Res. 16 505-24
    • (2009) Int. Trans. Oper. Res. , vol.16 , pp. 505-524
    • Davidi, R.1    Herman, G.T.2    Censor, Y.3
  • 25
    • 0002416978 scopus 로고
    • Iterative algorithms for large partitioned linear systems, with applications to image reconstruction
    • Eggermont P P B, Herman G T and Lent A 1981 Iterative algorithms for large partitioned linear systems, with applications to image reconstruction Linear Algebra Appl. 40 37-67
    • (1981) Linear Algebra Appl. , vol.40 , pp. 37-67
    • Eggermont, P.P.B.1    Herman, G.T.2    Lent, A.3
  • 28
    • 49749137392 scopus 로고    scopus 로고
    • On image reconstruction from a small number of projections
    • Herman G T and Davidi R 2008 On image reconstruction from a small number of projections Inverse Problems 24 045011
    • (2008) Inverse Problems , vol.24 , pp. 045011
    • Herman, G.T.1    Davidi, R.2
  • 29
    • 0031285686 scopus 로고    scopus 로고
    • Surrogate projection methods for finding fixed points of firmly nonexpansive mappings
    • Kiwiel K C and Łopuch B 1997 Surrogate projection methods for finding fixed points of firmly nonexpansive mappings SIAM J. Optim. 7 1084-102
    • (1997) SIAM J. Optim. , vol.7 , pp. 1084-1102
    • Kiwiel, K.C.1    Łopuch, B.2
  • 30
    • 0023981933 scopus 로고
    • Strong convergence of projection-like methods in Hilbert spaces
    • Ottavy N 1988 Strong convergence of projection-like methods in Hilbert spaces J. Optim. Theory Appl. 56 433-61
    • (1988) J. Optim. Theory Appl. , vol.56 , pp. 433-461
    • Ottavy, N.1
  • 32
    • 0021201713 scopus 로고
    • Decomposition through formalization in a product space
    • Pierra G 1984 Decomposition through formalization in a product space Math. Program. 28 96-115
    • (1984) Math. Program. , vol.28 , pp. 96-115
    • Pierra, G.1
  • 33
    • 0242532212 scopus 로고    scopus 로고
    • An application of the string averaging method to one-sided best simultaneous approximation
    • Rhee H 2003 An application of the string averaging method to one-sided best simultaneous approximation J. Korea Soc. Math. Educ. Ser. B: Pure Appl. Math. 10 49-56
    • (2003) J. Korea Soc. Math. Educ. Ser. B: Pure Appl. Math. , vol.10 , pp. 49-56
    • Rhee, H.1
  • 34
    • 54749125796 scopus 로고    scopus 로고
    • An iterative regularization method for the solution of the split feasibility problem in Banach spaces
    • Schöpfer F, Schuster T and Louis A K 2008 An iterative regularization method for the solution of the split feasibility problem in Banach spaces Inverse Problems 24 055008
    • (2008) Inverse Problems , vol.24 , pp. 055008
    • Schöpfer F, S.1
  • 35
    • 25444479430 scopus 로고    scopus 로고
    • Several solution methods for the split feasibility problem
    • Zhao J and Yang Q 2005 Several solution methods for the split feasibility problem Inverse Problems 21 1791-9
    • (2005) Inverse Problems , vol.21 , pp. 1791-1799
    • Zhao, J.1    Yang, Q.2


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