arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1608.00236stat.CO
收藏

截断凸函数的极小化和及其应用

Minimizing Sum of Truncated Convex Functions and Its Applications

Tzu-Ying Liu, Hui Jiang

摘要:

本文研究了一类截断凸函数之和极小化的问题。在统计应用中,当拟合$\ell_0$ -惩罚模型时,经常会遇到它们,并且通常会导致NP-难非凸优化问题。在本文中,我们提出了一个通用的算法的全局极小在低维设置。我们还将算法扩展到高维设置,在那里可以有效地找到近似解。我们介绍了几个应用程序中使用的截断凸函数的总和,比较我们提出的算法与其他现有的算法在模拟研究,并显示其实用程序在边缘保持图像恢复的真实数据。

英文摘要:

In this paper, we study a class of problems where the sum of truncated convex functions is minimized. In statistical applications, they are commonly encountered when $\ell_0$-penalized models are fitted and usually lead to NP-Hard non-convex optimization problems. In this paper, we propose a general algorithm for the global minimizer in low-dimensional settings. We also extend the algorithm to high-dimensional settings, where an approximate solution can be found efficiently. We introduce several applications where the sum of truncated convex functions is used, compare our proposed algorithm with other existing algorithms in simulation studies, and show its utility in edge-preserving image restoration on real data.

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

↑