Abstract
We propose a convex relaxation technique for computing global solutions for the nonconvex multiplicative noise model. The method is based on functional lifting by introducing an additional dimension. We employ a primal–dual-based gradient-type algorithm in numerical implementations to overcome the nondifferentiability of the total variation term. Numerical results show that our algorithm is highly efficient. Furthermore, global solutions of the original model can be obtained with no dependence on the initial guess.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
