.png){kind=icon}
返回
Random Coordinate Descent Methods for l0 Regularized Convex Optimization
.png){kind=icon}
PRE
AI
DOI：10.1109/TAC.2015.2390551.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, we study the minimization of l(0) regularized optimization problems, where the objective function is composed of a smooth convex function and the l(0) regularization. We analyze optimality conditions for this nonconvex problem which lead to the separation of local minima into two restricted classes that are nested and around the set of global minima. Based on these restricted classes of local minima, we devise two new random coordinate descent type methods for solving these problems. In particular, we analyze the convergence properties of an iterative hard thresholding based random coordinate descent algorithm for which we prove that any limit point is a local minimum from the first restricted class of local minimizers. Then, we analyze the convergence of a random proximal alternating minimization method and show that any limit point of this algorithm is a local minima from the second restricted class of local minimizers. We also provide numerical experiments which show the superior behavior of our methods in comparison with the usual iterative hard thresholding algorithm.
Keyword:
Local minima
packetized predictive control
random coordinate descent
sparse regularization
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7
论文数:
1.3W
被引数:
6.7W
机构
引用论文
.png){kind=icon}
Optical absorption and luminescence spectra of phosphate glasses activated with trivalent vanadium
PREAI
分享收藏
查看更多内容