Name
Abstract | ||
|---|---|---|
Given a non empty polyhedral set, we consider the problem of finding a vector belonging to it and having the minimum number of nonzero components, i.e., a feasible vector with minimum zero-norm. This combinatorial optimization problem is NP-Hard and arises in various fields such as machine learning, pattern recognition, signal processing. One of the contributions of this paper is to propose two new smooth approximations of the zero-norm function, where the approximating functions are separable and concave. In this paper we first formally prove the equivalence between the approximating problems and the original nonsmooth problem. To this aim, we preliminarily state in a general setting theoretical conditions sufficient to guarantee the equivalence between pairs of problems. Moreover we also define an effective and efficient version of the Frank-Wolfe algorithm for the minimization of concave separable functions over polyhedral sets in which variables which are null at an iteration are eliminated for all the following ones, with significant savings in computational time, and we prove the global convergence of the method. Finally, we report the numerical results on test problems showing both the usefulness of the new concave formulations and the efficiency in terms of computational time of the implemented minimization algorithm. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1007/s10589-008-9202-9 | Comp. Opt. and Appl. |
Keywords | DocType | Volume |
Zero-norm,Concave optimization,Frank-Wolfe algorithm,Feature selection | Journal | 46 |
Issue | ISSN | Citations |
3 | 0926-6003 | 27 |
PageRank | References | Authors |
1.26 | 8 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| F. Rinaldi | 1 | 181 | 19.61 |
| F. Schoen | 2 | 169 | 14.42 |
| M. Sciandrone | 3 | 335 | 29.01 |