Convergence of the alternating split Bregman algorithm in infinite-dimensional Hilbert spaces

Mathematics – Functional Analysis

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

We prove results on weak convergence for the alternating split Bregman algorithm in infinite dimensional Hilbert spaces. We also show convergence of an approximate split Bregman algorithm, where errors are allowed at each step of the computation. To be able to treat the infinite dimensional case, our proofs focus mostly on the dual problem. We rely on Svaiter's theorem on weak convergence of the Douglas-Rachford splitting algorithm and on the relation between the alternating split Bregman and Douglas-Rachford splitting algorithms discovered by Setzer. Our motivation for this study is to provide a convergent algorithm for weighted least gradient problems arising in the hybrid method of imaging electric conductivity from interior knowledge (obtainable by MRI) of the magnitude of one current.

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

Convergence of the alternating split Bregman algorithm in infinite-dimensional Hilbert spaces 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 Convergence of the alternating split Bregman algorithm in infinite-dimensional Hilbert spaces, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Convergence of the alternating split Bregman algorithm in infinite-dimensional Hilbert spaces will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-43016

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