We propose a projection-type algorithm for generalized mixed variational in- equality problem in Euclidean space Rn. We establish the convergence theorem for the pro- posed algorithm, provided the multi-valued mapping...We propose a projection-type algorithm for generalized mixed variational in- equality problem in Euclidean space Rn. We establish the convergence theorem for the pro- posed algorithm, provided the multi-valued mapping is continuous and f-pseudomonotone with nonempty compact convex values on dom（f）, where f ： Rn --RU{＋∞} is a proper func- tion. The algorithm presented in this paper generalize and improve some known algorithms in literatures. Preliminary computational experience is also reported.展开更多
This paper investigates various Weber problems including unconstrained Weber problems and constrained Weber problems under l1, l2 and l∞-norms. First with a transformation technique various Weber problems are turned ...This paper investigates various Weber problems including unconstrained Weber problems and constrained Weber problems under l1, l2 and l∞-norms. First with a transformation technique various Weber problems are turned into a class of monotone linear variational inequalities. By exploiting the favorable structure of these variational inequalities, we present a new projection-type method for them. Compared with some other projection-type methods which can solve monotone linear variational inequality, this new projection-type method is simple in numerical implementations and more efficient for solving this class of problems; Compared with some popular methods for solving unconstrained Weber problem and constrained Weber problem, a singularity would not happen in this new method and it is more reliable by using this new method to solve various Weber problems.展开更多
基金supported by the Scientific Research Foundation of Sichuan Normal University(20151602)National Natural Science Foundation of China(10671135,61179033)and the Key Project of Chinese Ministry of Education(212147)
文摘We propose a projection-type algorithm for generalized mixed variational in- equality problem in Euclidean space Rn. We establish the convergence theorem for the pro- posed algorithm, provided the multi-valued mapping is continuous and f-pseudomonotone with nonempty compact convex values on dom（f）, where f ： Rn --RU{＋∞} is a proper func- tion. The algorithm presented in this paper generalize and improve some known algorithms in literatures. Preliminary computational experience is also reported.
文摘This paper investigates various Weber problems including unconstrained Weber problems and constrained Weber problems under l1, l2 and l∞-norms. First with a transformation technique various Weber problems are turned into a class of monotone linear variational inequalities. By exploiting the favorable structure of these variational inequalities, we present a new projection-type method for them. Compared with some other projection-type methods which can solve monotone linear variational inequality, this new projection-type method is simple in numerical implementations and more efficient for solving this class of problems; Compared with some popular methods for solving unconstrained Weber problem and constrained Weber problem, a singularity would not happen in this new method and it is more reliable by using this new method to solve various Weber problems.
