相关论文: Approximation by Complex Baskakov-Szasz-Durrmeyer …

This paper communicates recent results in theory of complex symmetric operators and shows, through two non-trivial examples, their potential usefulness in the study of Schr\"odinger operators. In particular, we propose a formula for…

Composite minimization involves a collection of functions which are aggregated in a nonsmooth manner. It covers, as a particular case, smooth approximation of minimax games, minimization of max-type functions, and simple composite…

In this paper we combine two existing approaches for approximating attractors. One of them approximates the attractors arbitrarily well by sublevel sets related to solutions of infinite dimensional linear programming problems. A downside…

The aim of this article is to introduce a bivariate extension of Shurer-Stancu operators based on (p q)integers. We prove uniform approximation by means of Bohman Korovkin type theorem rate of convergence using total modulus of smoothness…

We study the use of approximate Lagrange multipliers and discrete actions in solving convex optimisation problems. We observe that descent, which can be ensured using a wide range of approaches (gradient, subgradient, Newton, etc.), is…

We obtain approximation results for general positive linear operators satisfying mild conditions, when acting on discontinuous functions and absolutely continuous functions having discontinuous derivatives. The upper bounds, given in terms…

It is well known that under certain conditions on a Banach space $X$, the set of bounded linear operators attaining their numerical radius is a dense subset. We prove in this paper that if $X$ is assumed to be uniformly convex and uniformly…

In this article, we analyze the behaviour of the new family of Kantorovich type exponential sampling series. We obtain the point-wise approxi mation theorem and Voronovskaya type theorem for the series. Further, we obtain a representation…

This paper focuses on non-monotone stochastic variational inequalities (SVIs) that may not have a unique solution. A commonly used efficient algorithm to solve VIs is the Popov method, which is known to have the optimal convergence rate for…

In this paper, we introduce a modification of the Szasz-Mirakjan-Kantorovich operators as well as Stancu operators [9] (or a Dunkl generalization of modified Szasz-Mirakjan-Kantrovich operators [5]) which preserve the linear functions.…

Intrinsic volumes and Minkowski tensors have been used to describe the geometry of real world objects. This paper presents an estimator that allows to approximate these quantities from digital images. It is based on a generalized Steiner…

We study approximation of functions by algebraic polynomials in the H\"older spaces corresponding to the generalized Jacobi translation and the Ditzian-Totik moduli of smoothness. By using modifications of the classical moduli of…

In this paper we generalize to a certain class of Stein manifolds the Bernstein-Walsh-Siciak theorem which describes the equivalence between possible holomorphic continuation of a function $f$ defined on a compact set $K$ in $\mathbb{C}^N$…

In this paper, the behavior of the sampling Kantorovich operators has been studied, when discontinuous signals are considered in the above sampling series. Moreover, the rate of approximation for the family of the above operators is…

Our aim is to construct a finite automaton recognizing the set of words that are at a bounded distance from some word of a given regular language. We define new regular operators, the similarity operators, based on a generalization of the…

The approximation of complex-valued functions is of fundamental importance as it generalizes classical approximation theory to the complex domain, providing a rigorous framework for amplitude and phase-dependent phenomena. In this paper, we…

This article is devoted to one particular case of using universal accelerated proximal envelopes to obtain computationally efficient accelerated versions of methods used to solve various optimization problem setups. We propose a proximally…

We study high-dimensional nonlinear approximation of functions in H\"older-Nikol'skii spaces $H^\alpha_\infty(\mathbb{I}^d)$ on the unit cube $\mathbb{I}^d:=[0,1]^d$ having mixed smoothness, by parametric manifolds. The approximation error…

In this paper we show a new way of constructing deterministic polynomial-time approximation algorithms for computing complex-valued evaluations of a large class of graph polynomials on bounded degree graphs. In particular, our approach…

Composite minimization involves a collection of smooth functions which are aggregated in a nonsmooth manner. In the convex setting, we design an algorithm by linearizing each smooth component in accordance with its main curvature. The…