Fetching the paper…
Reading the bibliography…
The ordered weighted $\ell_1$ norm (OWL) was recently proposed, with two different motivations: its good statistical properties as a sparsity promoting regularizer; the fact that it generalizes the so-called {\it octagonal shrinkage and clustering algorithm for regression} (OSCAR), which has the ability to cluster/group regression variables that are highly correlated.
G. Hardy, J. Littlewood, and G. Pólya, Inequalities . Cambridge University Press, 1934
1934
Earlier work this paper cites.
M. Frank and P. Wolfe, “An algorithm for quadratic programming,” Naval research logistics quarterly , vol. 3, no. 1-2, pp. 95–110, 1956
1956
Earlier work this paper cites.
R. T. Rockafellar, Convex Analysis . Princeton University Press, 1970
1970
Earlier work this paper cites.
R. Barlow, D. Bartholomew, J. Bremand, and H. Brunk, Statistical inference under order restrictions; the theory and application of isotonic regression . New York: Wiley, 1972
1972
Earlier work this paper cites.
R. Brent, Algorithms for Minimization without Derivatives . Prentice-Hall, 1973
1973
Earlier work this paper cites.
——, “A method of solving a convex programming problem with convergence rate 𝒪 ( 1 / k 2 ) \mathcal{O}(1/k^{2}) ,” in Soviet Mathematics Doklady , vol. 27, 1983, pp. 372–376
1983
Earlier work this paper cites.
J. Barzilai and J. Borwein, “Two-point step size gradient methods,” IMA Journal of Numerical Analysis , vol. 8, pp. 141–148, 1988
1988
Earlier work this paper cites.
M. Best and N. Chakravarti, “Active set algorithms for isotonic regression: A unifying framework,” Mathematical Programming , vol. 47, pp. 425–439, 1990
1990
Earlier work this paper cites.
G. Ziegler, Lectures of Polytopes . Springer, 1995
1995
Earlier work this paper cites.
R. Tibshirani, “Regression shrinkage and selection via the lasso,” Journal of the Royal Statistical Society (B) , pp. 267–288, 1996
1996
Earlier work this paper cites.
M. Figueiredo and R. Nowak, “An EM algorithm for wavelet-based image restoration,” IEEE Transactions on Image Processing , vol. 12, pp. 906–916, 2003
2003
Earlier work this paper cites.
S. Boyd and L. Vandenberghe, Convex Optimization . Cambridge University Press, 2004
2004
Earlier work this paper cites.
I. Daubechies, M. Defrise, and C. De Mol, “An iterative thresholding algorithm for linear inverse problems with a sparsity constraint,” Communications on pure and applied mathematics , vol. 57, pp. 1413–1457, 2004
2004
Earlier work this paper cites.
Y. Nesterov, “Introductory lectures on convex optimization, 2004.”
2004
Earlier work this paper cites.
R. Tibshirani, M. Saunders, S. Rosset, J. Zhu, and K. Knight, “Sparsity and smoothness via the fused lasso,” Journal of the Royal Statistical Society (B) , vol. 67, pp. 91–108, 2004
2004
Earlier work this paper cites.
M. Yuan and Y. Lin, “Model selection and estimation in regression with grouped variables,” Journal of the Royal Statistical Society (B) , vol. 68, pp. 49–67, 2005
2005
Earlier work this paper cites.
H. Zou and T. Hastie, “Regularization and variable selection via the elastic net,” Journal of the Royal Statistical Society (B) , vol. 67, pp. 301–320, 2005
2005
Cited alongside, same era.
J. Bioucas-Dias and M. Figueiredo, “A new TwIST: two-step iterative shrinkage/thresholding algorithms for image restoration,” IEEE Transactions on Image Processing , vol. 16, pp. 2992–3004, 2007
2007
Cited alongside, same era.
H. Bondell and B. Reich, “Simultaneous regression shrinkage, variable selection, and supervised clustering of predictors with OSCAR,” Biometrics , vol. 64, pp. 115–123, 2007
2007
Cited alongside, same era.
M. Figueiredo, R. Nowak, and S. Wright, “Gradient projection for sparse reconstruction: Application to compressed sensing and other inverse problems,” IEEE Journal of Selected Topics in Signal Processing , vol. 1, pp. 586–597, 2007
2007
Cited alongside, same era.
F. Bach, R. Jenatton, J. Mairal, and G. Obozinski, “Structured sparsity through convex optimization,” Statistical Science , vol. 27, no. 4, pp. 450–468, 2012
2012
Later among the works it cites.
V. Chandrasekaran, B. Recht, P. A. Parrilo, and A. S. Willsky, “The convex geometry of linear inverse problems,” Foundations of Computational Mathematics , vol. 12, no. 6, pp. 805–849, 2012
2012
Later among the works it cites.
2012
Later among the works it cites.
N. Rao, B. Recht, and R. Nowak, “Universal measurement bounds for structured sparse signal recovery,” in Proc. Intern. Conf. Artificial Intelligence and Statistics (AISTATS) , 2012, pp. 942–950
2012
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
W. Press, S. Teukolsky, W. Vetterling, and B. Flannery, Numerical Recipes: The Art of Scientific Computing (3rd Edition) . Cambridge University Press, 2007
2007
Cited alongside, same era.
A. Beck and M. Teboulle, “A fast iterative shrinkage-thresholding algorithm for linear inverse problems,” SIAM Journal on Imaging Sciences , vol. 2, pp. 183–202, 2009
2009
Cited alongside, same era.
D. Bertsekas, Convex Optimization Theory . Athena Scientific, 2009
2009
Cited alongside, same era.
J. de Leeuw, K. Hornik, and and, “Isotone optimization in R: Pool-adjacent-violators algorithm (pava) and active set methods,” Journal of Statistical Software , vol. 32, pp. 1–24, 2009
2009
Cited alongside, same era.
J. Liu and J. Ye, “Efficient Euclidean projections in linear time,” in Proceedings of the 26th International Conference on Machine Learning , 2009, pp. 657––664
2009
Cited alongside, same era.
S. Wright, R. Nowak, and M. Figueiredo, “Sparse reconstruction by separable approximation,” IEEE Transactions on Signal Processing , vol. 57, pp. 2479–2493, 2009
2009
Cited alongside, same era.
M. Afonso, J. Bioucas-Dias, and M. Figueiredo, “An augmented lagrangian approach to the constrained optimization formulation of imaging inverse problems,” IEEE Transactions on Image Processing , vol. 20, pp. 681–695, 2011
2011
Cited alongside, same era.
H. Bauschke and P. Combettes, Convex analysis and monotone operator theory in Hilbert spaces , 2011
2011
Cited alongside, same era.
N. Simon, J. Friedman, T. Hastie, and R. Tibshirani, “The sparse-group lasso,” Journal of Computational and Graphical Statistics , 2012, to appear
2012
Later among the works it cites.
S. Sra, “Fast projections onto mixed-norm balls with applications,” Data Mining and Knowledge Discovery , vol. 25, no. 2, pp. 358–377, 2012
2012
Later among the works it cites.
L. Zhong and J. Kwok, “Efficient sparse modeling with automatic feature grouping,” IEEE Transactions on Neural Networks and Learning Systems , vol. 23, pp. 1436–1447, 2012
2012
Later among the works it cites.
2013
Later among the works it cites.
M. Jaggi, “Revisiting Frank-Wolfe: Projection-free sparse convex optimization,” in Proceedings of the 30th International Conference on Machine Learning (ICML-13) , 2013, pp. 427–435
2013
Later among the works it cites.
D. Lorenz and N. Worliczek, “Necessary conditions for variational regularization schemes,” Inverse Problems , vol. 29, 2013
2013
Later among the works it cites.
N. Rao, P. Shah, S. Wright, and R. Nowak, “A greedy forward backward method for atomic norm constrained minimization,” in Proc. IEEE Intern. Conf. Acoustics, Speech and Signal Processing (ICASSP) , 2013
2013
Later among the works it cites.
L. Condat, “Fast projection onto the simplex and the ℓ 1 \ell_{1} ball,” HAL, Tech. Rep. hal-01056171, 2014. [Online]. Available: https://hal.archives-ouvertes.fr/hal-01056171
2014
Closest in time.
M. Figueiredo and R. Nowak, “Sparse estimation with strongly correlated variables using ordered weighted ℓ 1 \ell_{1} regularization,” arXiv preprint arXiv: , 2014
2014
Closest in time.
R. Negrinho and A. Martins, “Orbit regularization,” in Neural Information Processing Systems (NIPS) 27 , 2014
2014
Closest in time.
X. Zeng and M. Figueiredo, “Decreasing weighted sorted ℓ 1 \ell_{1} regularization,” IEEE Signal Processing Letters , vol. 21, pp. 1240–1244, 2014
2014
Closest in time.
——, “Solving OSCAR regularization problems by fast approximate proximal splitting algorithms,” Digital Signal Processing , vol. 31, pp. 124–135, 2014
2014
Closest in time.