The linearized Bregman method is a method to calculate sparse solutions to systems of linear equations. We formulate this problem as a splitfeasibility problem, propose an algorithmic framework based on Bregman proje...
详细信息
The linearized Bregman method is a method to calculate sparse solutions to systems of linear equations. We formulate this problem as a splitfeasibility problem, propose an algorithmic framework based on Bregman projections, and prove a general convergence result for this framework. Convergence of the linearized Bregman method will be obtained as a special case. Our approach also allows for several generalizations such as other objective functions, incremental iterations, incorporation of non-Gaussian noise models, and box constraints.
Let Omega and C be nonempty, closed and convex sets in R (n) and R (m) respectively and A be an real matrix. The splitfeasibility problem is to find with Many problems arising in the image reconstruction can be formu...
详细信息
Let Omega and C be nonempty, closed and convex sets in R (n) and R (m) respectively and A be an real matrix. The splitfeasibility problem is to find with Many problems arising in the image reconstruction can be formulated in this form. In this paper, we propose a descent-projection method for solving the split feasibility problems. The method generates the new iterate by searching the optimal step size along the descent direction. Under certain conditions, the global convergence of the proposed method is proved. In order to demonstrate the efficiency of the proposed method, we provide some numerical results.
The focus of this paper is to introduce algorithms with alternated inertial step to solve split feasibility problems. We obtain global convergence of the sequences of iterates generated by the proposed methods under s...
详细信息
The focus of this paper is to introduce algorithms with alternated inertial step to solve split feasibility problems. We obtain global convergence of the sequences of iterates generated by the proposed methods under some appropriate conditions. When the splitfeasibility problem satisfies some bounded linear regularity property, we show that the generated sequences converge linearly. As far as we know, no linear convergence result has been obtained before now for algorithms with inertial steps to solve split feasibility problems in the literature. Our numerical experiments which include a real-world application to jointly constrained Nash equilibrium model show that our methods outperform some inertial methods and other related methods for split feasibility problems in the literature.
Strong convergence theorem of viscosity approximation methods for nonexpansive mapping have been studied. We also know that CQ algorithm for solving the splitfeasibility problem (SFP) has a weak convergence result. I...
详细信息
Strong convergence theorem of viscosity approximation methods for nonexpansive mapping have been studied. We also know that CQ algorithm for solving the splitfeasibility problem (SFP) has a weak convergence result. In this paper, we use viscosity approximation methods and some related knowledge to solve a class of generalized SFP's with monotone variational inequalities in Hilbert space. We propose some iterative algorithms based on viscosity approximation methods and get strong convergence theorems. As applications, we can use algorithms we proposed for solving split variational inequality problems (SVIP), split constrained convex minimization problems and some related problems in Hilbert space.
Let K and C be nonempty, closed and convex sets in R-n and R-m respectively and A be an m x n real matrix. The splitfeasibility problem is to find u is an element of K with Au is an element of C. Many problems arisin...
详细信息
Let K and C be nonempty, closed and convex sets in R-n and R-m respectively and A be an m x n real matrix. The splitfeasibility problem is to find u is an element of K with Au is an element of C. Many problems arising in the image reconstruction can be formulated in this form. In this paper, we use the auxiliary principle technique to suggest and analyze some new iterative algorithms for solving the split feasibility problems. Our new algorithms include the previously known ones as special cases. We also study the convergence criteria of these algorithms under some weaker conditions. In this respect, our results present a refinement and improvement of the previously known results.
In this paper, we consider a type of splitfeasibility problem by focusing on the solution sets of two important problems in the setting of Hilbert spaces that are the sum of monotone operators and fixed point problem...
详细信息
The main purpose of this paper is to introduce an iterative algorithm for equilibrium problems and split feasibility problems in Hilbert spaces. Under suitable conditions we prove that the sequence converges strongly ...
详细信息
The main purpose of this paper is to introduce an iterative algorithm for equilibrium problems and split feasibility problems in Hilbert spaces. Under suitable conditions we prove that the sequence converges strongly to a common element of the set of solutions of equilibrium problems and the set of solutions of split feasibility problems. Our result extends and improves the corresponding results of some others.
The convergence analysis of a variable KM-like method for approximating common fixed points of a possibly infinitely countable family of nonexpansive mappings in a Hilbert space is proposed and proved to be strongly c...
详细信息
The convergence analysis of a variable KM-like method for approximating common fixed points of a possibly infinitely countable family of nonexpansive mappings in a Hilbert space is proposed and proved to be strongly convergent to a common fixed point of a family of nonexpansive mappings. Our variable KM-like technique is applied to solve the splitfeasibility problem and the multiple-sets splitfeasibility problem. Especially, the minimum norm solutions of the splitfeasibility problem and the multiple-sets splitfeasibility problem are derived. Our results can be viewed as an improvement and refinement of the previously known results.
The purpose of this paper is to introduce and analyze an extragradient method with regularization for finding a common element of the solution set Gamma of the splitfeasibility problem and the set Fix(S) of fixed poi...
详细信息
The purpose of this paper is to introduce and analyze an extragradient method with regularization for finding a common element of the solution set Gamma of the splitfeasibility problem and the set Fix(S) of fixed points of a nonexpansive mapping S in the setting of infinite-dimensional Hilbert spaces. Combining the regularization method and the extragradient method due to Nadezhkina and Takahashi [N. Nadezhkina, W. Takahashi, Weak convergence theorem by an extragradient method for nonexpansive mappings and monotone mappings, J. Optim. Theory Appl. 128 (2006) 191-201], we propose an iterative algorithm for finding an element of Fix(S) boolean AND Gamma. We prove that the sequences generated by the proposed algorithm converge weakly to an element of Fix(S) boolean AND Gamma under mild conditions. (C) 2012 Elsevier Ltd. All rights reserved.
The purpose of this paper is to study and analyze three different kinds of Mann type iterative methods for finding a common element of the solution set I" of the splitfeasibility problem and the set Fix(S) of fi...
详细信息
The purpose of this paper is to study and analyze three different kinds of Mann type iterative methods for finding a common element of the solution set I" of the splitfeasibility problem and the set Fix(S) of fixed points of a nonexpansive mapping S in the setting of infinite-dimensional Hilbert spaces. By combining Mann's iterative method and the extragradient method, we first propose Mann type extragradient-like algorithm for finding an element of the set;moreover, we derive the weak convergence of the proposed algorithm under appropriate conditions. Second, we combine Mann's iterative method and the viscosity approximation method to introduce Mann type viscosity algorithm for finding an element of the;moreover, we derive the strong convergence of the sequences generated by the proposed algorithm to an element of set under mild conditions. Finally, by combining Mann's iterative method and the relaxed CQ method, we introduce Mann type relaxed CQ algorithm for finding an element of the set . We also establish a weak convergence result for the sequences generated by the proposed Mann type relaxed CQ algorithm under appropriate assumptions.
暂无评论