메뉴 건너뛰기




Volumn 22, Issue 3, 2006, Pages 833-844

Generalized KM theorems and their applications

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CONVERGENCE OF NUMERICAL METHODS; IMAGE PROCESSING; ITERATIVE METHODS; NUMERICAL METHODS; SIGNAL PROCESSING;

EID: 33744515112     PISSN: 02665611     EISSN: 13616420     Source Type: Journal    
DOI: 10.1088/0266-5611/22/3/006     Document Type: Article
Times cited : (90)

References (21)
  • 1
    • 4043116347 scopus 로고    scopus 로고
    • Weak convergence of a relaxed and inertial hybrid projection-proximal point algorithm for maximal monotone operators in Hilbert space
    • 10.1137/S1052623403427859 1052-6234
    • Alvarez F 2004 Weak convergence of a relaxed and inertial hybrid projection-proximal point algorithm for maximal monotone operators in Hilbert space SIAM J. Optim. 14 773-82
    • (2004) SIAM J. Optim. , vol.14 , Issue.3 , pp. 773-782
    • Alvarez, F.1
  • 2
    • 0003513119 scopus 로고
    • Variational convergence for functions and operators
    • Attouch H 1984 Variational convergence for functions and operators Applicable Mathematics Series (Boston, MA: Pitman)
    • (1984) Applicable Mathematics Series
    • Attouch, H.1
  • 3
    • 79951834032 scopus 로고
    • Isometries for the Legendre-Fenchel transform
    • 10.2307/2000559 0002-9947
    • Attouch H and Wets R B 1986 Isometries for the Legendre-Fenchel transform Trans. Am. Math. Soc. 296 33-60
    • (1986) Trans. Am. Math. Soc. , vol.296 , Issue.1 , pp. 33-60
    • Attouch, H.1    Wets, R.B.2
  • 4
    • 0002434986 scopus 로고    scopus 로고
    • A logarithmic-quadratic proximal method for variational inequalities
    • 10.1023/A:1008607511915 0926-6003
    • Auslender A, Teboulle M and Ben-Tiba S 1999 A logarithmic-quadratic proximal method for variational inequalities Comput. Optim. Appl. 12 31-40
    • (1999) Comput. Optim. Appl. , vol.12 , pp. 31-40
    • Auslender, A.1    Teboulle, M.2    Ben-Tiba, S.3
  • 5
    • 0030246542 scopus 로고    scopus 로고
    • On projection algorithms for solving convex feasibility problems
    • 10.1137/S0036144593251710 0036-1445
    • Bauschke H and Borwein J 1996 On projection algorithms for solving convex feasibility problems SIAM Rev. 38 367-426
    • (1996) SIAM Rev. , vol.38 , Issue.3 , pp. 367-426
    • Bauschke, H.1    Borwein, J.2
  • 6
    • 0002633798 scopus 로고
    • Krasnoselski-Mann iterations in normed spaces
    • 0008-4395
    • Borwein J, Reich S and Shafrir I 1992 Krasnoselski-Mann iterations in normed spaces Can. Math. Bull. 35 21-8
    • (1992) Can. Math. Bull. , vol.35 , pp. 21-28
    • Borwein, J.1    Reich, S.2    Shafrir, I.3
  • 7
    • 0036538286 scopus 로고    scopus 로고
    • Iterative oblique projection onto convex sets and the split feasibility problem
    • 0266-5611 310
    • Byrne C L 2002 Iterative oblique projection onto convex sets and the split feasibility problem Inverse Problems 18 441-53
    • (2002) Inverse Problems , vol.18 , Issue.2 , pp. 441-453
    • Byrne, C.L.1
  • 8
    • 1342265919 scopus 로고    scopus 로고
    • A unified treatment of some iterative algorithms in signal processing and image reconstruction
    • 0266-5611 006
    • Byrne C L 2004 A unified treatment of some iterative algorithms in signal processing and image reconstruction Inverse Problems 20 103-20
    • (2004) Inverse Problems , vol.20 , Issue.1 , pp. 103-120
    • Byrne, C.L.1
  • 9
    • 1342286898 scopus 로고    scopus 로고
    • Fejér monotonicity in convex optimization
    • Combettes P 2000 Fejér monotonicity in convex optimization Encyclopedia of Optimization ed C A Floudas and P M Pardalos (Boston, MA: Kluwer)
    • (2000) Encyclopedia of Optimization
    • Combettes, P.1
  • 10
    • 0000424337 scopus 로고
    • A multiprojection algorithm using Bregman projections in a product space
    • 10.1007/BF02142692 1017-1398
    • Censor Y and Elfving T 1994 A multiprojection algorithm using Bregman projections in a product space Numer. Algorithms 8 221-39
    • (1994) Numer. Algorithms , vol.8 , Issue.2 , pp. 221-239
    • Censor, Y.1    Elfving, T.2
  • 11
    • 0039336108 scopus 로고
    • A simultaneous projections method for linear inequalities
    • 10.1016/0024-3795(85)90280-0 0024-3795
    • De Pierro A R and Iusem A N 1985 A simultaneous projections method for linear inequalities Lin. Alg. Appl. 64 243-53
    • (1985) Lin. Alg. Appl. , vol.64 , pp. 243-253
    • De Pierro, A.R.1    Iusem, A.N.2
  • 12
    • 0027113845 scopus 로고
    • On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
    • 10.1007/BF01581204 0025-5610
    • Eckstein J and Bertsekas D P 1992 On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators Math. Program 55 293-318
    • (1992) Math. Program , vol.55 , Issue.1-3 , pp. 293-318
    • Eckstein, J.1    Bertsekas, D.P.2
  • 14
    • 24944576683 scopus 로고    scopus 로고
    • Inexact implicit methods for monotone general variational inequalities
    • 10.1007/s101070050086 0025-5610
    • He B 1999 Inexact implicit methods for monotone general variational inequalities Math. Program. 86 199-217
    • (1999) Math. Program. , vol.86 , Issue.1 , pp. 199-217
    • He, B.1
  • 15
    • 84968518052 scopus 로고
    • Mean value methods in iteration
    • 10.2307/2032162 0002-9939
    • Mann W 1953 Mean value methods in iteration Proc. Am. Math. Soc. 4 506-10
    • (1953) Proc. Am. Math. Soc. , vol.4 , Issue.3 , pp. 506-510
    • Mann, W.1
  • 17
    • 0033752480 scopus 로고    scopus 로고
    • Convergence of Krasnoselskii-Mann iterations of nonexpansive operators
    • 10.1016/S0895-7177(00)00214-4 0895-7177
    • Reich S and Zaslavski A J 2000 Convergence of Krasnoselskii-Mann iterations of nonexpansive operators Math. Comput. Modelling 32 1423-31
    • (2000) Math. Comput. Modelling , vol.32 , Issue.11-13 , pp. 1423-1431
    • Reich, S.1    Zaslavski, A.J.2
  • 18
    • 0016985417 scopus 로고
    • Monotone operators and the proximal point algorithm
    • 10.1137/0314056 0363-0129
    • Rockafellar R T 1976 Monotone operators and the proximal point algorithm SIAM J. Control Optim. 14 877-98
    • (1976) SIAM J. Control Optim. , vol.14 , Issue.5 , pp. 877-898
    • Rockafellar, R.T.1
  • 20
    • 4043102605 scopus 로고    scopus 로고
    • The relaxed CQ algorithm solving the split feasibility problem
    • 0266-5611 014
    • Yang Q 2004 The relaxed CQ algorithm solving the split feasibility problem Inverse Problems 20 1261-6
    • (2004) Inverse Problems , vol.20 , Issue.4 , pp. 1261-1266
    • Yang, Q.1
  • 21
    • 25444479430 scopus 로고    scopus 로고
    • Several solution methods for the split feasibility problem
    • 0266-5611 017
    • Zhao J and Yang Q 2005 Several solution methods for the split feasibility problem Inverse Problems 21 1791-9
    • (2005) Inverse Problems , vol.21 , Issue.5 , pp. 1791-1799
    • Zhao, J.1    Yang, Q.2


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