Properties and Iterative Methods for the -Lasso

Maryam A. Alghamdi, Mohammad Ali Alghamdi, Naseer Shahzad and Hong-Kun Xu

Abstract and Applied Analysis, 2013, vol. 2013, 1-8

Abstract:

We introduce the -lasso which generalizes the well-known lasso of Tibshirani (1996) with a closed convex subset of a Euclidean m -space for some integer . This set can be interpreted as the set of errors within given tolerance level when linear measurements are taken to recover a signal/image via the lasso. Solutions of the -lasso depend on a tuning parameter . In this paper, we obtain basic properties of the solutions as a function of . Because of ill posedness, we also apply regularization to the -lasso. In addition, we discuss iterative methods for solving the -lasso which include the proximal-gradient algorithm and the projection-gradient algorithm.

Date: 2013
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/AAA/2013/250943.pdf (application/pdf)
http://downloads.hindawi.com/journals/AAA/2013/250943.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnlaaa:250943

DOI: 10.1155/2013/250943

Access Statistics for this article

More articles in Abstract and Applied Analysis from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().