In this paper, we considered the equality problem of weighted Bajraktarević means with weighted quasi-arithmetic means. Using the method of substituting for functions, we first transform the equality problem into solv...In this paper, we considered the equality problem of weighted Bajraktarević means with weighted quasi-arithmetic means. Using the method of substituting for functions, we first transform the equality problem into solving an equivalent functional equation. We obtain the necessary and sufficient conditions for the equality equation.展开更多
Let H;, H;, H;be real Hilbert spaces, let A : H;→ H;, B : H;→ H;be two bounded linear operators. The split equality common fixed point problem（SECFP） in the infinite-dimensional Hilbert spaces introduced by Moudaf...Let H;, H;, H;be real Hilbert spaces, let A : H;→ H;, B : H;→ H;be two bounded linear operators. The split equality common fixed point problem（SECFP） in the infinite-dimensional Hilbert spaces introduced by Moudafi（Alternating CQ-algorithm for convex feasibility and split fixed-point problems. Journal of Nonlinear and Convex Analysis）is to find x ∈ F（U）, y ∈ F（T） such that Ax = By,（1）where U : H;→ H;and T : H;→ H;are two nonlinear operators with nonempty fixed point sets F（U） = {x ∈ H;: Ux = x} and F（T） = {x ∈ H;: Tx = x}. Note that,by taking B = I and H;= H;in（1）, we recover the split fixed point problem originally introduced in Censor and Segal. Recently, Moudafi introduced alternating CQ-algorithms and simultaneous iterative algorithms with weak convergence for the SECFP（1） of firmly quasi-nonexpansive operators. In this paper, we introduce two viscosity iterative algorithms for the SECFP（1） governed by the general class of quasi-nonexpansive operators. We prove the strong convergence of algorithms. Our results improve and extend previously discussed related problems and algorithms.展开更多
The purpose of this paper is to introduce and study the split equality variational inclusion problems in the setting of Banach spaces. For solving this kind of problems, some new iterative algorithms are proposed. Und...The purpose of this paper is to introduce and study the split equality variational inclusion problems in the setting of Banach spaces. For solving this kind of problems, some new iterative algorithms are proposed. Under suitable conditions, some strong convergence theorems for the sequences generated by the proposed algorithm are proved. As applications, we shall utilize the results presented in the paper to study the split equality feasibility prob- lems in Banach spaces and the split equality equilibrium problem in Banach spaces. The results presented in the paper are new.展开更多
This paper presents a trust region two phase model algorithm for solving the equality and bound constrained nonlinear optimization problem. A concept of substationary point is given. Under suitable assumptions,the gl...This paper presents a trust region two phase model algorithm for solving the equality and bound constrained nonlinear optimization problem. A concept of substationary point is given. Under suitable assumptions,the global convergence of this algorithm is proved without assuming the linear independence of the gradient of active constraints. A numerical example is also presented.展开更多
Let A∈C<sup>m×n</sup>,set eigenvalues of matrix A with |λ<sub>1</sub> （A）|≥|λ<sub>2</sub>（A）|≥…≥|λ<sub>n</sub>（A）|,write A≥0 if A is a positive semid...Let A∈C<sup>m×n</sup>,set eigenvalues of matrix A with |λ<sub>1</sub> （A）|≥|λ<sub>2</sub>（A）|≥…≥|λ<sub>n</sub>（A）|,write A≥0 if A is a positive semidefinite Hermitian matrix, and denote∧<sub>k</sub> （A）=diag （λ<sub>1</sub>（A）,…,λ<sub>k</sub>（A））,∧<sub>(</sub>（n-k）.（A）=diag (λ<sub>k+1</sub>（A）,…,λ<sub>n</sub>（A）)for any k=1, 2,...,n if A≥0. Denote all n order unitary matrices by U<sup>n×n</sup>.Problem of equalities to hold in eigenvalue inequalities for products of matrices展开更多
Secure multiparty computation has become a central research focus in the international cryptographic community. Secure comparing two sets is an important problem in secure multiparty computation. The research on priva...Secure multiparty computation has become a central research focus in the international cryptographic community. Secure comparing two sets is an important problem in secure multiparty computation. The research on privately determining whether two sets are equal has not been investigated. This study solves the problem by mapping these sets into natural numbers and then comparing correspond- ing numbers, We propose two secure multiparty computation protocols for comparing two sets. It is proved by well-accepted simulation paradigm that these solutions are private in semi-honest model. These solutions have important significance in constructing other secure multiparty computation protocols.展开更多
文摘In this paper, we considered the equality problem of weighted Bajraktarević means with weighted quasi-arithmetic means. Using the method of substituting for functions, we first transform the equality problem into solving an equivalent functional equation. We obtain the necessary and sufficient conditions for the equality equation.
基金supported by National Natural Science Foundation of China(61503385)Fundamental Research Funds for the Central Universities of China(3122016L002)
文摘Let H;, H;, H;be real Hilbert spaces, let A : H;→ H;, B : H;→ H;be two bounded linear operators. The split equality common fixed point problem（SECFP） in the infinite-dimensional Hilbert spaces introduced by Moudafi（Alternating CQ-algorithm for convex feasibility and split fixed-point problems. Journal of Nonlinear and Convex Analysis）is to find x ∈ F（U）, y ∈ F（T） such that Ax = By,（1）where U : H;→ H;and T : H;→ H;are two nonlinear operators with nonempty fixed point sets F（U） = {x ∈ H;: Ux = x} and F（T） = {x ∈ H;: Tx = x}. Note that,by taking B = I and H;= H;in（1）, we recover the split fixed point problem originally introduced in Censor and Segal. Recently, Moudafi introduced alternating CQ-algorithms and simultaneous iterative algorithms with weak convergence for the SECFP（1） of firmly quasi-nonexpansive operators. In this paper, we introduce two viscosity iterative algorithms for the SECFP（1） governed by the general class of quasi-nonexpansive operators. We prove the strong convergence of algorithms. Our results improve and extend previously discussed related problems and algorithms.
基金supported by the National Natural Science Foundation of China(11361070)the Natural Science Foundation of China Medical University,Taiwan
文摘The purpose of this paper is to introduce and study the split equality variational inclusion problems in the setting of Banach spaces. For solving this kind of problems, some new iterative algorithms are proposed. Under suitable conditions, some strong convergence theorems for the sequences generated by the proposed algorithm are proved. As applications, we shall utilize the results presented in the paper to study the split equality feasibility prob- lems in Banach spaces and the split equality equilibrium problem in Banach spaces. The results presented in the paper are new.
文摘This paper presents a trust region two phase model algorithm for solving the equality and bound constrained nonlinear optimization problem. A concept of substationary point is given. Under suitable assumptions,the global convergence of this algorithm is proved without assuming the linear independence of the gradient of active constraints. A numerical example is also presented.
基金Supported partly by National Natural Science Foundation of China
文摘Let A∈C<sup>m×n</sup>,set eigenvalues of matrix A with |λ<sub>1</sub> （A）|≥|λ<sub>2</sub>（A）|≥…≥|λ<sub>n</sub>（A）|,write A≥0 if A is a positive semidefinite Hermitian matrix, and denote∧<sub>k</sub> （A）=diag （λ<sub>1</sub>（A）,…,λ<sub>k</sub>（A））,∧<sub>(</sub>（n-k）.（A）=diag (λ<sub>k+1</sub>（A）,…,λ<sub>n</sub>（A）)for any k=1, 2,...,n if A≥0. Denote all n order unitary matrices by U<sup>n×n</sup>.Problem of equalities to hold in eigenvalue inequalities for products of matrices
基金Supported by the National Natural Science Foundation of China (Grant No. 60673065)the High Technology Research and Development Program of China (Grant No. 2005AA114160)
文摘Secure multiparty computation has become a central research focus in the international cryptographic community. Secure comparing two sets is an important problem in secure multiparty computation. The research on privately determining whether two sets are equal has not been investigated. This study solves the problem by mapping these sets into natural numbers and then comparing correspond- ing numbers, We propose two secure multiparty computation protocols for comparing two sets. It is proved by well-accepted simulation paradigm that these solutions are private in semi-honest model. These solutions have important significance in constructing other secure multiparty computation protocols.
