Convergence of projection and contraction algorithms with outer perturbations and their applications to sparse signals recovery

Abstract

In this paper we study the bounded perturbation resilience of projection and contraction algorithms for solving variational inequality (VI) problems in real Hilbert spaces. Under typical and standard assumptions of monotonicity and Lipschitz continuity of the VI's associated mapping, convergence of the perturbed projection and contraction algorithms is proved. Based on the bounded perturbed resilience of projection and contraction algorithms, we present some inertial projection and contraction algorithms. In addition we show that the perturbed algorithms converges at the rate of O(1/t).

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…