Finding sparse solutions to problems with convex constraints via concave programming

Authors

  • Francesco Rinaldi Dipartimento Informatica e Sistemistica "Antonio Ruberti"

Keywords:

Zero-norm, concave programming, Frank-Wolfe method

Abstract

In this work, we consider a class of nonlinear optimization problems with convex constraints with the aim of computing sparse solutions. This is an important task arising in various fields such as machine learning, signal processing, data analysis. We adopt a concave optimization-based approach, we define an effective version of the Frank-Wolfe algorithm, and we prove the global convergence of the method. Finally, we report numerical results on test problems showing both the effectiveness of the concave approach and the efficiency of the implemented algorithm.

Downloads

Published

20-07-2009

How to Cite

Rinaldi, F. (2009). Finding sparse solutions to problems with convex constraints via concave programming. Department of Computer and System Sciences Antonio Ruberti Technical Reports, 1(8). Retrieved from https://rosa.uniroma1.it/rosa00/index.php/dis_technical_reports/article/view/2790

Most read articles by the same author(s)