A forward-backward splitting algorithm for the minimization of non-smooth convex functionals in Banach space

Mathematics – Numerical Analysis

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

10.1088/0266-5611/25/1/015005

We consider the task of computing an approximate minimizer of the sum of a smooth and non-smooth convex functional, respectively, in Banach space. Motivated by the classical forward-backward splitting method for the subgradients in Hilbert space, we propose a generalization which involves the iterative solution of simpler subproblems. Descent and convergence properties of this new algorithm are studied. Furthermore, the results are applied to the minimization of Tikhonov-functionals associated with linear inverse problems and semi-norm penalization in Banach spaces. With the help of Bregman-Taylor-distance estimates, rates of convergence for the forward-backward splitting procedure are obtained. Examples which demonstrate the applicability are given, in particular, a generalization of the iterative soft-thresholding method by Daubechies, Defrise and De Mol to Banach spaces as well as total-variation based image restoration in higher dimensions are presented.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

A forward-backward splitting algorithm for the minimization of non-smooth convex functionals in Banach space does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A forward-backward splitting algorithm for the minimization of non-smooth convex functionals in Banach space, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A forward-backward splitting algorithm for the minimization of non-smooth convex functionals in Banach space will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-598162

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.