近似邻近点算法收敛性的一个注记  

A note for the convergence of approximate proximal point algorithm

作　　者：李伟佳[1] 张万里[1] 林安[1] Li Weijia;Zhang Wanlin;Lin An(College of Mathematics Science, Chongqing Normal University, Chongqing 401331, China)

机构地区：[1]重庆师范大学数学科学学院,重庆401331

出　　处：《纯粹数学与应用数学》2016年第6期624-629,共6页Pure and Applied Mathematics

基　　金：国家自然科学基金(11301574);第二批重庆市高等学校青年骨干教师资助计划;重庆市研究生科研创新项目(CYS15154)

摘　　要：近似邻近点算法在最优化理论与方法研究中具有重要作用.在不同误差准则下,近似邻近点算法具有不同的收敛性.利用极大单调算子等工具给出了一个具体的例子,解释了在一些误差准则下近似邻近点算法的收敛性.Approximate proximal point algorithm has been playing an important role in optimization theoryand methods. Under various approximate calculation, approximate proximal point algorithm has different convergence.In this paper, by means of some tools including as maximal monotone operator etc., a concreteexample is presented to illustrate the convergence of approximate proximal point algorithm with some approximatecalculations.

关 键 词：近似邻近点算法 极大单调算子 误差准则 

分 类 号：O221.2[理学—运筹学与控制论]