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

约束稀疏Optimization的高效DC算法

Efficient DC Algorithm for Constrained Sparse Optimization

Katsuya Tono, Akiko Takeda, Jun-ya Gotoh

摘要:

我们解决了一个光滑的目标函数的最小化下的$\ell_0$ -约束和简单的凸约束。当问题除了$\ell_0$ -约束外没有约束时,一些有效的算法是可用的;例如,近似DC(凸函数差分)算法(PDCA)反复评估凸子问题的封闭形式解,导致$\ell_0$ -约束问题的稳定点。然而,当问题有额外的凸约束,他们变得低效,因为它是很难获得相关的子问题的封闭形式的解决方案。在本文中,我们重新制定的问题,采用一种新的DC表示的$\ell_0$ -约束,使PDCA可以保持效率,减少其子问题的投影操作到一个凸集。此外,受Nesterov的邻近方法的加速技术的启发,我们提出了加速PDCA(APDCA),它达到最佳的收敛速度,如果应用到凸规划,并在数值实验中表现良好。

英文摘要:

We address the minimization of a smooth objective function under an $\ell_0$-constraint and simple convex constraints. When the problem has no constraints except the $\ell_0$-constraint, some efficient algorithms are available; for example, Proximal DC (Difference of Convex functions) Algorithm (PDCA) repeatedly evaluates closed-form solutions of convex subproblems, leading to a stationary point of the $\ell_0$-constrained problem. However, when the problem has additional convex constraints, they become inefficient because it is difficult to obtain closed-form solutions of the associated subproblems. In this paper, we reformulate the problem by employing a new DC representation of the $\ell_0$-constraint, so that PDCA can retain the efficiency by reducing its subproblems to the projection operation onto a convex set. Moreover, inspired by the Nesterov's acceleration technique for proximal methods, we propose the Accelerated PDCA (APDCA), which attains the optimal convergence rate if applied to convex programs, and performs well in numerical experiments.

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

↑