A region segmentation algorithm for solving a class of variational inequality problems
The variational inequality problem on non-convex domain with holes is studied.The method of adding dynamic constraint function to partition the non-convex feasible domain with holes into non-convex feasible domains without holes is used.The relationship of the solutions between them and the dynamic constraint homotopy algorithm on non-convex without holes which is easy to select the initial point are given.It is proved that the homotopy paths are existent,bounded and convergent.The validity of the algorithm is verified by numerical examples.
万方数据
维普
