Feasibility Pump Algorithm for Sparse Representation under Laplacian Noise

Florin Ilarion Miertoiu and Bogdan Dumitrescu

Mathematical Problems in Engineering, 2019, vol. 2019, 1-9

Abstract:

The Feasibility Pump is an effective heuristic method for solving mixed integer optimization programs. In this paper the algorithm is adapted for finding the sparse representation of signals affected by Laplacian noise. Two adaptations of the algorithm, regularized and nonregularized, are proposed, tested, and compared against the regularized least absolute deviation (RLAD) model. The obtained results show that the addition of the regularization factor always improves the algorithm. The regularized version of the algorithm also offers better results than the RLAD model in all cases. The Feasibility Pump recovers the sparse representation with good accuracy while using a very small computation time when compared with other mixed integer methods.

Date: 2019
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/MPE/2019/5615243.pdf (application/pdf)
http://downloads.hindawi.com/journals/MPE/2019/5615243.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:jnlmpe:5615243

DOI: 10.1155/2019/5615243

Access Statistics for this article

More articles in Mathematical Problems in Engineering from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().