Modern regularization methods for inverse problems

被引:266
作者
Benning, Martin [1 ]
Burger, Martin [2 ]
机构
[1] Ctr Math Sci, DAMTP, Wilberforce Rd, Cambridge CB3 0WA, England
[2] Univ Munster, Inst Computat & Appl Math, Einsteinstr 62, D-48149 Munster, Germany
基金
英国工程与自然科学研究理事会;
关键词
ILL-POSED PROBLEMS; POSTERIORI PARAMETER CHOICE; LINEAR OPERATOR-EQUATIONS; ITERATED TIKHONOV REGULARIZATION; VARIATIONAL IMAGE DECOMPRESSION; LOGARITHMIC CONVERGENCE-RATES; TOTAL VARIATION MINIMIZATION; TGV-BASED FRAMEWORK; GAUSS-NEWTON METHOD; EM-TV METHODS;
D O I
10.1017/S0962492918000016
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
Regularization methods are a key tool in the solution of inverse problems. They are used to introduce prior knowledge and allow a robust approximation of ill-posed (pseudo-) inverses. In the last two decades interest has shifted from linear to nonlinear regularization methods, even for linear inverse problems. The aim of this paper is to provide a reasonably comprehensive overview of this shift towards modern nonlinear regularization methods, including their analysis, applications and issues for future research. In particular we will discuss variational methods and techniques derived from them, since they have attracted much recent interest and link to other fields, such as image processing and compressed sensing. We further point to developments related to statistical inverse problems, multiscale decompositions and learning theory.
引用
收藏
页码:1 / 111
页数:111
相关论文
共 363 条
[51]   Consistency and rates of convergence of nonlinear Tikhonov regularization with random noise [J].
Bissantz, N ;
Hohage, T ;
Munk, A .
INVERSE PROBLEMS, 2004, 20 (06) :1773-1789
[52]  
Bleyer I., 2009, CUBO, V11, P99
[53]   Color TV: Total variation methods for restoration of vector-valued images [J].
Blomgren, P ;
Chan, TF .
IEEE TRANSACTIONS ON IMAGE PROCESSING, 1998, 7 (03) :304-309
[54]  
Bolte J., 2017, ARXIV170606461
[55]   THE LOJASIEWICZ INEQUALITY FOR NONSMOOTH SUBANALYTIC FUNCTIONS WITH APPLICATIONS TO SUBGRADIENT DYNAMICAL SYSTEMS [J].
Bolte, Jerome ;
Daniilidis, Aris ;
Lewis, Adrian .
SIAM JOURNAL ON OPTIMIZATION, 2007, 17 (04) :1205-1223
[56]   Proximal alternating linearized minimization for nonconvex and nonsmooth problems [J].
Bolte, Jerome ;
Sabach, Shoham ;
Teboulle, Marc .
MATHEMATICAL PROGRAMMING, 2014, 146 (1-2) :459-494
[57]   CHARACTERIZATIONS OF LOJASIEWICZ INEQUALITIES: SUBGRADIENT FLOWS, TALWEG, CONVEXITY [J].
Bolte, Jerome ;
Daniilidis, Aris ;
Ley, Olivier ;
Mazet, Laurent .
TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY, 2010, 362 (06) :3319-3363
[58]   On the convergence of a linesearch based proximal-gradient method for nonconvex optimization [J].
Bonettini, S. ;
Loris, I. ;
Porta, F. ;
Prato, M. ;
Rebegoldi, S. .
INVERSE PROBLEMS, 2017, 33 (05)
[59]   VARIABLE METRIC INEXACT LINE-SEARCH-BASED METHODS FOR NONSMOOTH OPTIMIZATION [J].
Bonettini, S. ;
Loris, I. ;
Porta, F. ;
Prato, M. .
SIAM JOURNAL ON OPTIMIZATION, 2016, 26 (02) :891-921
[60]   Proximal-gradient algorithms for fractional programming [J].
Bot, Radu Ioan ;
Csetnek, Ernoe Robert .
OPTIMIZATION, 2017, 66 (08) :1383-1396