arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1408.5214math.OC
收藏

箱形约束L1-minimization的投影收缩算法

Projected shrinkage algorithm for box-constrained L1-minimization

Hui Zhang, Lizhi Cheng

摘要:

当修正框约束可用时,框约束L1最小化的性能明显优于经典L1最小化。而且许多实际的L1-极小化模型确实涉及盒约束,因为它们从某个区间取某些值。本文提出了一种有效的迭代格式,即投影收缩(ProShrink)算法,用于求解一类框约束L1-极小化问题。该方法的一个重要贡献是,在推导过程中出现的一个复杂的邻近点算子可以等价地简化为一个投影收缩算子。理论上,我们证明了ProShrink算法对原始点序列和对偶点序列都是收敛的.在数值层面上,我们证明了通过稀疏恢复实验添加框约束的好处。

英文摘要:

Box-constrained L1-minimization can perform remarkably better than classical L1-minimization when correction box constraints are available. And also many practical L1-minimization models indeed involve box constraints because they take certain values from some interval. In this paper, we propose an efficient iteration scheme, namely projected shrinkage (ProShrink) algorithm, to solve a class of box-constrained L1-minimization problems. A key contribution in our technique is that a complicated proximal point operator appeared in the deduction can be equivalently simplified into a projected shrinkage operator. Theoretically, we prove that ProShrink enjoys a convergence of both the primal and dual point sequences. On the numerical level, we demonstrate the benefit of adding box constraints via sparse recovery experiments.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑