Relatively Inexact Proximal Point Algorithm and Linear Convergence Analysis
نویسندگان
چکیده
منابع مشابه
Relatively Inexact Proximal Point Algorithm and Linear Convergence Analysis
Based on a notion of relatively 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 newmodel, is simpler and compact than that of the celebrated technique of R...
متن کاملOn General Inexact Proximal Point Algorithms and Their Contributions to Linear Convergence Analysis
Based on the notion of relativemaximalmonotonicity, a hybrid proximal point algorithm is introduced and then it is applied to the approximation solvability of a general class of variational inclusion problems, while achieving a linear convergence. The obtained results generalize the celebrated work of Rockafellar (1976) where the Lipschitz continuity at 0 of the inverse of the set-valued mappin...
متن کاملInexact Halpern-type proximal point algorithm
We present several strong convergence results for the modified, Halpern-type, proximal point algorithm xn+1 = αnu + (1 − αn)Jβn xn + en (n = 0, 1, . . .; u, x0 ∈ H given, and Jβn = (I + βn A)−1, for a maximal monotone operator A) in a real Hilbert space, under new sets of conditions on αn ∈ (0, 1) and βn ∈ (0,∞). These conditions are weaker than those known to us and our results extend and impr...
متن کاملOn the Convergence of Inexact Proximal Point Algorithm on Hadamard Manifolds
In this paper we consider the proximal point algorithm to approximate a singularity of a multivalued monotone vector field on a Hadamard manifold. We study the convergence of the sequence generated by an inexact form of the algorithm. Our results extend the results of [3, 25] to Hadamard manifolds as well as the main result of [11] with more general assumptions on the control sequence. We also ...
متن کاملInexact Variants of the Proximal Point Algorithm without Monotonicity
This paper studies convergence properties of inexact variants of the proximal point algorithm when applied to a certain class of nonmonotone mappings. The presented algorithms allow for constant relative errors, in the line of the recently proposed hybrid proximal-extragradient algorithm. The main convergence result extends a recent work of the second author, where exact solutions for the proxi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Mathematics and Mathematical Sciences
سال: 2009
ISSN: 0161-1712,1687-0425
DOI: 10.1155/2009/691952