We study the strong convergence of a regularization proximal point algorithm for the problem of finding a common fixed point of a finite family of nonexpansive mappings in a uniformly convex and uniformly smooth Banach space E.
Related Content
An extragradient method for solving split feasibility and fixed point problems
The purpose of this paper is to introduce and analyze an extragradient method with regularization for finding a common element of the solution setof the split feasibility problem and the setof fixed points of a nonexpansive mappingin the setting of infinite-dimensional Hilbert spaces. Combining t...


Regularized Discrete Optimal Transport
This article introduces a generalization of the discrete optimal transport,with applications to color image manipulations. This new formulation includes arelaxation of the mass conservation constraint and a regularization term. Thesetwo features are crucial for image processing tasks, which neces...
An $ell _{1}$ minimization algorithm for non-smooth regularization in image processing
In this work, we consider a homotopic principle for solving large-scale $ell _{1}$ minimization problems arising in non-smooth regularization for image processing. Our approach consists in solving a sequence of relaxed unconstrained minimization problems depending on a positive regularization par...


Semi-supervised learning with nuclear norm regularization
(SSL-NNR), which can simultaneously handle both sparse labeled data and additional pairwise constraints together with unlabeled data. Specifically, we first construct a unified SSL framework to combine the manifold assumption and the pairwise constraints assumption for classification tasks. Then ...
Dual Norm Based Iterative Methods for Image Restoration
A convergent iterative regularization procedure based on the square of a dual norm is introduced for image restoration models with general (quadratic or non-quadratic) convex fidelity terms. Iterative regularization methods have been previously employed for image deblurring or denoising in the pr...

Descentwise inexact proximal algorithms for smooth optimization
The proximal method is a standard regularization approach in optimization. Practical implementations of this algorithm require (i) an algorithm to compute the proximal point, (ii) a rule to stop this algorithm, (iii) an update formula for the proximal parameter. In this work we focus on (ii), whe...
Space mapping methodology for defect recognition in eddy current testing – type NDT
The purpose of this paper is to solve an inverse problem of structure recognition arising in eddy current testing (ECT) – type NDT. For this purpose, the space mapping (SM) technique with an extraction based on the Gauss-Newton algorithm with Tikhonov regularization is applied. – The aim is t...

A proximal classifier with consistency
Note that for GEPSVM proposed in , the predicted class of a testing point is determined by comparing two distances between the testing point and two hyperplanes, while the optimization problems are based on comparing two distances between a hyperplane and two kinds of the training points. So ther...
A double smoothing technique for solving unconstrained nondifferentiable convex optimization problems
The aim of this paper is to develop an efficient algorithm for solving a class of unconstrained nondifferentiable convex optimization problems in finite dimensional spaces. To this end we formulate first its Fenchel dual problem and regularize it in two steps into a differentiable strongly convex...

Preconditioned iterative regularization in Banach spaces
Regularization methods for inverse problems formulated in Hilbert spaces usually give rise to over-smoothness, which does not allow to obtain a good contrast and localization of the edges in the context of image restoration.On the other hand, regularization methods recently introduced in Banach s...