proximal point algorithm; metric regularity; variational inequality
Abstract :
[en] In this paper we consider the following general version of the proximal point algorithm for solving the inclusion T(x) ∋ 0, where T is a set-valued mapping acting from a Banach space X to a Banach space Y. First, choose any sequence of functions gn : X → Y with gn(0) = 0 that are Lipschitz continuous in a neighborhood of the origin. Then pick an initial guess x0 and find a sequence xn by applying the iteration gn(xn1-xn)+T(xn+1) ∋ 0 for n = 0,1,... We prove that if the Lipschitz constants of gn are bounded by half the reciprocal of the modulus of regularity of T, then there exists a neighborhood O of x̅ (x̅ being a solution to T(x) ∋ 0) such that for each initial point x₀ ∈ O one can find a sequence xn generated by the algorithm which is linearly convergent to x̅. Moreover, if the functions gn have their Lipschitz constants convergent to zero, then there exists a sequence starting from x₀ ∈ O which is superlinearly convergent to x̅. Similar convergence results are obtained for the cases when the mapping T is strongly subregular and strongly regular.
Research center :
Luxembourg Centre for Systems Biomedicine (LCSB): Systems Biochemistry (Fleming Group)