We introduce iterative algorithms for finding a common element of the set of solutions of a system of equilibrium problems and of the set of fixed points of a finite family and a left amenable semigroup of nonexpansiv...
详细信息
We introduce iterative algorithms for finding a common element of the set of solutions of a system of equilibrium problems and of the set of fixed points of a finite family and a left amenable semigroup of nonexpansive mappings in a Hilbert space. We prove the strong convergence of the proposed iterative algorithm to the unique solution of a variational inequality, which is the optimality condition for a minimization problem. Our results extend, for example, the recent result of [V. Colao, G. Marino, H.K. Xu, An iterative Method for finding common solutions of equilibrium and fixed point problems, J. Math. Anal. Appl. 344 (2008) 340-352] to systems of equilibrium problems. (C) 2008 Elsevier Ltd. All rights reserved.
Two iterative algorithms for nonexpansive mappings on Hadamard manifolds, which are extensions of the well-known Halpern's and Mann's algorithms in Euclidean spaces, are proposed and proved to be convergent to...
详细信息
Two iterative algorithms for nonexpansive mappings on Hadamard manifolds, which are extensions of the well-known Halpern's and Mann's algorithms in Euclidean spaces, are proposed and proved to be convergent to a fixed point of the mapping. Some numerical examples are provided.
In this paper, we study the convergence of paths for continuous pseudocontractions in a real Banach space. As an application, we consider the problem of finding zeros of m-accretive operators based on an iterative alg...
详细信息
In this paper, we study the convergence of paths for continuous pseudocontractions in a real Banach space. As an application, we consider the problem of finding zeros of m-accretive operators based on an iterative algorithm with errors. Strong convergence theorems for zeros of m-accretive operators are established in a real Banach space.
The gradient-projection algorithm (GPA) plays an important role in solving constrained convex minimization problems. Based on the viscosity approximation method, we combine the GPA and averaged mapping approach to pro...
详细信息
The gradient-projection algorithm (GPA) plays an important role in solving constrained convex minimization problems. Based on the viscosity approximation method, we combine the GPA and averaged mapping approach to propose implicit and explicit composite iterative algorithms for finding a common solution of an equilibrium and a constrained convex minimization problem for the first time in this paper. Under suitable conditions, strong convergence theorems are obtained. MSC: 46N10, 47J20, 74G60.
We propose a class of iterative algorithms to solve some tensor equations via Einstein product. These algorithms use tensor computations with no matricizations involved. For any (special) initial tensor, a solution (t...
详细信息
We propose a class of iterative algorithms to solve some tensor equations via Einstein product. These algorithms use tensor computations with no matricizations involved. For any (special) initial tensor, a solution (the minimal Frobenius norm solution) of related problems can be obtained within finite iteration steps in the absence of roundoff errors. Numerical examples are provided to confirm the theoretical results, which demonstrate that this kind of iterative methods are effective and feasible for solving some tensor equations.
In this paper, we introduce new iterative algorithms for finding a common element of the set of solutions of a general system of nonlinear variational inequalities with perturbed mappings and the set of common fixed p...
详细信息
In this paper, we introduce new iterative algorithms for finding a common element of the set of solutions of a general system of nonlinear variational inequalities with perturbed mappings and the set of common fixed points of a one-parameter nonexpansive semigroup in Banach spaces. Furthermore, we prove the strong convergence theorems of the sequence generated by these iterative algorithms under some suitable conditions. The results obtained in this paper extend the recent ones announced by many others. Mathematics Subject Classification (2010): 47H09, 47J05, 47J25, 49J40, 65J15.
Direct complementary pivot algorithms for the linear complementarity problem withP-matrices are known to have exponential computational complexity. The analog of Gauss-Seidel and SOR iteration for linear complementari...
详细信息
Direct complementary pivot algorithms for the linear complementarity problem withP-matrices are known to have exponential computational complexity. The analog of Gauss-Seidel and SOR iteration for linear complementarity problems withP-matrices has not been extensively developed. This paper extends some work of van Bokhoven to a class of nonsymmetricP-matrices, and develops and compares several new iterative algorithms for the linear complementarity problem. Numerical results for several hundred test problems are presented. Such indirect iterative algorithms may prove useful for large sparse complementarity problems.
The lattice parameter,measured with sufficient accuracy,can be utilized to evaluate the quality of single crystals and to determine the equation of state for *** propose an iterative method for obtaining more precise ...
详细信息
The lattice parameter,measured with sufficient accuracy,can be utilized to evaluate the quality of single crystals and to determine the equation of state for *** propose an iterative method for obtaining more precise lattice parameters using the interaction points for the pseudo-Kossel pattern obtained from laser-induced X-ray diffraction(XRD).This method has been validated by the analysis of an XRD experiment conducted on iron single ***,the method was used to calculate the compression ratio and rotated angle of an LiF sample under high pressure *** technique provides a robust tool for in-situ characterization of structural changes in single crystals under extreme *** has significant implications for studying the equation of state and phase transitions.
In this paper, we suggest and analyze an iterative algorithm to approximate a common solution of a hierarchical fixed point problem for nonexpansive mappings, a system of variational inequalities, and a split equilibr...
详细信息
In this paper, we suggest and analyze an iterative algorithm to approximate a common solution of a hierarchical fixed point problem for nonexpansive mappings, a system of variational inequalities, and a split equilibrium problem in Hilbert spaces. Under some suitable conditions imposed on the sequences of parameters, we prove that the sequence generated by the proposed iterative method converges strongly to a common element of the solution set of these three kinds of problems. The results obtained here extend and improve the corresponding results of the relevant literature.
According to the hierarchical identification principle, a hierarchical gradient based iterative estimation algorithm is derived for multivariable output error moving average systems (i.e., multivariable OEMA-like mode...
详细信息
According to the hierarchical identification principle, a hierarchical gradient based iterative estimation algorithm is derived for multivariable output error moving average systems (i.e., multivariable OEMA-like models) which is different from multivariable CARMA-like models. As there exist unmeasurable noise-free outputs and unknown noise terms in the information vector/matrix of the corresponding identification model, this paper is, by means of the auxiliary model identification idea, to replace the unmeasurable variables in the information vector/matrix with the estimated residuals and the outputs of the auxiliary model. A numerical example is provided. (C) 2010 Elsevier Ltd. All rights reserved.
暂无评论