메뉴 건너뛰기




Volumn 16, Issue 7-8, 2008, Pages 899-912

Strong convergence of projected subgradient methods for nonsmooth and nonstrictly convex minimization

Author keywords

Convex minimization; Nonsmooth optimization; Projected gradient method; Viscosity method

Indexed keywords


EID: 58149142982     PISSN: 09276947     EISSN: None     Source Type: Journal    
DOI: 10.1007/s11228-008-0102-z     Document Type: Article
Times cited : (767)

References (27)
  • 1
    • 0040908440 scopus 로고
    • Recurrence relations and variational inequalities
    • Y.I. Albert 1983 Recurrence relations and variational inequalities Soviet Mathematics, Doklady 27 511 517
    • (1983) Soviet Mathematics, Doklady , vol.27 , pp. 511-517
    • Albert, Y.I.1
  • 2
    • 0035633006 scopus 로고    scopus 로고
    • Extension of subgradient techniques for nonsmooth optimization in a Banach space
    • Y.I. Albert A.N. Iusem 2001 Extension of subgradient techniques for nonsmooth optimization in a Banach space Set-Valued Anal. 9 315 335
    • (2001) Set-Valued Anal. , vol.9 , pp. 315-335
    • Albert, Y.I.1    Iusem, A.N.2
  • 3
    • 0004841122 scopus 로고    scopus 로고
    • On the projected subgradient method for nonsmooth convex optimization in a Hilbert space
    • Y.I. Albert A.N. Iusem M.V. Solodov 1998 On the projected subgradient method for nonsmooth convex optimization in a Hilbert space Math. Program. 81 23 35
    • (1998) Math. Program. , vol.81 , pp. 23-35
    • Albert, Y.I.1    Iusem, A.N.2    Solodov, M.V.3
  • 4
    • 0035351666 scopus 로고    scopus 로고
    • A weak-to-strong convergence principle for Fejer monotone methods in Hilbert space
    • H.H. Bauschke P.L. Combettes 2001 A weak-to-strong convergence principle for Fejer monotone methods in Hilbert space Math. Oper. Res. 26 248 264
    • (2001) Math. Oper. Res. , vol.26 , pp. 248-264
    • Bauschke, H.H.1    Combettes, P.L.2
  • 5
    • 18344374225 scopus 로고    scopus 로고
    • Preconditioned spectral projected-gradient method on convex sets
    • L. Bello M. Raydan 2005 Preconditioned spectral projected-gradient method on convex sets J. Comput. Math. 23 225 232
    • (2005) J. Comput. Math. , vol.23 , pp. 225-232
    • Bello, L.1    Raydan, M.2
  • 6
    • 0000050153 scopus 로고
    • Projection methods for variational inequalities with applications to the traffic assignment problem
    • D.P. Bertsekas E.M. Gafni 1982 Projection methods for variational inequalities with applications to the traffic assignment problem Math. Program. Stud. 17 139 159
    • (1982) Math. Program. Stud. , vol.17 , pp. 139-159
    • Bertsekas, D.P.1    Gafni, E.M.2
  • 7
    • 0016948909 scopus 로고
    • On the Goldstein-Levitin-Polyak gradient projection method
    • 2
    • D.P. Bertsekas 1976 On the Goldstein-Levitin-Polyak gradient projection method IEEE Trans. Automat. Contr. AC-21 2 174 184
    • (1976) IEEE Trans. Automat. Contr. , vol.21 , pp. 174-184
    • Bertsekas, D.P.1
  • 8
    • 0036538286 scopus 로고    scopus 로고
    • A unified treatment of some iterative algorithms in signal processing and image reconstruction
    • C.L. Byrne 2004 A unified treatment of some iterative algorithms in signal processing and image reconstruction Inverse Problems 18 441 453
    • (2004) Inverse Problems , vol.18 , pp. 441-453
    • Byrne, C.L.1
  • 10
    • 33646971357 scopus 로고
    • Convergence of some algorithms for convex minimization
    • R. Correa C. Lemaréchal 1993 Convergence of some algorithms for convex minimization Math. Program. 62 261 275
    • (1993) Math. Program. , vol.62 , pp. 261-275
    • Correa, R.1    Lemaréchal, C.2
  • 11
    • 0002125350 scopus 로고    scopus 로고
    • Convex analysis and variational problems
    • SIAM Philadelphia
    • Ekeland, I., Themam, R.: Convex analysis and variational problems. In: Classic in Applied Mathematics, p. 28. SIAM, Philadelphia (1999)
    • (1999) Classic in Applied Mathematics , pp. 28
    • Ekeland, I.1    Themam, R.2
  • 12
    • 34250521052 scopus 로고
    • Methods for solving nonlinear extremal problems
    • Y.M. Ermoliev 1966 Methods for solving nonlinear extremal problems Cybernet. 2 1 17
    • (1966) Cybernet. , vol.2 , pp. 1-17
    • Ermoliev, Y.M.1
  • 13
    • 18244366888 scopus 로고    scopus 로고
    • The gradient projection method with exact line search
    • W.W. Hager S. Park 2004 The gradient projection method with exact line search J. Glob. Optim. 30 103 118
    • (2004) J. Glob. Optim. , vol.30 , pp. 103-118
    • Hager, W.W.1    Park, S.2
  • 14
    • 84894234564 scopus 로고
    • Fixed points of nonexpanding maps
    • B. Halpern 1967 Fixed points of nonexpanding maps Bull. Amer. Math. Soc. 73 957 961
    • (1967) Bull. Amer. Math. Soc. , vol.73 , pp. 957-961
    • Halpern, B.1
  • 15
    • 33144472015 scopus 로고    scopus 로고
    • On the convergence properties of the projected gradient method for convex optimization
    • 1
    • A.N. Iusem 2003 On the convergence properties of the projected gradient method for convex optimization Comput. Appl. Math. 22 1 37 52
    • (2003) Comput. Appl. Math. , vol.22 , pp. 37-52
    • Iusem, A.N.1
  • 16
    • 0007291751 scopus 로고
    • A modification of the extragradient method for the solution of variational inequalities and some optimization problems
    • E.N. Khobotov 1987 A modification of the extragradient method for the solution of variational inequalities and some optimization problems Zh. Vychisl. Mat. Mat. Fiz. 27 1462 1473
    • (1987) Zh. Vychisl. Mat. Mat. Fiz. , vol.27 , pp. 1462-1473
    • Khobotov, E.N.1
  • 17
    • 0000005602 scopus 로고
    • The extragradient method for finding saddle points and other problems
    • G.M. Korpelevich 1976 The extragradient method for finding saddle points and other problems Matecon 12 747 756
    • (1976) Matecon , vol.12 , pp. 747-756
    • Korpelevich, G.M.1
  • 18
    • 0000915170 scopus 로고
    • Applications of Khobotov's algorithm to variational and network equlibrium problems
    • P. Marcotte 1991 Applications of Khobotov's algorithm to variational and network equlibrium problems Inform. Syst. Oper. Res. 29 258 270
    • (1991) Inform. Syst. Oper. Res. , vol.29 , pp. 258-270
    • Marcotte, P.1
  • 19
    • 34548678430 scopus 로고    scopus 로고
    • Strong convergence of an iterative method for hierarchical fixed-point problems
    • 3
    • P.E. Maingé A. Moudafi 2007 Strong convergence of an iterative method for hierarchical fixed-point problems Pacific J. Optim. 3 3 529 538
    • (2007) Pacific J. Optim. , vol.3 , pp. 529-538
    • Maingé, P.E.1    Moudafi, A.2
  • 20
    • 0033634301 scopus 로고    scopus 로고
    • Viscosity approximations methods for fixed point problems
    • A. Moudafi 2000 Viscosity approximations methods for fixed point problems J. Math. Anal. Appl. 241 46 55
    • (2000) J. Math. Anal. Appl. , vol.241 , pp. 46-55
    • Moudafi, A.1
  • 21
    • 33750918646 scopus 로고    scopus 로고
    • Strong convergence theorem by a hybrid method for nonexpansive mappings and Lipschitz continuous monotone mappings
    • 4
    • N. Nadezhkina W. Takahashi 2006 Strong convergence theorem by a hybrid method for nonexpansive mappings and Lipschitz continuous monotone mappings SIAM J. Optim. 16 4 1230 1241
    • (2006) SIAM J. Optim. , vol.16 , pp. 1230-1241
    • Nadezhkina, N.1    Takahashi, W.2
  • 22
    • 0030243756 scopus 로고    scopus 로고
    • Modified projection methods for monotone variational inequalities
    • 5
    • M.V. Solodov P. Tseng 1996 Modified projection methods for monotone variational inequalities SIAM J. Control Optim. 34 5 1814 1834
    • (1996) SIAM J. Control Optim. , vol.34 , pp. 1814-1834
    • Solodov, M.V.1    Tseng, P.2
  • 23
    • 0032345479 scopus 로고    scopus 로고
    • Error stability properties of generalized gradient-type algorithms
    • M.V. Solodov S.K. Zavriev 1998 Error stability properties of generalized gradient-type algorithms J. Optim. Theory Appl. 98 663 680
    • (1998) J. Optim. Theory Appl. , vol.98 , pp. 663-680
    • Solodov, M.V.1    Zavriev, S.K.2
  • 24
    • 0032632635 scopus 로고    scopus 로고
    • A new projection method for variational inequality problems
    • 3
    • M.V. Solodov 1999 A new projection method for variational inequality problems SIAM J. Control Optim. 37 3 756 776
    • (1999) SIAM J. Control Optim. , vol.37 , pp. 756-776
    • Solodov, M.V.1
  • 25
    • 34047192934 scopus 로고    scopus 로고
    • A note on the gradient projection method with exact stepsize rule
    • 2
    • N. Xiu C. Wang L. Kong 2007 A note on the gradient projection method with exact stepsize rule J. Comput. Math. 25 2 221 230
    • (2007) J. Comput. Math. , vol.25 , pp. 221-230
    • Xiu, N.1    Wang, C.2    Kong, L.3
  • 26
    • 11144241645 scopus 로고    scopus 로고
    • Hybrid steepest descent method for the variational inequality problem over the fixed point set of certain quasi-nonexpansive mappings
    • 7-8
    • I. Yamada N. Ogura 2004 Hybrid steepest descent method for the variational inequality problem over the fixed point set of certain quasi-nonexpansive mappings Numer. Funct. Anal. Optim. 25 7-8 619 655
    • (2004) Numer. Funct. Anal. Optim. , vol.25 , pp. 619-655
    • Yamada, I.1    Ogura, N.2
  • 27
    • 33750069770 scopus 로고    scopus 로고
    • Strong convergence theorem by an extragradient method for fixed point problems and variational inequality problems
    • 5
    • L.C. Zeng J.C. Yao 2006 Strong convergence theorem by an extragradient method for fixed point problems and variational inequality problems Taiwan. J. Math. 10 5 1293 1303
    • (2006) Taiwan. J. Math. , vol.10 , pp. 1293-1303
    • Zeng, L.C.1    Yao, J.C.2


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