Conference paper · 2008

Solving non-convex lasso type problems with DC programming

Gilles Gasso, Alain Rakotomamonjy, Stéphane Canu

Machine learning for signal processing ..., 450–455 · Published 1 October 2008 · DOI 10.1109/mlsp.2008.4685522

View at the publisherCite this paper

In brief

“Solving non-convex lasso type problems with DC programming” is a 2008 conference paper by Gilles Gasso and 2 co-authors, published in Machine learning for signal processing .... OpenAlex counts 5 citations as of 15 November 2026. The publisher's version is not open access, and OpenAlex records no free legal copy.

Citations
5
Most cited in
2015 (2)
References
13
Authors
3

Abstract

The paper proposes a novel algorithm for addressing variable selection (or sparsity recovering) problem using non-convex penalties. A generic framework based on a DC programming is presented and yields to an iterative weighted lasso-type problem. We have then showed that many existing approaches for solving such a non-convex problem are particular cases of our algorithm.… Read the full abstract at the publisher.

Excerpt. This paper is not open access.

Cite this paper

Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.

APA 7

Gasso, G., Rakotomamonjy, A., & Canu, S. (2008). Solving non-convex lasso type problems with DC programming. Machine learning for signal processing ..., 450–455. https://doi.org/10.1109/mlsp.2008.4685522

MLA 9

Gasso, Gilles, et al. “Solving non-convex lasso type problems with DC programming.” Machine learning for signal processing ..., 2008, pp. 450–455. https://doi.org/10.1109/mlsp.2008.4685522.

Chicago

Gasso, Gilles, Alain Rakotomamonjy, and Stéphane Canu. 2008. “Solving non-convex lasso type problems with DC programming.” Machine learning for signal processing ...: 450–455. https://doi.org/10.1109/mlsp.2008.4685522.

Harvard

Gasso, G., Rakotomamonjy, A. and Canu, S. (2008) ‘Solving non-convex lasso type problems with DC programming’, Machine learning for signal processing ..., pp. 450–455. doi:10.1109/mlsp.2008.4685522.

IEEE

G. Gasso, A. Rakotomamonjy, and S. Canu, “Solving non-convex lasso type problems with DC programming,” Machine learning for signal processing ..., pp. 450–455, 2008, doi: 10.1109/mlsp.2008.4685522.

BibTeX

@inproceedings{gasso2008solving,
  title     = {{Solving non-convex lasso type problems with DC programming}},
  author    = {Gasso, Gilles and Rakotomamonjy, Alain and Canu, Stéphane},
  booktitle = {Machine learning for signal processing ...},
  year      = {2008},
  pages     = {450--455},
  doi       = {10.1109/mlsp.2008.4685522},
  url       = {https://doi.org/10.1109/mlsp.2008.4685522}
}

Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)

Citations by year

YearCitationsShare of the best year
201522
201911
202322

Topic and keywords

Physical Sciences › Mathematics › Statistics and Probability › Statistical Methods and Inference

  • DC programming
  • feature selection
  • non-convex penalties
  • optimization algorithms

Work with this paper

Most-cited papers in Mathematics

All highly cited Mathematics papers

Questions about this paper

How do I cite this paper in APA style?

Gasso, G., Rakotomamonjy, A., & Canu, S. (2008). Solving non-convex lasso type problems with DC programming. Machine learning for signal processing ..., 450–455. https://doi.org/10.1109/mlsp.2008.4685522

How many times has this paper been cited?

5 times, according to OpenAlex on 15 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.

Is this paper free to read?

OpenAlex records no free legal copy. Check your library's access, the authors' pages or a repository, or ask the corresponding author for a copy.

Who wrote this paper?

Gilles Gasso, Alain Rakotomamonjy, Stéphane Canu.

What is the DOI of this paper?

10.1109/mlsp.2008.4685522. The permanent link is https://doi.org/10.1109/mlsp.2008.4685522.

Bibliographic data from OpenAlex (CC0), last checked 15 November 2026. ResearchGuru does not host this paper; the links go to the publisher or the repository that does.