@article {vandenberg2011SIAMsol,
	title = {Sparse optimization with least-squares constraints},
	journal = {SIAM Journal on Optimization},
	volume = {21},
	number = {4},
	year = {2011},
	month = {11},
	pages = {1201{\textendash}1229},
	abstract = {The use of convex optimization for the recovery of sparse signals from incomplete or compressed data is now common practice. Motivated by the success of basis pursuit in recovering sparse vectors, new formulations have been proposed that take advantage of different types of sparsity. In this paper we propose an efficient algorithm for solving a general class of sparsifying formulations. For several common types of sparsity we provide applications, along with details on how to apply the algorithm, and experimental results.},
	keywords = {basis pursuit, compressed sensing, convex program, duality, group sparsity, matrix completion, Newton{\textquoteright}s method, root-finding, sparse solutions},
	doi = {10.1137/100785028},
	url = {http://www.math.ucdavis.edu/\%7Empf/2010-sparse-optimization-with-least-squares.html},
	author = {Ewout van den Berg and Michael P. Friedlander}
}
