arrow
返回

DC approximation approaches for sparse optimization

delete2015-07-01
delete152
delete
OA
AI
H
Hoai An Le Thi *
T
Tao Pham Dinh
H
Hoai Minh Le
X
Xuan Thanh Vo
DOI:10.1016/j.ejor.2014.11.031delete
delete原文链接
delete分享
delete收藏
查看原文
摘要

摘要

En 中文
Sparse optimization refers to an optimization problem involving the zero-norm in objective or constraints. In this paper, nonconvex approximation approaches for sparse optimization have been studied with a unifying point of view in DC (Difference of Convex functions) programming framework. Considering a common DC approximation of the zero-norm including all standard sparse inducing penalty functions, we studied the consistency between global minimums (resp. local minimums) of approximate and original problems. We showed that, in several cases, some global minimizers (resp. local minimizers) of the approximate problem are also those of the original problem. Using exact penalty techniques in DC programming, we proved stronger results for some particular approximations, namely, the approximate problem, with suitable parameters, is equivalent to the original problem. The efficiency of several sparse inducing penalty functions have been fully analyzed. Four DCA (DC Algorithm) schemes were developed that cover all standard algorithms in nonconvex sparse approximation approaches as special versions. They can be viewed as, an l(1)-perturbed algorithm/reweighted-l(1) algorithm / reweighted-l(2) algorithm. We offer a unifying nonconvex approximation approach, with solid theoretical tools as well as efficient algorithms based on DC programming and DCA, to tackle the zero-norm and sparse optimization. As an application, we implemented our methods for the feature selection in SVM (Support Vector Machine) problem and performed empirical comparative numerical experiments on the proposed algorithms with various approximation functions. (C) 2014 Elsevier B.V. All rights reserved.
Keyword:
Global optimization
Sparse optimization
DC approximation function
DC programming and DCA
Feature selection in SVM
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

European Journal of Operational Research 封面图
European Journal of Operational Research
IF:
6
论文数:
2.2W
被引数:
6.4W

机构

U
universite de lorraine
学者数:
1.8W
论文数: 1.4W
被引数: 27
引用论文

引用论文

On the Implication of Hydrogen on Inter-granular Fracture
err2014-01-01
err0
errOAAI
errA. Oudriss; J. Bouhattate; C. Savall; J. Creus; X. Feaugas; F.A. Martin; P. Laghoutaris; J. Chêne
err分享
err收藏
Developing the future of gamma-ray astrophysics with monolithic silicon pixels
err2021-12-01
err0
errOAAI
errIsabella Brewer; Michela Negro; Nicolas Striebig; Carolyn Kierans; Regina Caputo; Richard Leys; Ivan Peric; Henrike Fleischhack; Jessica Metcalfe; Jeremy Perkins
err分享
err收藏
A Difference of Convex Functions Algorithm for Switched Linear Regression
err2014-08-01
err23
errOAAI
errTao Pham Dinh; Hoai Minh Le; Hoai An Le Thi; Lauer, Fabien
err分享
err收藏
学者 查看更多内容