ON THE CONVERGENCE OF A NEW HYBRID PROJECTION ALGORITHM

作     者：Qian LIU Changyu WANG Xinmin YANG 

作者机构：Department of Mathematics Inner Mongolia University Hohhot 010021 China. Institute of Operations Research Qufu Normal University Qufu 273165 China. Department of Mathematics Chongqing Normal University Chongqing 400047 China Department of Mathematics Inner Mongolia University Hohhot 010021 China. 

出 版 物：《Journal of Systems Science & Complexity》 (系统科学与复杂性学报（英文版）)

年 卷 期：2006年第19卷第3期

页      面：423-430页

核心收录：

学科分类：12[管理学] 1201[管理学-管理科学与工程(可授管理学、工学学位)] 07[理学] 070105[理学-运筹学与控制论] 0701[理学-数学] 

基　　金：This work is supported by National Natural Science Foundation under Grants No. 10571106 and 10471159 

主　　题：Global convergence hybrid projection unconstrained optimization. 

摘      要：For unconstrained optimization, a new hybrid projection algorithm is presented m the paper. This algorithm has some attractive convergence properties. Convergence theory can be obtained under the condition that Δ↓f（x） is uniformly continuous. If Δ↓f（x） is continuously differentiable pseudo-convex, the whole sequence of iterates converges to a solution of the problem without any other assumptions. Furthermore, under appropriate conditions one shows that the sequence of iterates has a cluster-point if and only if Ω＊ ≠ θ. Numerical examples are given at the end of this paper.