Strong convergence of a proximal point algorithm with bounded error sequence. Short Communication; Published: 01 November 2011. Volume 7, pages 415–420, ( ...
Our main result (Theorem 3.1) states the strong convergence of sequences generated by our more general algorithm, thus reobtaining Theorem 1 in [7] and Theorem ...
It is shown that the sequence of proximal iterates xn+1 = (I+ γnA)-1(λnu + (1-λn)(xn+en)) converges strongly to the metric projection of u on A-1
Strong convergence of a proximal point algorithm with bounded error sequence. Oganeditse A. Boikanyo · Gheorghe Morosanu. Received: 21 August 2011 / Accepted ...
We study also in a similar way the strong convergence of a new proximal point algorithm and present some applications of our results to optimization and ...
Oct 19, 2016 · Boikanyo, O.A., Morosanu, G.: Strong convergence of a proximal point algorithm with bounded error sequence. Optim. Lett. 7, 415–420 (2013).
Strong Convergence of Two Proximal Point Algorithms with Possible ...
www.semanticscholar.org › paper
A regularization method for the proximal point algorithm of finding a zero for a maximal monotone operator in a Hilbert space is proposed. Strong convergence of ...
The error bound condition yields a linear convergence rate that is an order of magnitude worse than the natural rate for the prox-gradient method in the convex ...
In this paper, we study strong convergence of the proximal point algorithm. It is known that the proximal point algorithm converges weakly to a solution of ...
When analyzing the prox-linear algorithm, we encounter a surprise. The error bound condition yields a linear converge rate that is an order of magnitude worse.