Related papers: Fast Least-Squares Pad\'e approximation of problem…
This paper considers the problem of minimizing the ordered weighted average (or ordered median) function of finitely many rational functions over compact semi-algebraic sets. Ordered weighted averages of rational functions are not, in…
The paper studies a geometrically robust least-squares problem that extends classical and norm-based robust formulations. Rather than minimizing residual error for fixed or perturbed data, we interpret least-squares as enforcing approximate…
This survey hinges on the interplay between regularity and approximation for linear and quasi-linear fractional elliptic problems on Lipschitz domains. For the linear Dirichlet integral Laplacian, after briefly recalling H\"older regularity…
The problem of the minimization of least squares functionals with $\ell^1$ penalties is considered in an infinite dimensional Hilbert space setting. While there are several algorithms available in the finite dimensional setting there are…
We consider adaptive approximations of the parameter-to-solution map for elliptic operator equations depending on a large or infinite number of parameters, comparing approximation strategies of different degrees of nonlinearity: sparse…
We consider the minimization or maximization of the $J$th largest eigenvalue of an analytic and Hermitian matrix-valued function, and build on Mengi et al. (2014, SIAM J. Matrix Anal. Appl., 35, 699-724). This work addresses the setting…
The main purpose of the paper is to present some powerful data on the advantage of the rational approximation procedure based on Hermite-Pad\'e polynomials over the Pad\'e approximation procedure. The first part of the paper is devoted to…
In this paper we present a variant of the proximal forward-backward splitting iteration for solving nonsmooth optimization problems in Hilbert spaces, when the objective function is the sum of two nondifferentiable convex functions. The…
Given a sequence of Marcinkiewicz-Zygmund inequalities in $L_2$ on a compact space, Gr\"ochenig in \cite{G} discussed weighted least squares approximation and least squares quadrature. Inspired by this work, for all $1\le p\le\infty$, we…
The method of the fundamental solutions (MFS) is used to construct an approximate solution for a partial differential equation in a bounded domain. It is demonstrated by combining the fundamental solutions shifted to the points outside the…
We develop a globalized Proximal Newton method for composite and possibly non-convex minimization problems in Hilbert spaces. Additionally, we impose less restrictive assumptions on the composite objective functional considering…
Developing efficient methods for solving parametric partial differential equations is crucial for addressing inverse problems. This work introduces a Least-Squares-based Neural Network (LS-Net) method for solving linear parametric PDEs. It…
Given a sequence of Marcinkiewicz-Zygmund inequalities in $L_2$ on a usual compact space $\mathcal M$, Gr\"ochenig introduced the weighted least squares polynomials and the least squares quadrature from pointwise samples of a function, and…
The Closest Point Method for solving partial differential equations (PDEs) posed on surfaces was recently introduced by Ruuth and Merriman [J. Comput. Phys. 2008] and successfully applied to a variety of surface PDEs. In this paper we study…
Functions on a bounded domain in scientific computing are often approximated using piecewise polynomial approximations on meshes that adapt to the shape of the geometry. We study the problem of function approximation using splines on a…
Global radial basis function (RBF) collocation methods with inifinitely smooth basis functions for partial differential equations (PDEs) work in general geometries, and can have exponential convergence properties for smooth solution…
In this paper we extend results taken from compressed sensing to recover Hilbert-space valued vectors. This is an important problem in parametric function approximation in particular when the number of parameters is high. By expanding our…
An efficient proximal-gradient-based method, called proximal extrapolated gradient method, is designed for solving monotone variational inequality in Hilbert space. The proposed method extends the acceptable range of parameters to obtain…
In this paper, we consider optimizing a smooth, convex, lower semicontinuous function in Riemannian space with constraints. To solve the problem, we first convert it to a dual problem and then propose a general primal-dual algorithm to…
The two-parametric Mittag-Leffler function (MLF), $E_{\alpha,\beta}$, is fundamental to the study and simulation of fractional differential and integral equations. However, these functions are computationally expensive and their numerical…