求解l1极小化问题的Bregman迭代算法
Acta Analysis Functionalis Applicata（2012）
Abstract
在Tikhonov正则化方法的基础上将其转化为一类l1极小化问题进行求解,并基于Bregman迭代正则化构建了Bregman迭代算法,实现了l1极小化问题的快速求解.数值实验结果表明,Bregman迭代算法在快速求解算子方程的同时,有着比最小二乘法和Tikhonov正则化方法更高的求解精度.
MoreTranslated text
Key words
Tikhonov regularization,minimization problems,Bregman iterative algorithm
AI Read Science
Must-Reading Tree
Example
Generate MRT to find the research sequence of this paper
Chat Paper
Summary is being generated by the instructions you defined