.png){kind=icon}
返回
A gradient descent based algorithm for lp minimization
.png){kind=icon}
OA
AI
DOI：10.1016/j.ejor.2019.11.051.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, we study the linearly constrained l(p) minimization problem with p is an element of (0, 1). Unlike those known works in the literature that propose solving relaxed epsilon-KKT conditions, we introduce a scaled KKT condition without involving any relaxation of the optimality conditions. A gradient-descent-based algorithm that works only on the positive entries of variables is then proposed to find solutions satisfying the scaled KKT condition without invoking the nondifferentiability issue. The convergence proof and complexity analysis of the proposed algorithm are provided. Computational experiments support that the proposed algorithm is capable of achieving much better sparse recovery in reasonable computational time compared to state-of-the-art interior-point based algorithms. (C) 2019 Elsevier B.V. All rights reserved.
Keyword:
Global optimization
Nonsmooth optimization
Nonconvex optimization
Gradient descent algorithm
KKT condition
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
引用论文
.png){kind=icon}
查看更多内容