A proximal point algorithm revisited and extended

DOI10.1007/S10957-019-01536-5MaRDI QIDQ6284222arXivWikidataFDO

Authors Gheorghe Moroşanu, Adrian Petruşel

Publication date 11 March 2017

Published in arXiv

Full work available at URL https://doi.org/10.1007/S10957-019-01536-5

Mathematics Subject Classification ID

Monotone operators and generalizations (47H05) Iterative procedures involving nonlinear operators (47J25) Convex programming (90C25) Applications of mathematical programming (90C90)

arXiv classification

math.OC

Abstract: This Note is inspired by the recent paper by Djafary Rouhani and Moradi [J. Optim. Theory Appl. 172 (2017) 222-235], where a proximal point algorithm proposed by Boikanyo and Moroc{s}anu [Optim. Lett. 7 (2013) 415-420] is discussed. We start with a brief history of the subject and then propose and analyse the following more general algorithm for approximating the zeroes of a maximal monotone operator $A$ in real Hilbert space $H$ ${\displaystyle }$ x_{n+1}=(I+�eta_nA)^{-1}(u_n + alpha_n(x_n+e_n)), nge 0, , ${\displaystyle }$ where $x_{0}inH$ is a given starting point, $u_{n}ightarrowu$ is a given sequence in $H$, $Rialph{a}_{n}ightarrow0$, and $(e_n)$ is the error sequence satisfying $alph{a}_n{e}_{n}ightarrow0$. Besides the main result on the strong convergence of $(x_n)$, we discuss some particular cases, including the approximation of minimizers of convex functionals, explain how to use our algorithm in practice, and present some simulations to illustrate the applicability of our algorithm.

This page was built for publication: A proximal point algorithm revisited and extended

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6284222)