KLUEDO RSS FeedKLUEDO Dokumente/documentshttps://kluedo.ub.uni-kl.de/index/index/
Mon, 19 Sep 2011 02:26:37 +0200Mon, 19 Sep 2011 02:26:37 +0200On Cyclic Gradient Descent Reprojectionhttps://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/2742
In recent years, convex optimization methods were successfully applied for various image processing tasks and a large number of first-order methods were designed to minimize the corresponding functionals. Interestingly, it was shown recently by Grewenig et al. that the simple idea of so-called “superstep cycles” leads to very efficient schemes for time-dependent (parabolic) image enhancement problems as well as for steady state (elliptic) image compression tasks. The ”superstep cycles” approach is similar to the nonstationary (cyclic)
Richardson method which has been around for over sixty years.
In this paper, we investigate the incorporation of superstep cycles into the gradient descent reprojection method. We show for two problems in compressive sensing and image processing, namely the LASSO approach and the Rudin-Osher-Fatemi model that the resulting simple cyclic gradient descent reprojection algorithm can numerically compare with various state-of-the-art first-order algorithms. However, due to the nonlinear
projection within the algorithm convergence proofs even under restrictive assumptions on the linear operators appear to be hard. We demonstrate the difficulties by studying the
simplest case of a two-cycle algorithm in R^2 with projections onto the Euclidian ball.
Simon Setzer; Gabriele Steidl; Jan Morgenthalerpreprinthttps://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/2742Mon, 19 Sep 2011 02:26:37 +0200