Related papers: Error estimates for total-variation regularized mi…
In this paper we investigate the problem of recovering the source term in an elliptic system from a measurement of the state on a part of the boundary. For the particular interest in reconstructing probably discontinuous sources, we use the…
We consider a unique continuation problem where the Dirichlet trace of the solution is known to have finite dimension. We prove Lipschitz stability of the unique continuation problem and design a finite element method that exploits the…
We analyze a bilinear optimal control problem for the Stokes--Brinkman equations: the control variable enters the state equations as a coefficient. In two- and three-dimensional Lipschitz domains, we perform a complete continuous analysis…
We consider a stochastic version of the proximal point algorithm for optimization problems posed on a Hilbert space. A typical application of this is supervised learning. While the method is not new, it has not been extensively analyzed in…
This paper studies a natural generalization of the problem of minimizing a univariate convex function $f$ by querying its values sequentially. At each time-step $t$, the optimizer can invest a budget $b_t$ in a query point $X_t$ of their…
In this paper, we propose a coupled tensor norm regularization that could enable the model output feature and the data input to lie in a low-dimensional manifold, which helps us to reduce overfitting. We show this regularization term is…
Two extensions of generalized linear models are considered. In the first one, response variables depend on multiple linear combinations of covariates. In the second one, only response variables are observed while the linear covariates are…
We give a randomized online algorithm that guarantees near-optimal $\widetilde O(\sqrt T)$ expected swap regret against any sequence of $T$ adaptively chosen Lipschitz convex losses on the unit interval. This improves the previous best…
We consider a boundary value problem involving a Riemann-Liouville fractional derivative of order $\alpha\in (3/2,2)$ on the unit interval $(0,1)$. The standard Galerkin finite element approximation converges slowly due to the presence of…
We present a general framework for the rigorous numerical analysis of time-fractional nonlinear parabolic partial differential equations, with a fractional derivative of order $\alpha\in(0,1)$ in time. The framework relies on three…
Error estimates for the numerical solution of the master equation are presented. Estimates are based on adjoint methods. We find that a good estimate can often be computed without spending computational effort on a dual problem. Estimates…
We propose a method to remedy finite sample coverage problems and improve upon the efficiency of commonly employed procedures for the construction of nonparametric confidence intervals in regression kink designs. The proposed interval is…
In an error estimation of finite element solutions to the Poisson equation, we usually impose the shape regularity assumption on the meshes to be used. In this paper, we show that even if the shape regularity condition is violated, the…
This article is a review on basic concepts and tools devoted to a posteriori error estimation for problems solved with the Finite Element Method. For the sake of simplicity and clarity, we mostly focus on linear elliptic diffusion problems,…
In this paper, we investigate abstract time-fractional evolution equations with nonlinear perturbations. We construct solutions of Lipschitz perturbation problems in arbitrary large time interval independent of the Lipschitz constants. We…
We study a family of optimal control problems in which one aims at minimizing a cost that mixes a quadratic control penalization and the variance of the system, both for finitely many agents and for the mean-field dynamics as their number…
Motivated, in particular, by the entropy-regularized optimal transport problem, we consider convex optimization problems with linear equality constraints, where the dual objective has Lipschitz $p$-th order derivatives, and develop two…
The cubic regularization (CR) algorithm has attracted a lot of attentions in the literature in recent years. We propose a new reformulation of the cubic regularization subproblem. The reformulation is an unconstrained convex problem that…
This paper introduces a new computational methodology for determining a-posteriori multi-objective error estimates for finite-element approximations, and for constructing corresponding (quasi-)optimal adaptive refinements of finite-element…
The aim of this work is to analyze the finite element approximation of the two-dimensional stationary Navier-Stokes equations with non-smooth Dirichlet boundary data. The discrete approximation is obtained by considering the Navier-Stokes…