A Fixed Point Method for Convex Systems  

作　　者：Morteza Kimiaei Farzad Rahpeymaii 

机构地区：[1]Department of Mathematics, Payame Noor University, Tehran, Iran [2]Department of Mathematics, Razi University, Kermanshah, Iran

出　　处：《Applied Mathematics》2012年第10期1327-1333,共7页应用数学（英文）

摘　　要：We present a new fixed point technique to solve a system of convex equations in several variables. Our approach is based on two powerful algorithmic ideas: operator-splitting and steepest descent direction. The quadratic convergence of the proposed approach is established under some reasonable conditions. Preliminary numerical results are also reported.We present a new fixed point technique to solve a system of convex equations in several variables. Our approach is based on two powerful algorithmic ideas: operator-splitting and steepest descent direction. The quadratic convergence of the proposed approach is established under some reasonable conditions. Preliminary numerical results are also reported.

关 键 词：CONVEX EQUATIONS Least SQUARES -Regularization Problems Fixed POINT Quadratically CONVERGENCE 

分 类 号：O1[理学—数学]