Journal of Inverse and Ill-posed Problems
Editor-in-Chief: Kabanikhin, Sergey I.
6 Issues per year
Increased IMPACT FACTOR 2013: 0.593
Rank 143 out of 299 in category Mathematics in the 2013 Thomson Reuters Journal Citation Report/Science Edition
Mathematical Citation Quotient 2013: 0.51
Volume 22 (2014)
Volume 21 (2013)
Volume 20 (2012)
Volume 19 (2011)
Volume 18 (2011)
Volume 17 (2009)
Volume 16 (2008)
Volume 15 (2007)
Volume 14 (2006)
Volume 13 (2005)
Volume 12 (2004)
Volume 11 (2003)
Volume 10 (2002)
Volume 9 (2001)
Volume 8 (2000)
Volume 7 (1999)
Volume 6 (1998)
Volume 5 (1997)
Volume 4 (1996)
Volume 3 (1995)
Volume 2 (1994)
Most Downloaded Articles
- Chemnitz Symposium on Inverse ProblemsChemnitz, Germany, September 27–28, 2007 by Hofmann, B.
- Obituary of Alfredo Lorenzi
- A numerical study of heuristic parameter choice rules for total variation regularization by Kindermann, Stefan/ Mutimbu, Lawrence D. and Resmerita, Elena
- Limited-angle cone-beam computed tomography image reconstruction by total variation minimization and piecewise-constant modification by Zeng, Li/ Guo, Jiqiang and Liu, Baodong
- Carleman estimates for global uniqueness, stability and numerical methods for coefficient inverse problems by Klibanov, Michael V.
Shrinkage rules for variational minimization problems and applications to analytical ultracentrifugation
1Helmholtz Zentrum München, Institute of Biomathematics and Biometry, Ingolstädter Landstrasse 1, 85764 Neuherberg, Germany.
2Section on Medical Biophysics, Eunice Kennedy Shriver National Institute of Child Health and Human Development, National Institutes of Health, 9 Memorial Drive, Bethesda, MD 20892, USA.
Citation Information: Journal of Inverse and Ill-posed Problems. Volume 19, Issue 4-5, Pages 593–614, ISSN (Online) 1569-3945, ISSN (Print) 0928-0219, DOI: 10.1515/jiip.2011.057, November 2011
- Published Online:
Finding a sparse representation of a noisy signal can be modeled as a variational minimization with -sparsity constraints for q less than one. Especially for real-time, online, or iterative applications, in which problems of this type have to be solved multiple times, one needs fast algorithms to compute these minimizers. However, identifying the exact minimizers is computationally expensive. We consider minimization up to a constant factor to circumvent this limitation. We verify that q-dependent modifications of shrinkage rules provide closed formulas for such minimizers. Therefore, their computation is extremely fast. We also introduce a new shrinkage rule which is adapted to q. To support the theoretical results, the proposed method is applied to Landweber iteration with shrinkage used at each iteration step. This approach is utilized to solve the ill-posed problem of analytic ultracentrifugation, a method to determine the size distribution of macromolecules. For relatively pure solutes, our proposed scheme leads to sparser solutions with sharper peaks, higher resolution, and smaller residuals than standard regularization for this problem.