On The Strong Convergence of The Gradient Projection Algorithm with Tikhonov regularizing term
Abstract
We investigate the strong and the weak convergence properties of the following gradient projection algorithm with Tikhonov regularizing term \[ xn+1=PQ(xn-γn∇ f(xn)-γnαn∇ φ (xn)), \] where PQ is the projection operator from a Hilbert space H onto a given nonempty, closed and convex subset Q, f:H% → R a regular convex function, φ :H% → R a regular strongly convex function, and γn and αn are positive real numbers. Following a Lyuapunov approach inspired essentially from the paper [Comminetti R, Peypouquet J Sorin S. Strong asymptotic convergence of evolution equations governed by maximal monotone operators with Tikhonov regularization. J. Differential Equations. (2001); 245:3753-3763], we establish the strong convergence of (xn)n to a particular minimizer x of f on Q under some simple and natural conditions on the objective function f\ and the sequences (γn)n and (αn)n
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.