Related papers: Better approximation of function by $\alpha-$Berns…
The main purpose of this paper is to determine the approximations of Durrmeyer modification of Szasz-Mirakjan operators, defined by Mishra et al. (Boll. Unione Mat. Ital. (2016) 8(4):297-305). We estimate the order of approximation of the…
This paper is aimed at studying sensitivity of parameters \alpha and \beta appearing in the operators introduced by D.D. Stancu [11] in 1969. Results are established on the behavior the nodes used in Bernstein-Stancu polynomials and the…
A trigonometrically approximated maximum likelihood estimation for $\alpha$-stable laws is proposed. The estimator solves the approximated likelihood equation, which is obtained by projecting a true score function on the space spanned by…
Here we research the univariate quantitative approximation of real and complex valued continuous functions on a compact interval or all the real line by quasi-interpolation, Baskakov type and quadrature type neural network operators. We…
This paper introduces a new definition of $\alpha$-monotone operators in real 2-uniformly convex and smooth Banach spaces. Based on this new definition, we establish several novel structural and analytical properties of such operators,…
In this paper, we develop a regularized higher-order Taylor based method for solving composite (e.g., nonlinear least-squares) problems. At each iteration, we replace each smooth component of the objective function by a higher-order Taylor…
We present and study a novel numerical algorithm to approximate the action of $T^\beta:=L^{-\beta}$ where $L$ is a symmetric and positive definite unbounded operator on a Hilbert space $H_0$. The numerical method is based on a…
Our main purpose of this article is to study the convergence and other related properties of q-Bernstein-Kantorovich operators including the shifted knots of real positive numbers. We design the shifted knots of Bernstein-Kantorovich…
The paper proposes and justifies a new algorithm of the proximal Newton type to solve a broad class of nonsmooth composite convex optimization problems without strong convexity assumptions. Based on advanced notions and techniques of…
Vecchia's approximate likelihood for Gaussian process parameters depends on how the observations are ordered, which can be viewed as a deficiency because the exact likelihood is permutation-invariant. This article takes the alternative…
The proximal point algorithm (PPA) has been well studied in the literature. In particular, its linear convergence rate has been studied by Rockafellar in 1976 under certain condition. We consider a generalized PPA in the generic setting of…
Low-rank approximation of a matrix function, $f(A)$, is an important task in computational mathematics. Most methods require direct access to $f(A)$, which is often considerably more expensive than accessing $A$. Persson and Kressner (SIMAX…
Piecewise $\alpha$-stable Ornstein-Uhlenbeck (OU) processes arising in queue networks usually do not have an explicit dissipation, which makes the related numerical methods such as Euler-Maruyama (EM) scheme more difficult to analyze. We…
The use of autonomous vehicles for target localization in modern applications has emphasized their superior efficiency, improved safety, and cost advantages over human-operated methods. For localization tasks, autonomous vehicles can be…
We propose a new adaptive algorithm for the approximation of the Landau-Lifshitz-Gilbert equation via a higher-order tangent plane scheme. We show that the adaptive approximation satisfies an energy inequality and demonstrate numerically,…
In this work, we investigate weighted $\alpha$$\beta$-Statistical approximation properties of $q$-Durrmeyer-Stancu operators. Also, give some corrections in limit of $q$-Durrmeyer-Stancu operators defined in \cite{mishra2013short} and…
We present an approximation notion for NP-hard optimization problems represented by binary functions. We prove that (assuming P != NP) the new notion is strictly stronger than FPTAS, but strictly weaker than having a polynomial-time…
A wide class of regularization problems in machine learning and statistics employ a regularization term which is obtained by composing a simple convex function \omega with a linear transformation. This setting includes Group Lasso methods,…
A selection of algorithms for the rational approximation of matrix-valued functions are discussed, including variants of the interpolatory AAA method, the RKFIT method based on approximate least squares fitting, vector fitting, and a method…
We study composite optimization problems in which the smooth part of the objective function is \( p \)-times continuously differentiable, where \( p \geq 1 \) is an integer. Higher-order methods are known to be effective for solving such…