In this paper we consider the computation of approximate solutions for inverse problems in Hilbert spaces. In order to capture the special feature of solutions, non-smooth convex functions are introduced as penalty terms. By exploiting the Hilbert space structure of the underlying problems, we propose a fast iterative regularization method which reduces to the classical nonstationary iterated Tikhonov regularization when the penalty term is chosen to be the square of norm. Each iteration of the method consists of two steps: the first step involves only the operator from the problem while the second step involves only the penalty term. This splitting character has the advantage of making the computation efficient. In case the data is corrupted by noise, a stopping rule is proposed to terminate the method and the corresponding regularization property is established. Finally, we test the performance of the method by reporting various numerical simulations, including the image deblurring, the determination of source term in Poisson equation, and the de-autoconvolution problem.
In this paper we present iterative methods of high efficiency by the criteria of J. F. Traub and A. M. Ostrowski. We define {\it s-nonstationary iterative processes} and prove that, for any one-point iterative process without memory, such as, for example, Newton's, Halley's, Chebyshev's methods, there exists an s-nonstationary process of the same order, but of higher efficiency. We supply constructions of these methods, obtain their properties and, for some of them, also their geometric interpretation. The algorithms we present can be transformed into computer programs in straight-forward mann…
Study of boundary conditions in the Iterative Filtering method for the decomposition of nonstationary signals
Istituto Nazionale di Alta Matematica（意大利高等数学研究所）；DISIM, Università degli Studi dell’Aquila（阿奎拉大学DISIM学院）；Gran Sasso Science Institute（格兰萨索科学研究所）；Libera Università di Bolzano（博尔扎诺自由大学）
In this work, we present a new technique for the decomposition of multivariate data, which we call Multivariate Fast Iterative Filtering (MvFIF) algorithm. We study its properties, proving rigorously that it converges in finite time when applied to the decomposition of any kind of multivariate signal. We test MvFIF performance using a wide variety of artificial and real multivariate signals, showing its ability to: separate multivariate modulated oscillations; align frequencies along different channels; produce a quasi--dyadic filterbank when decomposing white Gaussian noise; decompose the sig…
Iterative filtering methods were introduced around 2010 to improve definitions and measurements of structural features in signal processing. Like many applied techniques, they present considerable challenges for mathematicians to theorize their effectiveness and limitations in commercial and scientific usages. In this paper we recast iterative filtering methods in a mathematical abstraction more conducive to their understanding and applications. We also introduce a new visualization of simultaneous local frequencies and amplitudes. By combining a theoretical and practical exposition, we hope t…
Adaptive Local Iterative Filtering (ALIF) is a currently proposed novel time-frequency analysis tool. It has been empirically shown that ALIF is able to separate components and overcome the mode-mixing problem. However, so far its convergence is still an open problem, particularly for highly nonstationary signals, due to the fact that the kernel associated with ALIF is non-translational invariant, non-convolutional and non-symmetric. Our first contribution in this work is providing a convergence analysis of ALIF. From the practical perspective, ALIF depends on a robust frequencies estimator, b…
Graph Iterative Filtering methods for the analysis of nonstationary signals on graphs
Dipartimento di Scienza e Alta Tecnologia, Università dell’Insubria（因苏布里亚大学科学与技术系）；Department of Engineering and Computer Science and Mathematics, Università degli Studi dell’Aquila（阿奎拉大学工程、计算机科学与数学系）；Istituto di Astrofisica e Planetologia Spaziali, INAF（INAF空间天体物理学与行星科学研究所）；Istituto Nazionale di Geofisica e Vulcanologia（国家地球物理与火山学研究所）
In this corrigendum, we offer a correction to [J. Korean. Math. Soc., 54 (2017), pp. 461--477]. We construct a counterexample for the strengthened Cauchy--Schwarz inequality used in the original paper. In addition, we provide a new proof for Lemma 5 of the original paper, an estimate for the extremal eigenvalues of the standard unpreconditioned FETI-DP dual operator.
A Finite-Volume based POD-Galerkin reduced order model is developed for fluid dynamics problems where the (time-dependent) boundary conditions are controlled using two different boundary control strategies: the lifting function method, whose aim is to obtain homogeneous basis functions for the reduced basis space and the penalty method where the boundary conditions are enforced in the reduced order model using a penalty factor. The penalty method is improved by using an iterative solver for the determination of the penalty factor rather than tuning the factor with a sensitivity analysis or num…
Convergence of penalty Robin-Robin domain decomposition methods for unilateral multibody contact problems of elasticity
Ivan Franko National University of Lviv（伊万·弗兰科大学）；Pidstryhach Institute for Applied Problems of Mechanics and Mathematics, National Academy of Sciences of Ukraine（乌克兰国家科学院皮德斯特雷哈赫应用力学与数学问题研究所）
A crucial issue in two-dimensional Nuclear Magnetic Resonance (NMR) is the speed and accuracy of the data inversion. This paper proposes a multi-penalty method with locally adapted regularization parameters for fast and accurate inversion of 2DNMR data. The method solves an unconstrained optimization problem whose objective contains a data-fitting term, a single $L1$ penalty parameter and a multiple parameter $L2$ penalty. We propose an adaptation of the Fast Iterative Shrinkage and Thresholding (FISTA) method to solve the multi-penalty minimization problem, and an automatic procedure to compu…
In this paper, we consider the asymptotical regularization with convex constraints for nonlinear ill-posed problems. The method allows to use non-smooth penalty terms, including the L1-like and the total variation-like penalty functionals, which are significant in reconstructing special features of solutions such as sparsity and piecewise constancy. Under certain conditions we give convergence properties of the methods. Moreover, we propose Runge-Kutta type methods to discrete the initial value problems to construct new type iterative regularization methods.
In this paper, we introduce a novel two-point gradient method for solving the ill-posed problems in Banach spaces and study its convergence analysis. The method is based on the well known iteratively regularized Landweber iteration method together with an extrapolation strategy. The general formulation of iteratively regularized Landweber iteration method in Banach spaces excludes the use of certain functions such as total variation like penalty functionals, $L^1$ functions etc. The novel scheme presented in this paper allows to use such non-smooth penalty terms that can be helpful in practica…
We are interested in fast and stable iterative regularization methods for image deblurring problems with space invariant blur. The associated coefficient matrix has a Block Toeplitz Toeplitz Blocks (BTTB) like structure plus a small rank correction depending on the boundary conditions imposed on the imaging model. In the literature, several strategies have been proposed in the attempt to define proper preconditioner for iterative regularization methods that involve such linear systems. Usually, the preconditioner is chosen to be a Block Circulant with Circulant Blocks (BCCB) matrix because it …
In this paper, we introduce a class of nonsmooth nonconvex least square optimization problem using convex analysis tools and we propose to use the iterative minimization-majorization (MM) algorithm on a convex set with initializer away from the origin to find an optimal point for the optimization problem. For this, first we use an approach to construct a class of convex majorizers which approximate the value of non-convex cost function on a convex set. The convergence of the iterative algorithm is guaranteed when the initial point $x^{(0)}$ is away from the origin and the iterative points $x^{…
University of Innsbruck（因斯布鲁克大学）；University of Idaho（爱达荷大学）
We propose aNETT (augmented NETwork Tikhonov) regularization as a novel data-driven reconstruction framework for solving inverse problems. An encoder-decoder type network defines a regularizer consisting of a penalty term that enforces regularity in the encoder domain, augmented by a penalty that penalizes the distance to the data manifold. We present a rigorous convergence analysis including stability estimates and convergence rates. For that purpose, we prove the coercivity of the regularizer used without requiring explicit coercivity assumptions for the networks involved. We propose a possi…
