稀疏$\ell_1$ - optimization的基于二阶正交基的丰富Hessian信息方法
Second-order orthant-based methods with enriched Hessian information for sparse $\ell_1$-optimization
摘要:
我们提出了一个二阶算法,基于正交方向,解决涉及稀疏增强$\ell_1$ -范数的最优化问题。我们的方法的主要思想是修改下降orthawise方向通过使用二阶信息的正规项和(在弱意义上)的$\ell_1$ -范数。通过部分Huber正则化将$\ell_1$项后面的弱二阶信息合并。我们的算法的主要特点之一是在一个更快的识别活动集。我们还证明了我们的方法的简化版本是等价的半光滑牛顿算法适用于最优性条件,在一个特定的选择的算法参数。我们提出了几个计算实验,以显示我们的方法相比,其他国家的最先进的算法的效率。
英文摘要:
We present a second order algorithm, based on orthantwise directions, for solving optimization problems involving the sparsity enhancing $\ell_1$-norm. The main idea of our method consists in modifying the descent orthantwise directions by using second order information both of the regular term and (in weak sense) of the $\ell_1$-norm. The weak second order information behind the $\ell_1$-term is incorporated via a partial Huber regularization. One of the main features of our algorithm consists in a faster identification of the active set. We also prove that a reduced version of our method is equivalent to a semismooth Newton algorithm applied to the optimality condition, under a specific choice of the algorithm parameters. We present several computational experiments to show the efficiency of our approach compared to other state-of-the-art algorithms.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。