Related papers: Optimal hybrid parameter selection for stable sequ…
The Alternating Direction Method of Multipliers (ADMM) has gained significant attention across a broad spectrum of machine learning applications. Incorporating the over-relaxation technique shows potential for enhancing the convergence rate…
We present a new explicit and stable numerical algorithm to solve the homogeneous heat equation. We illustrate the performance of the new method in the cases of two 2D systems with highly inhomogeneous random parameters. Spatial…
Several generalizations of the traditional Tikhonov-Phillips regularization method have been proposed during the last two decades. Many of these generalizations are based upon inducing stability throughout the use of different penalizers…
In this paper, we consider the problem of estimating parameters of a linear regression model. Using a hybrid systems framework, a hybrid algorithm is proposed allowing the estimate to converge to the exact value of the unknown parameters in…
Regularized kernel methods such as support vector machines (SVM) and support vector regression (SVR) constitute a broad and flexible class of methods which are theoretically well investigated and commonly used in nonparametric…
We consider a convex optimization problem with many linear inequality constraints. To deal with a large number of constraints, we provide a penalty reformulation of the problem, where the penalty is a variant of the one-sided Huber loss…
The Receding Horizon Control (RHC) strategy consists in replacing an infinite-horizon stabilization problem by a sequence of finite-horizon optimal control problems, which are numerically more tractable. The dynamic programming principle…
Image reconstruction in X-ray tomography is an ill-posed inverse problem, particularly with limited available data. Regularization is thus essential, but its effectiveness hinges on the choice of a regularization parameter that balances…
The iterated Arnoldi-Tikhonov (iAT) method is a regularization technique particularly suited for solving large-scale ill-posed linear inverse problems. Indeed, it reduces the computational complexity through the projection of the…
In this paper, we are motivated by two important applications: entropy-regularized optimal transport problem and road or IP traffic demand matrix estimation by entropy model. Both of them include solving a special type of optimization…
Over the past decade, stochastic algorithms have emerged as scalable and efficient tools for solving large-scale ill-posed inverse problems by randomly selecting subsets of equations at each iteration. However, due to the ill-posedness and…
The Iterative Rational Krylov Algorithm (IRKA) of [8] is an interpolatory model reduction approach to the optimal $\mathcal{H}_2$ approximation problem. Even though the method has been illustrated to show rapid convergence in various…
Hard thresholding pursuit (HTP) is a recently proposed iterative sparse recovery algorithm which is a result of combination of a support selection step from iterated hard thresholding (IHT) and an estimation step from the orthogonal…
The Tikhonov-Phillips method is widely used for regularizing ill-posed inverse problems mainly due to the simplicity of its formulation as an optimization problem. The use of different penalizers in the functionals associated to the…
Traditional maximum entropy and sparsity-based algorithms for analytic continuation often suffer from the ill-posed kernel matrix or demand tremendous computation time for parameter tuning. Here we propose a neural network method by convex…
The joint bidiagonalization process of a matrix pair $\{A,L\}$ can be used to develop iterative regularization algorithms for large scale ill-posed problems in general-form Tikhonov regularization…
This paper addresses the properties of Continuous Interior Penalty (CIP) finite element solutions for the Helmholtz equation. The $h$-version of the CIP finite element method with piecewise linear approximation is applied to a…
In this paper we discuss a deterministic form of ensemble Kalman inversion as a regularization method for linear inverse problems. By interpreting ensemble Kalman inversion as a low-rank approximation of Tikhonov regularization, we are able…
Tikhonov regularization is a widely used technique in solving inverse problems that can enforce prior properties on the desired solution. In this paper, we propose a Krylov subspace based iterative method for solving linear inverse problems…
In this paper we propose and study a novel optimal transport based regularization of linear dynamic inverse problems. The considered inverse problems aim at recovering a measure valued curve and are dynamic in the sense that (i) the…