Linear convergence analysis of the use of gradient projection methods on total variation problems

Linear convergence analysis of the use of gradient projection methods on total variation problems

0.00 Avg rating0 Votes
Article ID: iaor20131188
Volume: 54
Issue: 2
Start Page Number: 283
End Page Number: 315
Publication Date: Mar 2013
Journal: Computational Optimization and Applications
Authors: ,
Keywords: duality, gradient projection, image processing, gradient search
Abstract:

Optimization problems using total variation frequently appear in image analysis models, in which the sharp edges of images are preserved. Direct gradient descent methods usually yield very slow convergence when used for such optimization problems. Recently, many duality‐based gradient projection methods have been proposed to accelerate the speed of convergence. In this dual formulation, the cost function of the optimization problem is singular, and the constraint set is not a polyhedral set. In this paper, we establish two inequalities related to projected gradients and show that, under some non‐degeneracy conditions, the rate of convergence is linear.

Reviews

Required fields are marked *. Your email address will not be published.