Related papers: Approximation of Maximally Monotone Operators : A …
In this paper, some approximation properties of $(p,q)$-analogue of Bernstein-Stancu Operators has been studied. Rate of statistical convergence by means of modulus of continuity and Lipschitz type maximal functions has been investigated.…
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…
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…
The evolution of gene regulatory networks in variable environments poses Multi-objective Optimization Problem (MOP), where the expression levels of genes must be tuned to meet the demands of each environment. When formalized in the context…
The paper investigates two inertial extragradient algorithms for seeking a common solution to a variational inequality problem involving a monotone and Lipschitz continuous mapping and a fixed point problem with a demicontractive mapping in…
This paper proposes a two-point inertial proximal point algorithm to find zero of maximal monotone operators in Hilbert spaces. We obtain weak convergence results and non-asymptotic $O(1/n)$ convergence rate of our proposed algorithm in…
We propose a method for solving constrained fixed point problems involving compositions of Lipschitz pseudo contractive and firmly nonexpansive operators in Hilbert spaces. Each iteration of the method uses separate evaluations of these…
Neural operator (NO) architectures learn nonlinear maps between infinite-dimensional function spaces and are widely used to accelerate simulation and enable data-driven model discovery. While universality results ensure expressivity, they…
In this article we present the Durrmeyer variant of generalized Bernstein operators that preserve the constant functions involving non-negative parameter ?. We derive the approximation behaviour of these operators including global…
Singularly perturbed problems present inherent difficulty due to the presence of a thin boundary layer in its solution. To overcome this difficulty, we propose using deep operator networks (DeepONets), a method previously shown to be…
In infinite-dimensional Hilbert spaces we device a class of strongly convergent primal-dual schemes for solving variational inequalities defined by a Lipschitz continuous and pseudomonote map. Our novel numerical scheme is based on Tseng's…
Maximally monotone operators play important roles in optimization, variational analysis and differential equations. Finding zeros of maximally monotone operators has been a central topic. In a Hilbert space, we show that most resolvents are…
Denoiser models have become powerful tools for inverse problems, enabling the use of pretrained networks to approximate the score of a smoothed prior distribution. These models are often used in heuristic iterative schemes aimed at solving…
Let $E = L_p, \; 1<p\leq 2,$ and $A : E \to E^*$ be a bounded monotone map such that $0 \in R(A)$. In this paper, we introduce and study an algorithm for approximating zeros of $A$. Furthermore, we study the application of this algorithm to…
We define a range of new coarse geometric invariants based on various graph-theoretic measures of complexity for finite graphs, including: treewidth, pathwidth, cutwidth and bandwidth. We prove that, for bounded degree graphs, these…
In this paper, the problem of the order of approximation for the multivariate sampling Kantorovich operators is studied. The cases of the uniform approximation for uniformly continuous and bounded functions/signals belonging to Lipschitz…
The present paper deals with construction of newly family of Neural Network operators, that is, Steklov Neural Network operators. By using Steklov type integral, we introduce a new version of Neural Network operators and we obtain some…
Approximation properties of multivariate quasi-projection operators are studied in the paper. Wide classes of such operators are considered, including the sampling and the Kantorovich-Kotelnikov type operators generated by different…
Our objective in this paper is to present the sequence of Stancu type operators including generalized Brenke polynomials. We answer the problem of uniform approximation of continuous functions on closed bounded interval and the problem of…
Mirror-prox (MP) is a well-known algorithm to solve variational inequality (VI) problems. VI with a monotone operator covers a large group of settings such as convex minimization, min-max or saddle point problems. To get a convergent…