메뉴 건너뛰기




Volumn 119, Issue 1, 2003, Pages 185-201

Convergence of hybrid steepest-descent methods for variational inequalities

Author keywords

Constrained pseudoinverses; Convergence; Hilbert space; Hybrid steepest descent methods; Iterative algorithms; Nonexpansive mappings

Indexed keywords

ITERATIVE METHODS; MAPPING; MATHEMATICAL OPERATORS; STEEPEST DESCENT METHOD; VARIATIONAL TECHNIQUES;

EID: 0344512422     PISSN: 00223239     EISSN: None     Source Type: Journal    
DOI: 10.1023/B:JOTA.0000005048.79379.b6     Document Type: Article
Times cited : (322)

References (18)
  • 3
    • 0000743842 scopus 로고
    • Variational inequalities and the pricing of American options
    • JAILLET, P., LAMBERTON, D., and LAPEYRE, B., Variational Inequalities and the Pricing of American Options, Acta Applicandae Mathematicae, Vol. 21, pp. 263-289, 1990.
    • (1990) Acta Applicandae Mathematicae , vol.21 , pp. 263-289
    • Jaillet, P.1    Lamberton, D.2    Lapeyre, B.3
  • 7
    • 77956693893 scopus 로고    scopus 로고
    • The hybrid steepest-descent method for variational inequality problems over the intersection of the fixed-point sets of nonexpansive mappings
    • Edited by D. Butnariu, Y. Censor, and S. Reich, North-Holland, Amsterdam, Holland
    • YAMADA, I., The Hybrid Steepest-Descent Method for Variational Inequality Problems over the Intersection of the Fixed-Point Sets of Nonexpansive Mappings, Inherently Parallel Algorithms in Feasibility and Optimization and Their Applications, Edited by D. Butnariu, Y. Censor, and S. Reich, North-Holland, Amsterdam, Holland, pp. 473-504, 2001.
    • (2001) Inherently Parallel Algorithms in Feasibility and Optimization and Their Applications , pp. 473-504
    • Yamada, I.1
  • 8
    • 0031999680 scopus 로고    scopus 로고
    • Minimizing certain convex functions over the intersection of the fixed-point sets of nonexpansive mappings
    • DEUTSCH, F., and YAMADA, I., Minimizing Certain Convex Functions over the Intersection of the Fixed-Point Sets of Nonexpansive Mappings, Numerical Functional Analysis and Optimization, Vol. 19, pp. 33-56, 1998.
    • (1998) Numerical Functional Analysis and Optimization , vol.19 , pp. 33-56
    • Deutsch, F.1    Yamada, I.2
  • 11
    • 0030586523 scopus 로고    scopus 로고
    • The approximation of fixed points of compositions of non-expansive mappings in Hilbert spaces
    • BAUSCHKE, H. H., The Approximation of Fixed Points of Compositions of Non-expansive Mappings in Hilbert Spaces, Journal of Mathematical Analysis and Applications, Vol. 202, pp. 150-159, 1996.
    • (1996) Journal of Mathematical Analysis and Applications , vol.202 , pp. 150-159
    • Bauschke, H.H.1
  • 12
    • 0001682125 scopus 로고
    • Approximation of fixed points of nonexpansive mappings
    • WITTMANN, R., Approximation of Fixed Points of Nonexpansive Mappings, Archiv der Mathematik, Vol. 58, pp. 486-491, 1992.
    • (1992) Archiv der Mathematik , vol.58 , pp. 486-491
    • Wittmann, R.1
  • 13
    • 0037269525 scopus 로고    scopus 로고
    • An iterative approach to quadratic optimization
    • XU, H. K., An Iterative Approach to Quadratic Optimization, Journal of Optimization Theory and Applications, Vol. 116, pp. 659-678, 2003.
    • (2003) Journal of Optimization Theory and Applications , vol.116 , pp. 659-678
    • Xu, H.K.1
  • 15
    • 0000482370 scopus 로고
    • An iterative algorithm for the variational inequality problem
    • IUSEM, A. N., An Iterative Algorithm for the Variational Inequality Problem, Computational and Applied Mathematics, Vol. 13, pp. 103-114, 1994.
    • (1994) Computational and Applied Mathematics , vol.13 , pp. 103-114
    • Iusem, A.N.1
  • 16
    • 0000683866 scopus 로고    scopus 로고
    • An interior-point method with bregman functions for the variational inequality problem with paramonotone operators
    • CENSOR, Y., IUSEM, A. N., and ZENIOS, S. A., An Interior-Point Method with Bregman Functions for the Variational Inequality Problem with Paramonotone Operators, Mathematical Programming, Vol. 81, pp. 373-400, 1998.
    • (1998) Mathematical Programming , vol.81 , pp. 373-400
    • Censor, Y.1    Iusem, A.N.2    Zenios, S.A.3
  • 17
    • 0030246542 scopus 로고    scopus 로고
    • On projection algorithms for solving convex feasibility problems
    • BAUSCHKE, H. H., and BORWEIN, J. M., On Projection Algorithms for Solving Convex Feasibility Problems, SIAM Review, Vol. 38, pp. 367-426, 1996.
    • (1996) SIAM Review , vol.38 , pp. 367-426
    • Bauschke, H.H.1    Borwein, J.M.2


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