We introduce and study in the present paper the general version of Gauss-type proximal point algorithm (in short GG-PPA) for solving the inclusion , where T is a set-valued mapping which is not necessarily monotone ac...We introduce and study in the present paper the general version of Gauss-type proximal point algorithm (in short GG-PPA) for solving the inclusion , where T is a set-valued mapping which is not necessarily monotone acting from a Banach space X to a subset of a Banach space Y with locally closed graph. The convergence of the GG-PPA is present here by choosing a sequence of functions with , which is Lipschitz continuous in a neighbourhood O of the origin and when T is metrically regular. More precisely, semi-local and local convergence of GG-PPA are analyzed. Moreover, we present a numerical example to validate the convergence result of GG-PPA.展开更多
Consider X and Y are two real or complex Banach spaces. We introduce and study a modified Gauss-type proximal point algorithm (in short modified G-PPA) for solving the generalized equations of the form 0 ∈h(...Consider X and Y are two real or complex Banach spaces. We introduce and study a modified Gauss-type proximal point algorithm (in short modified G-PPA) for solving the generalized equations of the form 0 ∈h(x) + H(x), where h : X → Y is a smooth function on Ω ⊆X and H : X ⇉2<sup>Y</sup> is a set valued mapping with closed graph. When H is metrically regular and under some sufficient conditions, we analyze both semi-local and local convergence of the modified G-PPA. Moreover, the convergence results of the modified G-PPA are justified by presenting a numerical example.展开更多
In the present paper,we study the restricted inexact Newton-type method for solving the generalized equation 0∈f(x)+F(x),where X and Y are Banach spaces,f:X→Y is a Frechet differentiable function and F:X■Y is a set...In the present paper,we study the restricted inexact Newton-type method for solving the generalized equation 0∈f(x)+F(x),where X and Y are Banach spaces,f:X→Y is a Frechet differentiable function and F:X■Y is a set-valued mapping with closed graph.We establish the convergence criteria of the restricted inexact Newton-type method,which guarantees the existence of any sequence generated by this method and show this generated sequence is convergent linearly and quadratically according to the particular assumptions on the Frechet derivative of f.Indeed,we obtain semilocal and local convergence results of restricted inexact Newton-type method for solving the above generalized equation when the Frechet derivative of f is continuous and Lipschitz continuous as well as f+F is metrically regular.An application of this method to variational inequality is given.In addition,a numerical experiment is given which illustrates the theoretical result.展开更多
Let T(q,D) be a self-similar(fractal) set generated by {fi(x) = 1 q(x + di)}iN=1 where integer q > 1 and D = {d1,d2,...,dN } R.To show the Lipschitz equivalence of T(q,D) and a dust-like T(q,C),one general restrict...Let T(q,D) be a self-similar(fractal) set generated by {fi(x) = 1 q(x + di)}iN=1 where integer q > 1 and D = {d1,d2,...,dN } R.To show the Lipschitz equivalence of T(q,D) and a dust-like T(q,C),one general restriction is D Q by Peres et al.[Israel J Math,2000,117:353-379].In this paper,we obtain several sufficient criterions for the Lipschitz equivalence of two self-similar sets by using dust-like graph-directed iterating function systems and combinatorial techniques.Several examples are given to illustrate our theory.展开更多
文摘We introduce and study in the present paper the general version of Gauss-type proximal point algorithm (in short GG-PPA) for solving the inclusion , where T is a set-valued mapping which is not necessarily monotone acting from a Banach space X to a subset of a Banach space Y with locally closed graph. The convergence of the GG-PPA is present here by choosing a sequence of functions with , which is Lipschitz continuous in a neighbourhood O of the origin and when T is metrically regular. More precisely, semi-local and local convergence of GG-PPA are analyzed. Moreover, we present a numerical example to validate the convergence result of GG-PPA.
文摘Consider X and Y are two real or complex Banach spaces. We introduce and study a modified Gauss-type proximal point algorithm (in short modified G-PPA) for solving the generalized equations of the form 0 ∈h(x) + H(x), where h : X → Y is a smooth function on Ω ⊆X and H : X ⇉2<sup>Y</sup> is a set valued mapping with closed graph. When H is metrically regular and under some sufficient conditions, we analyze both semi-local and local convergence of the modified G-PPA. Moreover, the convergence results of the modified G-PPA are justified by presenting a numerical example.
基金supported by CAS-President International Fellowship Initiative(PIFI)from the Academy of Mathematics and Systems Science,Chinese Academy of Sciences,Beijing,China.
文摘In the present paper,we study the restricted inexact Newton-type method for solving the generalized equation 0∈f(x)+F(x),where X and Y are Banach spaces,f:X→Y is a Frechet differentiable function and F:X■Y is a set-valued mapping with closed graph.We establish the convergence criteria of the restricted inexact Newton-type method,which guarantees the existence of any sequence generated by this method and show this generated sequence is convergent linearly and quadratically according to the particular assumptions on the Frechet derivative of f.Indeed,we obtain semilocal and local convergence results of restricted inexact Newton-type method for solving the above generalized equation when the Frechet derivative of f is continuous and Lipschitz continuous as well as f+F is metrically regular.An application of this method to variational inequality is given.In addition,a numerical experiment is given which illustrates the theoretical result.
基金supported by National Natural Science Foundation of China (Grant No.10871180)
文摘Let T(q,D) be a self-similar(fractal) set generated by {fi(x) = 1 q(x + di)}iN=1 where integer q > 1 and D = {d1,d2,...,dN } R.To show the Lipschitz equivalence of T(q,D) and a dust-like T(q,C),one general restriction is D Q by Peres et al.[Israel J Math,2000,117:353-379].In this paper,we obtain several sufficient criterions for the Lipschitz equivalence of two self-similar sets by using dust-like graph-directed iterating function systems and combinatorial techniques.Several examples are given to illustrate our theory.
