Related papers: Inverse Scale Space Iterations for Non-Convex Vari…
Numerous interesting properties in nonlinear systems analysis can be written as polynomial optimization problems with nonconvex sum-of-squares problems. To solve those problems efficiently, we propose a sequential approach of local…
Nonlinear dimensionality reduction embeddings computed from datasets do not provide a mechanism to compute the inverse map. In this paper, we address the problem of computing a stable inverse map to such a general bi-Lipschitz map. Our…
Regularisation is commonly used in iterative methods for solving imaging inverse problems. Many algorithms involve the evaluation of the proximal operator of the regularisation term in every iteration, leading to a significant computational…
We introduce an algorithm to solve linear inverse problems regularized with the total (gradient) variation in a gridless manner. Contrary to most existing methods, that produce an approximate solution which is piecewise constant on a fixed…
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…
An optical flow variational model is proposed for a sequence of images defined on a domain in $\mathbb{R}^2$. We introduce a regularization term given by the $L^1$ norm of a fractional differential operator. To solve the minimization…
The Augmented Lagrangian Method as an approach for regularizing inverse problems received much attention recently, e.g. under the name Bregman iteration in imaging. This work shows convergence (rates) for this method when Morozov's…
This paper presents an evaluation of the wave function coefficients for conformally coupled scalars at both one and two-loop levels at leading order in the coupling constant, in momentum space. We take cues from time-dependent interactions…
A new version of the convexification method is developed analytically and tested numerically for a 1-D coefficient inverse problem in the frequency domain. Unlike the previous version, this one does not use the so-called "tail function",…
Incorporating spatial information into hyperspectral unmixing procedures has been shown to have positive effects, due to the inherent spatial-spectral duality in hyperspectral scenes. Current research works that consider spatial information…
This paper introduces adaptive Bregman proximal gradient algorithms for solving convex composite minimization problems without relying on global relative smoothness or strong convexity assumptions. Building upon recent advances in adaptive…
The linear algorithm of the Wiener filter and constrained realizations (CRs) of Gaussian random fields is extended here to perform non-linear CRs. The procedure consists of: (1) Using low resolution data to constrain a high resolution…
We present a fundamentally new regularization method for the solution of the Fredholm integral equation of the first kind, in which we incorporate solutions corresponding to a range of Tikhonov regularizers into the end result. This method…
We consider the task of recovering two real or complex $m$-vectors from phaseless Fourier measurements of their circular convolution. Our method is a novel convex relaxation that is based on a lifted matrix recovery formulation that allows…
Regularization plays a key role in a variety of optimization formulations of inverse problems. A recurring theme in regularization approaches is the selection of regularization parameters, and their effect on the solution and on the optimal…
We modify the total-variation-regularized image segmentation model proposed by Chan, Esedoglu and Nikolova [SIAM Journal on Applied Mathematics 66, 2006] by introducing local regularization that takes into account spatial image information.…
We provide sufficient conditions on a family of functions $(\phi_\alpha)_{\alpha\in A}:\mathbb{R}^d\to\mathbb{R}$ for sampling of multivariate bandlimited functions at certain nonuniform sequences of points in $\mathbb{R}^d$. We consider…
The alternating direction method with multipliers (ADMM) has been one of most powerful and successful methods for solving various composite problems. The convergence of the conventional ADMM (i.e., 2-block) for convex objective functions…
In this paper we extend a recent idea of formulating and regularizing inverse problems as minimization problems, so without using a forward operator, thus avoiding explicit evaluation of a parameter-to-state map. We do so by rephrasing…
A new algorithm is proposed for solving the three-dimensional scalar inverse problem of acoustic sounding in an inhomogeneous medium. The data for the algorithm are the complex amplitudes of the wave field measured outside the inhomogeneity…