Related papers: A generalized strong convergence algorithm in the …
In this paper we analyze the approximation of stable linear time-invariant systems, like the Hilbert transform, by sampling series for bandlimited functions in the Paley-Wiener space $\mathcal{PW}_{\pi}^{1}$. It is known that there exist…
In this paper, using generalized metric projection, we propose a new extragradient method for finding a common element of the solutions set of a generalized equilibrium problem and a variational inequality for an $\alpha$-inverse-strongly…
This paper deals with a modified iterative projection method for approximating a solution of the hierarchical fixed point problem for a sequene of nearly nonexpansive mappings with respect to a nonexpansive mapping. It is shown that under…
Convergence analysis of consensus algorithms is revisited in the light of the Hilbert distance. Tsitsiklis Lyapunov function is shown to be the Hilbert distance to consensus in log coordinates. Birkhoff theorem, which proves contraction of…
We propose a forward-backward splitting dynamical system for solving inclusion problems of the form $0\in A(x)+B(x)$ in Hilbert spaces, where $A$ is a maximal operator and $B$ is a single-valued operator. Involved operators are assumed to…
In this article we present a modified S-iteration process that we combine with inertial extrapolation to find a common solution to the split monotone inclusion problem and the fixed point problem in real Hilbert space.Our goal is to…
We analyze convergence of the Levenberg-Marquardt method for solving nonlinear inverse problems in Hilbert spaces. Specifically, we establish local convergence and convergence rates for a class of inverse problems that satisfy H\"{o}lder…
In the algorithm selection research, the discussion surrounding algorithm features has been significantly overshadowed by the emphasis on problem features. Although a few empirical studies have yielded evidence regarding the effectiveness…
In this article, we discuss the optimal allocation problem in an experiment when a regression model is used for statistical analysis. Monotonic convergence for a general class of multiplicative algorithms for $D$-optimality has been…
In his recent research M. K. Tam (2018) considered a framework for the analysis of iterative algorithms which can be described in terms of a structured set-valued operator. At each point in the ambient space, the value of the operator can…
We provide lower error bounds for randomized algorithms that approximate integrals of functions depending on an unrestricted or even infinite number of variables. More precisely, we consider the infinite-dimensional integration problem on…
Deep learning algorithms have been applied very successfully in recent years to a range of problems out of reach for classical solution paradigms. Nevertheless, there is no completely rigorous mathematical error and convergence analysis…
In this work, we suggest a general viscosity implicit midpoint rule for nonexpansive mapping in the framework of Hilbert space. Further, under the certain conditions imposed on the sequence of parameters, strong convergence theorem is…
This paper introduces mixed-integer optimization methods to solve regression problems that incorporate fairness metrics. We propose an exact formulation for training fair regression models. To tackle this computationally hard problem, we…
We introduce a general mathematical framework for distributed algorithms, and a monotonicity property frequently satisfied in application. These properties are leveraged to provide finite-time guarantees for converging algorithms, suited…
The main goal of this paper is to present the application of a superiorization methodology to solution of variational inequalities. Within this framework a variational inequality operator is considered as a small perturbation of a convex…
We consider linear problems in the worst case setting. That is, given a linear operator and a pool of admissible linear measurements, we want to approximate the values of the operator uniformly on a convex and balanced set by means of…
In this paper, first we introduce a new mapping for finding a common fixed point of an infinite family of nonexpansive mappings then we consider iterative method for finding a common element of the set of fixed points of an infinite family…
This article presents a strongly polynomial-time algorithm for the general linear programming problem. This algorithm is an implicit reduction procedure that works as follows. Primal and dual problems are combined into a special system of…
By the recent advances in computer technology leading to the invention of more powerful processors, the importance of creating models using data training is even greater than ever. Given the significance of this issue, this work tries to…