A Proximal Decomposition Method for Solving Convex Variational Inverse Problems

Details A Proximal Decomposition Method for Solving Convex Variational Inverse Problems A Proximal Decomposition Method for Solving Convex Variational Inverse Problems

2008-07-16

arxiv.org/abs/0807.2617v2

Mathematics

Optimization and Control

Scientific paper

10.1088/0266-5611/24/6/065014

A broad range of inverse problems can be abstracted into the problem of minimizing the sum of several convex functions in a Hilbert space. We propose a proximal decomposition algorithm for solving this problem with an arbitrary number of nonsmooth functions and establish its convergence. The algorithm fully decomposes the problem in that it involves each function individually via its own proximity operator. A significant improvement over the methods currently in use in the area of inverse problems is that it is not limited to two nonsmooth functions. Numerical applications to signal and image processing problems are demonstrated.

Affiliated with

Also associated with

No associations

Rating

A Proximal Decomposition Method for Solving Convex Variational Inverse Problems 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 Proximal Decomposition Method for Solving Convex Variational Inverse Problems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Proximal Decomposition Method for Solving Convex Variational Inverse Problems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-661045