Journal
COMPUTATIONAL OPTIMIZATION AND APPLICATIONS
Volume 42, Issue 2, Pages 173-193Publisher
SPRINGER
DOI: 10.1007/s10589-007-9083-3
Keywords
Conditional gradient method; Sparsity constraints; Inverse problems; Non-convex optimization
Ask authors/readers for more resources
This article combines techniques from two fields of applied mathematics: optimization theory and inverse problems. We investigate a generalized conditional gradient method and its connection to an iterative shrinkage method, which has been recently proposed for solving inverse problems. The iterative shrinkage method aims at the solution of non-quadratic minimization problems where the solution is expected to have a sparse representation in a known basis. We show that it can be interpreted as a generalized conditional gradient method. We prove the convergence of this generalized method for general class of functionals, which includes non-convex functionals. This also gives a deeper understanding of the iterative shrinkage method.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available