In this article, we introduce a hybrid iterative scheme for finding a common element of the set of solutions for a generalized equilibrium problems, the set of common fixed point for a family of infinite k-strict pseu...In this article, we introduce a hybrid iterative scheme for finding a common element of the set of solutions for a generalized equilibrium problems, the set of common fixed point for a family of infinite k-strict pseudo-contractive mappings, and the set of solutions of the variational inclusion problem with multi-valued maximal monotone mappings and inverse-strongly monotone mappings in Hilbert space. Under suitable conditions, some strong convergence theorems are proved. Our results extends the recent results in G.L.Acedo and H.K.Xu [2], Zhang, Lee and Chan [8], Wakahashi and Toyoda [9], Takahashi and Takahashi [I0] and S. S. Chang, H. W. Joseph Lee and C. K. Chan [II], S.Takahashi and W.Takahashi [12]. Moreover, the method of proof adopted in this article is different from those of [4] and [12].展开更多
k holomorphic functions are a type of generation of holomorphic functions.In this paper,a nonlinear boundary value problem for k holomorphic functions is primarily discussed on generalized polycylinders in C^(2).The e...k holomorphic functions are a type of generation of holomorphic functions.In this paper,a nonlinear boundary value problem for k holomorphic functions is primarily discussed on generalized polycylinders in C^(2).The existence of the solution for the problem is studied in detail with the help of the boundary properties of Cauchy type singular integral operators with a k holomorphic kernel.Furthermore,the integral representation for the solution is obtained.展开更多
In this paper, we consider the socalled k-coloring problem in general case.Firstly, a special quadratic 0-1 programming is constructed to formulate k-coloring problem. Secondly, by use of the equivalence between above...In this paper, we consider the socalled k-coloring problem in general case.Firstly, a special quadratic 0-1 programming is constructed to formulate k-coloring problem. Secondly, by use of the equivalence between above quadratic0-1 programming and its relaxed problem, k-coloring problem is converted intoa class of (continuous) nonconvex quadratic programs, and several theoreticresults are also introduced. Thirdly, linear programming approximate algorithmis quoted and verified for this class of nonconvex quadratic programs. Finally,examining problems which are used to test the algorithm are constructed andsufficient computation experiments are reported.展开更多
基金supported by Scientific Research Fund of Sichuan Provincial Education Department (09ZB102)Scientific Research Fund of Science and Technology Deportment of Sichuan Provincial (2011JYZ011)
文摘In this article, we introduce a hybrid iterative scheme for finding a common element of the set of solutions for a generalized equilibrium problems, the set of common fixed point for a family of infinite k-strict pseudo-contractive mappings, and the set of solutions of the variational inclusion problem with multi-valued maximal monotone mappings and inverse-strongly monotone mappings in Hilbert space. Under suitable conditions, some strong convergence theorems are proved. Our results extends the recent results in G.L.Acedo and H.K.Xu [2], Zhang, Lee and Chan [8], Wakahashi and Toyoda [9], Takahashi and Takahashi [I0] and S. S. Chang, H. W. Joseph Lee and C. K. Chan [II], S.Takahashi and W.Takahashi [12]. Moreover, the method of proof adopted in this article is different from those of [4] and [12].
基金the NSF of China(11571089,11871191)the NSF of Henan Province(222300420397)+1 种基金the NSF of Hebei Province(A2022208007)the Key Foundation of Hebei Normal University(L2018Z01)。
文摘k holomorphic functions are a type of generation of holomorphic functions.In this paper,a nonlinear boundary value problem for k holomorphic functions is primarily discussed on generalized polycylinders in C^(2).The existence of the solution for the problem is studied in detail with the help of the boundary properties of Cauchy type singular integral operators with a k holomorphic kernel.Furthermore,the integral representation for the solution is obtained.
文摘In this paper, we consider the socalled k-coloring problem in general case.Firstly, a special quadratic 0-1 programming is constructed to formulate k-coloring problem. Secondly, by use of the equivalence between above quadratic0-1 programming and its relaxed problem, k-coloring problem is converted intoa class of (continuous) nonconvex quadratic programs, and several theoreticresults are also introduced. Thirdly, linear programming approximate algorithmis quoted and verified for this class of nonconvex quadratic programs. Finally,examining problems which are used to test the algorithm are constructed andsufficient computation experiments are reported.
