Mathematics > Dynamical Systems
[Submitted on 21 Sep 2022]
Title:Viscosity approximation method for a variational problem
View PDFAbstract:Let $Q$ be a nonempty closed and convex subset of a real Hilbert space $% \mathcal{H}$, $S:Q\rightarrow Q$ a nonexpansive mapping, $A:Q\rightarrow Q$ an inverse strongly monotone operator, and $f:Q\rightarrow Q$ a contraction mapping. We prove, under appropriate conditions on the real sequences $% \{\alpha_{n}\}$ and $\{\lambda_{n}\},$ that for any starting point $x_{1}$ in $Q,$ the sequence $\{x_{n}\}$ generated by the iterative process \begin{equation} x_{n+1}=\alpha_{n}f(x_{n})+(1-\alpha_{n})SP_{Q}(x_{n}-\lambda_{n}Ax_{n}) \label{Alg} \end{equation} converges strongly to a particular element of the set $F_{ix}(S)\cap S_{VI(A,Q)}$ which we suppose that it is nonempty, where $F_{ix}(S)$ is the set of fixed point of the mapping $% S$ and $S_{VI(A,Q)}$ is the set of $q\in Q$ such that $\langle Aq,x-q\rangle\geq0$ for every $x\in Q.$ Moreover, we study the strong convergence of a perturbed version of the algorithm generated by the above process. Finally, we apply the main result to construct an algorithm associated to a constrained convex optimization problem and we provide a numerical experiment to emphasize the effect of the parameter $\{\alpha_{n}\}$ on the convergence rate of this algorithm.
References & Citations
Bibliographic and Citation Tools
Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)
Code, Data and Media Associated with this Article
alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)
Demos
Recommenders and Search Tools
Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
arXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.