메뉴 건너뛰기
Mathematical Inequalities and Applications
Volumn 7, Issue 3, 2004, Pages 453-456
A simple proof for some important properties of the projection mapping
Author keywords

Projected gradient method; Projection and contraction method; Projection mapping; Variational inequality
Indexed keywords

EID: 3843100239     PISSN: 13314343     EISSN: None     Source Type: Journal    
DOI: 10.7153/mia-07-45     Document Type: Article
Times cited : (37)
References (13)
  • 1
    • 0023416451 scopus 로고
    • Projected gradient methods for linearly constrained problems
    • P. H. CALAMAI AND J. J. MORE, Projected gradient methods for linearly constrained problems, Math. Programming 39 (1987), 93-116.
    • (1987) Math. Programming , vol.39 , pp. 93-116
    • Calamai, P.H.1    More, J.J.2
  • 2
    • 0001918140 scopus 로고
    • On the basic theorem of complementarity
    • B. C. EAVES, On the basic theorem of complementarity, Math. Programming 1 (1971), 68-75.
    • (1971) Math. Programming , vol.1 , pp. 68-75
    • Eaves, B.C.1
  • 3
    • 0021522309 scopus 로고
    • Two-metric projection methods for constrained optimization
    • E. M. GAFNI AND D. P. BERTSEKAS, Two-metric projection methods for constrained optimization, SIAM J. Control Optim. 22 (1984), 936-964.
    • (1984) SIAM J. Control Optim. , vol.22 , pp. 936-964
    • Gafni, E.M.1    Bertsekas, D.P.2
  • 5
    • 84966240089 scopus 로고
    • Convex programming in hilbert space
    • A. A. GOLDSTEIN, Convex Programming in Hilbert Space, Bull. Amer. Math. Soc. 70 (1964), 709-710.
    • (1964) Bull. Amer. Math. Soc. , vol.70 , pp. 709-710
    • Goldstein, A.A.1
  • 6
    • 0000527168 scopus 로고
    • A projection and contraction method for a class of linear complementarity problem and its application in convex quadratic programming
    • B. S. HE, A Projection and Contraction Method for a Class of Linear Complementarity Problem and its Application in Convex Quadratic Programming, Appl. Math. Optim. 25 (1992), 247-262.
    • (1992) Appl. Math. Optim. , vol.25 , pp. 247-262
    • He, B.S.1
  • 7
    • 0028767587 scopus 로고
    • A new method for a class of linear variational inequalities
    • B. S. HE, A New Method for a Class of Linear Variational Inequalities, Math. Programming 66 (1994), 137-144.
    • (1994) Math. Programming , vol.66 , pp. 137-144
    • He, B.S.1
  • 8
    • 21344492689 scopus 로고
    • Solving a class of linear projection equations
    • B. S. HE, Solving a Class of Linear Projection Equations, Numer. Math. 68 (1994), 71-80.
    • (1994) Numer. Math. , vol.68 , pp. 71-80
    • He, B.S.1
  • 9
    • 0030819777 scopus 로고    scopus 로고
    • A class of projection and contraction methods for monotone variational inequalities
    • B. S. HE, A Class of Projection and Contraction Methods for Monotone Variational Inequalities, Appl. Math. Optim. 35 (1997), 69-76.
    • (1997) Appl. Math. Optim. , vol.35 , pp. 69-76
    • He, B.S.1
  • 10
    • 24944576683 scopus 로고    scopus 로고
    • Inexact implicit methods for monotone general variational inequalities
    • B. S. HE, Inexact implicit methods for monotone general variational inequalities, Math. Programming 86 (1999), 199-217.
    • (1999) Math. Programming , vol.86 , pp. 199-217
    • He, B.S.1
  • 12
    • 0001070251 scopus 로고    scopus 로고
    • Equivalence of variational inequality problems to unconstrained minimization
    • J. M. PENG, Equivalence of variational inequality problems to unconstrained minimization, Math. Programming 78 (1997), 347-355.
    • (1997) Math. Programming , vol.78 , pp. 347-355
    • Peng, J.M.1
  • 13
    • 0000860428 scopus 로고    scopus 로고
    • A hybrid Newton method for solving the variational inequality problem via the D-gap function
    • J. M. PENG AND M. FUKUSHIMA, A hybrid Newton method for solving the variational inequality problem via the D-gap function, Math. Programming 86 (1999), 367-386.
    • (1999) Math. Programming , vol.86 , pp. 367-386
    • Peng, J.M.1    Fukushima, M.2

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