نتایج جستجو برای: modified halpern iteration
تعداد نتایج: 292563 فیلتر نتایج به سال:
Problem 1 (Convergence of Richardson iteration). This method’s operator has the form T = I − BA = I − ωA because B = ωI. The eigenvectors of T are – as is easy to verify, the same as those of A, and the eigenvalues of T are λi(T ) = 1− ωλi(A). To prove that the method converges, it is convenient to verify that the l2 norm of T is less than one because we can then express everything in terms of ...
(3) { zn = βnxn + (1− βn)Txn, xn+1 = αnxn + (1− αn)Tzn, n ≥ 0, where the initial guess x0 is taken arbitrarily and {αn}n=0 and {βn} are sequences in the interval [0, 1]. In general not much has been known regarding the convergence of the iteration processes (1)-(3) unless the underlying space X has nice properties which we briefly mention here. The iteration process (1) has been proved to be st...
This paper proposes an effective multi-objective differential evolution algorithm (MDES) to solve a permutation flow shop scheduling problem (PFSSP) with modified Dejong's learning effect. The proposed algorithm combines the basic differential evolution (DE) with local search and borrows the selection operator from NSGA-II to improve the general performance. First the problem is encoded with a...
Given a linear iteration of the form x := F (x), we consider modified versions of the form x := F (x + γd), where d is a fixed direction, and γ is chosen to minimize the norm of the residual ‖x + γd − F (x + γd)‖. We propose ways to choose d so that the convergence rate of the modified iteration is governed by the subdominant eigenvalue of the original. In the special case where F relates to a ...
In this paper, a modified Hermitian and skew-Hermitian splitting (MHSS) iteration method for solving the complex linear matrix equation AXB = C has been presented. As the theoretical analysis shows, the MHSS iteration method will converge under certain conditions. Each iteration in this method requires the solution of four linear matrix equations with real symmetric positive definite coefficien...
We define a family of epistemic extensions of Halpern–Shoham logic for reasoning about temporal-epistemic properties of multi-agent systems. We exemplify their use and study the complexity of their model checking problem. We show a range of results ranging from PTIME to PSPACE– hard depending on the logic considered.
The multiple traveling salesman problem (MTSP) involves scheduling m > 1 salesmen to visit a set of n > m nodes so that each node is visited exactly once. The objective is to minimize the total distance traveled by all the salesmen. The MTSP is an example of combinatorial optimization problems, and has a multiplicity of applications, mostly in the areas of routing and scheduling. In this paper,...
The purpose of this paper is to introduce the modified Halpern-type iterative method by the generalized f -projection operator for finding a common solution of fixed-point problem of a totally quasi-φ-asymptotically nonexpansivemapping and a system of equilibrium problems in a uniform smooth and strictly convex Banach space with the Kadec-Klee property. Consequently, we prove the strong converg...
We study the problem of embedding Halpern and Moses’s modal logic of minimal knowledge states into two families of modal formalism for nonmonotonic reasoning, McDermott and Doyle’s nonmonotonic modal logics and ground nonmonotonic modal logics. First, we prove that Halpern and Moses’s logic can be embedded into all ground logics; moreover, the translation employed allows for establishing a lowe...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید