Related papers: Goal oriented adaptivity in the IRGNM for paramete…

We study weighted Tikhonov regularization for large-scale linear discrete ill-posed problems with random noise. Under a polynomial upper-bound assumption on the generalized eigenvalues of the discrete forward operator, we derive stochastic…

In this paper we the formulation of inverse problems as constrained minimization problems and their iterative solution by gradient or Newton type. We carry out a convergence analysis in the sense of regularization methods and discuss…

We consider an adaptive algorithm for finite element methods for the isogeometric analysis (IGAFEM) of elliptic (possibly non-symmetric) second-order partial differential equations in arbitrary space dimension $d\ge2$. We employ…

We study a Newton-like method for the minimization of an objective function that is the sum of a smooth convex function and an l-1 regularization term. This method, which is sometimes referred to in the literature as a proximal Newton…

We provide an abstract framework for optimal goal-oriented adaptivity for finite element methods and boundary element methods in the spirit of [Carstensen et al., Comput. Math. Appl. 67 (2014)]. We prove that this framework covers standard…

In a recent work, we analyzed a weighted-residual error estimator for isogeometric boundary element methods in 2D and proposed an adaptive algorithm which steers the local mesh-refinement of the underlying partition as well as the…

The incremental gradient method is a prominent algorithm for minimizing a finite sum of smooth convex functions, used in many contexts including large-scale data processing applications and distributed optimization over networks. It is a…

In this paper we develop an $hp$-adaptive procedure for the numerical solution of general, semilinear elliptic boundary value problems in 1d, with possible singular perturbations. Our approach combines both a prediction-type adaptive Newton…

A general adaptive refinement strategy for solving linear elliptic partial differential equation with random data is proposed and analysed herein. The adaptive strategy extends the a posteriori error estimation framework introduced by…

We derive and discuss a posteriori error estimators for Galerkin and collocation IGA boundary element methods for weakly-singular integral equations of the first-kind in 2D. While recent own work considered the Faermann residual error…

This study presents incremental correction methods for refining neural network parameters or control functions entering into a continuous-time dynamic system to achieve improved solution accuracy in satisfying the interim point constraints…

In this paper, we propose a first second-order scheme based on arbitrary non-Euclidean norms, incorporated by Bregman distances. They are introduced directly in the Newton iterate with regularization parameter proportional to the square…

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…

PDE-constrained optimal control problems require regularisation to ensure well-posedness, introducing small perturbations that make the solutions challenging to approximate accurately. We propose a finite element approach that couples both…

In this study we propose a-posteriori error estimation results to approximate the precision loss in quantities of interests computed using reduced order models. To generate the surrogate models we employ Proper Orthogonal Decomposition and…

We propose \textit{Meta-Regularization}, a novel approach for the adaptive choice of the learning rate in first-order gradient descent methods. Our approach modifies the objective function by adding a regularization term on the learning…

Primal-dual splitting involving proximity operators in order to be able to find some approximation to the minimizer for a general form of Tikhonov type functional is in the focus of this work. This approximation is produced by a pair of…

In this article we investigate a finite element formulation of strongly monotone quasi-linear elliptic PDEs in the context of fixed-point iterations. As opposed to Newton's method, which requires information from the previous iteration in…

We consider the iterative reconstruction of both the internal geometry and the values of an inhomogeneous acoustic refraction index through a piecewise constant approximation. In this context, we propose two enhancements intended to reduce…

In this paper we consider the iteratively regularized Gauss-Newton method, where regularization is achieved by Ivanov regularization, i.e., by imposing a priori constraints on the solution. We propose an a posteriori choice of the…