scholarly journals Weak and linear convergence of a generalized proximal point algorithm with alternating inertial steps for a monotone inclusion problem

2021 ◽  
Vol 5 (6) ◽  
Keyword(s):  
Proximal Point Algorithm ◽  
Linear Convergence ◽  
Inclusion Problem ◽  
Monotone Inclusion ◽  
Proximal Point ◽  
Monotone Inclusion Problem ◽  
Generalized Proximal Point Algorithm

scholarly journals Inducing strong convergence of trajectories in dynamical systems associated to monotone inclusions with composite structure

2020 ◽  
Vol 10 (1) ◽  
pp. 450-476
Author(s):  
Radu Ioan Boţ ◽  
Sorin-Mihai Grad ◽  
Dennis Meier ◽  
Mathias Staudigl
Keyword(s):  
Dynamical Systems ◽  
Strong Convergence ◽  
Equilibrium Problems ◽  
Monotone Operators ◽  
Inclusion Problem ◽  
Minimum Norm ◽  
Monotone Inclusion ◽  
Inclusion Problems ◽  
Monotone Inclusion Problem ◽  
Maximally Monotone Operators

Abstract In this work we investigate dynamical systems designed to approach the solution sets of inclusion problems involving the sum of two maximally monotone operators. Our aim is to design methods which guarantee strong convergence of trajectories towards the minimum norm solution of the underlying monotone inclusion problem. To that end, we investigate in detail the asymptotic behavior of dynamical systems perturbed by a Tikhonov regularization where either the maximally monotone operators themselves, or the vector field of the dynamical system is regularized. In both cases we prove strong convergence of the trajectories towards minimum norm solutions to an underlying monotone inclusion problem, and we illustrate numerically qualitative differences between these two complementary regularization strategies. The so-constructed dynamical systems are either of Krasnoselskiĭ-Mann, of forward-backward type or of forward-backward-forward type, and with the help of injected regularization we demonstrate seminal results on the strong convergence of Hilbert space valued evolutions designed to solve monotone inclusion and equilibrium problems.

A viscosity-type algorithm for an infinitely countable family of (f,g)-generalized k-strictly pseudononspreading mappings in CAT(0) spaces

Analysis ◽  
2020 ◽  
Vol 40 (1) ◽  
pp. 19-37 ◽  
Author(s):  
Kazeem O. Aremu ◽  
Hammed Abass ◽  
Chinedu Izuchukwu ◽  
Oluwatosin T. Mewomo
Keyword(s):  
Integral Equation ◽  
Fixed Point Problem ◽  
Countable Family ◽  
Inclusion Problem ◽  
Point Problem ◽  
Monotone Inclusion ◽  
Nonlinear Volterra Integral Equation ◽  
Common Solution ◽  
Type Algorithm ◽  
Monotone Inclusion Problem

AbstractIn this paper, we propose a viscosity-type algorithm to approximate a common solution of a monotone inclusion problem, a minimization problem and a fixed point problem for an infinitely countable family of {(f,g)}-generalized k-strictly pseudononspreading mappings in a {\mathrm{CAT}(0)} space. We obtain a strong convergence of the proposed algorithm to the aforementioned problems in a complete {\mathrm{CAT}(0)} space. Furthermore, we give an application of our result to a nonlinear Volterra integral equation and a numerical example to support our main result. Our results complement and extend many recent results in literature.

scholarly journals Relatively Inexact Proximal Point Algorithm and Linear Convergence Analysis

2009 ◽  
Vol 2009 ◽  
pp. 1-11
Author(s):  
Ram U. Verma
Keyword(s):  
Convergence Analysis ◽  
Proximal Point Algorithm ◽  
Evolution Equations ◽  
Real Hilbert Space ◽  
Linear Convergence ◽  
Proximal Point ◽  
Evolution Inclusions ◽  
Inclusion Problems ◽  
Set Valued Mapping ◽  
Inexact Proximal

Based on a notion ofrelatively maximal(m)-relaxed monotonicity, the approximation solvability of a general class of inclusion problems is discussed, while generalizing Rockafellar's theorem (1976) on linear convergence using the proximal point algorithm in a real Hilbert space setting. Convergence analysis, based on this new model, is simpler and compact than that of the celebrated technique of Rockafellar in which the Lipschitz continuity at 0 of the inverse of the set-valued mapping is applied. Furthermore, it can be used to generalize the Yosida approximation, which, in turn, can be applied to first-order evolution equations as well as evolution inclusions.

scholarly journals An Approximate Proximal Point Algorithm for Maximal Monotone Inclusion Problems

2011 ◽  
Vol 2011 ◽  
pp. 1-15 ◽  
Author(s):  
Lingling Huang ◽  
Sanyang Liu ◽  
Weifeng Gao
Keyword(s):  
Hilbert Spaces ◽  
Proximal Point Algorithm ◽  
Maximal Monotone ◽  
Maximal Monotone Operators ◽  
Monotone Operators ◽  
Computational Results ◽  
Monotone Inclusion ◽  
Proximal Point ◽  
Inclusion Problems ◽  
Correction Step

This paper presents and analyzes a strongly convergent approximate proximal point algorithm for finding zeros of maximal monotone operators in Hilbert spaces. The proposed method combines the proximal subproblem with a more general correction step which takes advantage of more information on the existing iterations. As applications, convex programming problems and generalized variational inequalities are considered. Some preliminary computational results are reported.

scholarly journals Iterative approximation of split feasibility problem in real Hilbert spaces

2021 ◽  
Vol 7 (2) ◽  
pp. 30-47
Author(s):  
J. N. Ezeora ◽  
◽  
F. E. Bazuaye
Keyword(s):  
Hilbert Spaces ◽  
Split Feasibility Problem ◽  
Feasibility Problem ◽  
Inclusion Problem ◽  
Monotone Inclusion ◽  
Weak And Strong Convergence ◽  
Iterative Approximation ◽  
Asymptotically Nonexpansive ◽  
Split Feasibility ◽  
Monotone Inclusion Problem

In this paper, we propose an iterative algorithm for finding solution of split feasibility problem involving a λ−strictly pseudo-nonspreading map and asymptotically nonexpansive semigroups in two real Hilbert spaces. We prove weak and strong convergence theorems using the sequence obtained from the proposed algorithm. Finally, we applied our result to solve a monotone inclusion problem and present a numerical example to support our result.

scholarly journals Dynamical System Related to Primal–Dual Splitting Projection Methods

2021 ◽  
Author(s):  
E. M. Bednarczuk ◽  
R. N. Dhara ◽  
K. E. Rutkowski
Keyword(s):  
Dynamical System ◽  
Time Discretization ◽  
Monotone Operators ◽  
Projection Methods ◽  
Inclusion Problem ◽  
Monotone Inclusion ◽  
The Best Approximation ◽  
Primal Dual ◽  
Monotone Inclusion Problem ◽  
Maximally Monotone Operators

AbstractWe introduce a dynamical system to the problem of finding zeros of the sum of two maximally monotone operators. We investigate the existence, uniqueness and extendability of solutions to this dynamical system in a Hilbert space. We prove that the trajectories of the proposed dynamical system converge strongly to a primal–dual solution of the considered problem. Under explicit time discretization of the dynamical system we obtain the best approximation algorithm for solving coupled monotone inclusion problem.

Sign in / Sign up

Export Citation Format

Share Document