NDLI: Sparse Signal Estimation by Maximally Sparse Convex Optimization

Content Provider	IEEE Xplore Digital Library
Author	Selesnick, I.W. Bayram, I.
Copyright Year	1991
Abstract	This paper addresses the problem of sparsity penalized least squares for applications in sparse signal processing, e.g., sparse deconvolution. This paper aims to induce sparsity more strongly than L1 norm regularization, while avoiding non-convex optimization. For this purpose, this paper describes the design and use of non-convex penalty functions (regularizers) constrained so as to ensure the convexity of the total cost function F to be minimized. The method is based on parametric penalty functions, the parameters of which are constrained to ensure convexity of F. It is shown that optimal parameters can be obtained by semidefinite programming (SDP). This maximally sparse convex (MSC) approach yields maximally non-convex sparsity-inducing penalty functions constrained such that the total cost function F is convex. It is demonstrated that iterative MSC (IMSC) can yield solutions substantially more sparse than the standard convex sparsity-inducing approach, i.e., L1 norm minimization.
Sponsorship	IEEE Signal Processing Society
Starting Page	1078
Ending Page	1092
Page Count	15
File Size	2593378
File Format	PDF
ISSN	1053587X
Volume Number	62
Issue Number	5
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2014-01-01
Publisher Place	U.S.A.
Access Restriction	One Nation One Subscription (ONOS)
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Convex optimization Iterative methods non-convex optimization sparse optimization sparse regularization basis pursuit lasso deconvolution L1 norm threshold function
Content Type	Text
Resource Type	Article
Subject	Signal Processing Electrical and Electronic Engineering

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Group-Sparse Signal Denoising: Non-Convex Regularization, Convex Optimization

An Interior-Point Method for Large-Scale $ell_1$-Regularized Least Squares

Ranked Sparse Signal Support Detection

Fast and Accurate Algorithms for Re-Weighted $ell _{1}$-Norm Minimization

An Improved Smoothed $ell^0$ Approximation Algorithm for Sparse Representation

Sparse Reconstruction by Separable Approximation

Euclid in a Taxicab: Sparse Blind Deconvolution with Smoothed ${ell _1}/{ell _2}$ Regularization

RLS Algorithm With Convex Regularization

Restoration of Astrophysical Spectra With Sparsity Constraints: Models and Algorithms

Sparse Signal Estimation by Maximally Sparse Convex Optimization

Similar Documents

Group-Sparse Signal Denoising: Non-Convex Regularization, Convex Optimization

An Interior-Point Method for Large-Scale $ell_1$-Regularized Least Squares

Ranked Sparse Signal Support Detection

Fast and Accurate Algorithms for Re-Weighted $ell _{1}$-Norm Minimization

An Improved Smoothed $ell^0$ Approximation Algorithm for Sparse Representation

Sparse Reconstruction by Separable Approximation

Euclid in a Taxicab: Sparse Blind Deconvolution with Smoothed ${ell _1}/{ell _2}$ Regularization

RLS Algorithm With Convex Regularization

Restoration of Astrophysical Spectra With Sparsity Constraints: Models and Algorithms

Sparse Signal Estimation by Maximally Sparse Convex Optimization