Abstract
This paper is concerned with a modified version of the standard proximal point algorithm based upon an implicit discretization of the dissipative dynamical system u″(t)+γu′(t)+Au(t)=0(t>0), with initial data u(0), u′(0) in a real Hilbert space H, where A: H→H is a co-coercive operator. This iteration method is written as: , where and u 0, u 1 are in H. Under suitable assumptions on λ and θ, we prove that this scheme generates a sequence which asymptotically converges to an element in H satisfying . Two typical examples, one with constraints and the other without, are studied with full details. The resolvent is calculated and numerical simulations are presented comparing the behavior of the standard proximal algorithm, the gradient method and our algorithm.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
