Báo cáo hóa học: "Research Article Iterative Algorithm for Approximating Solutions of Maximal Monotone Operators in Hilbert Spaces" pot

... of proximal point iterations in a Hilbert space,” Mathematical Programming, vol. 87, no. 1, pp. 189–202, 2000. [7] S. Kamimura and W. Takahashi, Approximating solutions of maximal monotone operators ... the convex minimization problem of finding a minimizer of a proper lower-semicontinuous convex function and the variational problem of finding a solution of a var iation...

Ngày tải lên: 22/06/2014, 22:20

... is properly cited. The purpose of t his paper is to introduce and investigate two kinds of iterative algorithms for the problem of finding zeros of maximal monotone operators. Weak and strong convergence theorems ... proximal point algorithms for finding zeroes of maximal monotone operators in Hilbert spaces,” Journal of Inequalities and Applications, vol. 2008,...

Ngày tải lên: 21/06/2014, 11:20

... existence of an inverse mapping for a given nonlinear expand- ing mapping of X into itself involves a specific fixed point theorem. As a corollary of our main Theorem 5.1, we obtain the foll ow ing fixed ... theory of monotone operators in Hilbert spaces are discussed. Using the obtained solvability results, we formulate the corresponding fixed point theorem for a class of n...

Ngày tải lên: 22/06/2014, 22:20

... cases of 3, respectively. In the rest of this section, we introduce the main results of 3 in the case that k is positive. In the next section, we give two lemmas on estimations of bounds for solutions to ... given in their papers. The estimations of error bounds for these asymptotic solutions to 1.1 were given in 5 by Zhang et al. But the problem of obtai...

Ngày tải lên: 21/06/2014, 11:20

... for example, we found that the main modes of variation for the walking action obtained from PCA explain the combined motion of both the legs and the arms, while in the bending action they mainly ... frame- work for estimating the parameters of our 3D model from a sequence of 2D images. In [5] the action model improved the efficiency of the tracking algorithm by constrainin...

Ngày tải lên: 21/06/2014, 19:20

... Point Algorithms for Finding Zeroes of Maximal Monotone Operators in Hilbert Spaces Yeol Je Cho, 1 Shin Min Kang, 2 and Haiyun Zhou 3 1 Department of Mathematics Education and the RINS, Gyeongsang ... difficult as the original problem 1.5. Therefore, one of the most interesting and important problems in the theory of maximal monotone operators is to find an efficient...

Ngày tải lên: 22/06/2014, 06:20

... point in the intersection of the fixed point sets of a family of nonexpansive mapping see 6, 7. The ploblem of finding a common element of EPF, A and the set of all common fixed points of ... points of a family of nonexpansive mappings is of wide interdisciplinary interest and importance. Many iterative methods are purposed for finding a common element of the so...

Ngày tải lên: 21/06/2014, 11:20

... hybrid steepest-descent method for the variational inequality problem of the intersection of fixed point sets of nonexpansive mappings,” in Inherently Parallel Algorithm for Feasibility and Optimization, ... NY, USA, 2001. 2 F. Deutsch and I. Yamada, “Minimizing certain convex functions over the intersection of the fixed point sets of nonexpansive mappings,” Numerical Functi...

Ngày tải lên: 21/06/2014, 11:20

... monotone Hindawi Publishing Corporation Fixed Point Theory and Applications Volume 2011, Article ID 915629, 17 pages doi:10.1155/2011/915629 Research Article Iterative Algorithms for Finding Common Solutions ... problem of the solution to the quadratic minimization problem 1.8 and prove some strong convergence theorems for a family of nonexpansive mappings in the setting...

Ngày tải lên: 21/06/2014, 11:20

... closest possible window from the set with odd number of samples in the interval. Total number of windows in the set is 13. Figure 1 depicts the MSE of the obtained chirp-rate estimators for σ = 0.06 ... almost all windows with fixed width. It may happen that some of windows with fixed width outperform our algorithm, but it should be kept in mind that the best window is not know...

Ngày tải lên: 21/06/2014, 19:20