首页 | 本学科首页   官方微博 | 高级检索  
     检索      

分裂可行问题(SFP)的投影算法
引用本文:杨庆之,赵金玲.分裂可行问题(SFP)的投影算法[J].计算数学,2006,28(2):121-132.
作者姓名:杨庆之  赵金玲
作者单位:南开大学数学科学学院,核心数学与组合数学实验室(LPMC),天津,300071
摘    要:本文探讨了分裂可行问题(SFP)的投影算法.我们先定义了(SFP)的反问题(ISFP), 然后利用正交投影性质,给出了(SFP)与(ISFP)及某些投影不动点问题之间的关系.随后, 给出了求解(SFP)的几种正交投影算法,其中包括精确和不精确投影格式.基于变分不等式中投影算法收敛性的证明思路和分裂可行问题的特有形式,证明了这几种算法的收敛性.最后通过几个算例对讨论的方法进行了初步比较.

关 键 词:SFP  ISFP  正交投影  Moore-Penrose广义逆  算法
收稿时间:2004-03-14
修稿时间:2004-03-14

THE PROJECTION-TYPE METHODS FOR SOLVING THE SPLIT FEASIBILITY PROBLEM
Yang Qingzhi,Zhao Jinling.THE PROJECTION-TYPE METHODS FOR SOLVING THE SPLIT FEASIBILITY PROBLEM[J].Mathematica Numerica Sinica,2006,28(2):121-132.
Authors:Yang Qingzhi  Zhao Jinling
Institution:School of Mathematics and LPMC, Nankai University, Tianjin 300071, China
Abstract:In this paper we study the projection-type methods for solving the split feasibility problem. We define the split feasibility problem and its inverse problem and build the connections between the split feasibility problem, its inverse problem and several fixed point problems containing the projection operators. Based on it, we present several algorithms solving the split feasibility problem, including the exact and inexact schemes. Finally, we perform some numerical experiments, which preliminarily show the behaviors of the algorithms proposed.
Keywords:the split feasibility problem  the inverse split feasibility problem  projection  Moore-Penrose inverse matrix  algorithm
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《计算数学》浏览原始摘要信息
点击此处可从《计算数学》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号