| 求解凸优化向前向后分裂算法的一个变形 |
| |
| 引用本文： | 李全艳,柳朝阳,周书芳,董云达. 求解凸优化向前向后分裂算法的一个变形[J]. 郑州大学学报(自然科学版), 2013, 0(2): 6-9 |
| |
| 作者姓名： | 李全艳 柳朝阳 周书芳 董云达 |
| |
| 作者单位： | 郑州大学数学系,河南郑州450001 |
| |
| 摘 要： | 求解凸优化向前向后分裂算法的一个变形：在第k次迭代中，利用第k和k-1步的信息，来确定下一个迭代点．并在较弱的条件下证明了它的收敛性，初步的数值结果表明了它的有效性．
|
| 关 键 词： | 凸优化 向前向后分裂算法 收敛性 |
A Variant of the Forward-backward Splitting Method for Solving Convex Optimization |
| |
| LI Quan-yan,LIU Chao-yang,ZHOU Shu-fang,DONG Yun-da. A Variant of the Forward-backward Splitting Method for Solving Convex Optimization[J]. Journal of Zhengzhou University (Natural Science), 2013, 0(2): 6-9 |
| |
| Authors: | LI Quan-yan LIU Chao-yang ZHOU Shu-fang DONG Yun-da |
| |
| Affiliation: | (Department of Mathematics, Zhengzhou University, Zhengzhou 450001, China) |
| |
| Abstract: | A variant of the forward-backward splitting method was proposed for solving convex optimization. During the k-th iteration, the next iterative point was determined by the information of the k-th and the （k- 1 ）-th iterations. Its convergence was proved under weak conditions, and its effectiveness was showed by preliminary numerical results. |
| |
| Keywords: | convex optimization forward-backward splitting method convergence |
| 本文献已被 维普 等数据库收录！ |
|
