Đang chuẩn bị nút TẢI XUỐNG, xin hãy chờ
Tải xuống
Tuyển tập báo cáo các nghiên cứu khoa học quốc tế ngành hóa học dành cho các bạn yêu hóa học tham khảo đề tài: Research Article The Over-Relaxed A-Proximal Point Algorithm for General Nonlinear Mixed Set-Valued Inclusion Framework | Hindawi Publishing Corporation Fixed Point Theory and Applications Volume 2011 Article ID 840978 12 pages doi 10.1155 2011 840978 Research Article The Over-Relaxed A-Proximal Point Algorithm for General Nonlinear Mixed Set-Valued Inclusion Framework Xian Bing Pan 1 Hong Gang Li 2 and An Jian Xu3 1 Yitong College Chongqing University of Posts and Telecommunications Chongqing 400065 China 2 Institute of Applied Mathematics Research Chongqing University of Posts and Telecommunications Chongqing 400065 China 3 College of Mathematics and Statistics Chongqing University of Technology Chongqing 400054 China Correspondence should be addressed to Xian Bing Pan panxianb@163.com Received 16 November 2010 Accepted 10 January 2011 Academic Editor T. Benavides Copyright 2011 Xian Bing Pan et al. This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use distribution and reproduction in any medium provided the original work is properly cited. The purpose of this paper is 1 a general nonlinear mixed set-valued inclusion framework for the over-relaxed A-proximal point algorithm based on the A n -accretive mapping is introduced and 2 it is applied to the approximation solvability of a general class of inclusions problems using the generalized resolvent operator technique due to Lan-Cho-Verma and the convergence of iterative sequences generated by the algorithm is discussed in -uniformly smooth Banach spaces. The results presented in the paper improve and extend some known results in the literature. 1. Introduction In recent years various set-valued variational inclusion frameworks which have wide applications to many fields including for example mechanics physics optimization and control nonlinear programming economics and engineering sciences have been intensively studied by Ding and Luo 1 Verma 2 Huang 3 Fang and Huang 4 Fang et al. 5 Lan et al. 6 Zhang et al. 7 respectively. Recently Verma 8 has intended to develop a .
