一类广义集值变分包含组的逼近算法

The appoximation alogrithms of a system of generalized set valued variational inclusions

利用预解算子技巧讨论了一类广义集值变分包含组,给出了求其解的逼近算法,并证明了这种算法的强收敛性,所得结论是新的,从而推广了这方面的相应结果.

By using the resolvent operator technique,this paper introduces and studies a system of generalized set-valued variationl inclusions.An iterative algorithm to compute appoximate solution is provided.It is proved that the iterative algorithm converges are strong to the solution of the system of the variational inclusion.The present results are new,and generalize some recent results in the field.