Fetching the paper…
Reading the bibliography…
We consider a class of nonconvex nonsmooth optimization problems whose objective is the sum of a smooth function and a finite number of nonnegative proper closed possibly nonsmooth functions (whose proximal mappings are easy to compute), some of which are further composed with linear maps.
Portfolio selection
H. Markowitz · 1952
Earlier work this paper cites.
Convex Analysis
R. T. Rockafellar · 1970
Earlier work this paper cites.
Differentiability of the metric projection in finite dimensional Euclidean space
E. Asplund · 1973
Earlier work this paper cites.
A dual algorithm for the solution of nonlinear variational problems via finite element approximations
D. Gabay and B. Mercier · 1976
Earlier work this paper cites.
On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
J. Eckstein and D. P. Bertsekas · 1992
Earlier work this paper cites.
Regression shrinkage and selection via the Lasso
R. Tibshirani · 1996
Earlier work this paper cites.
Variational Analysis
R. T. Rockafellar and R. J-B. Wets · 1998
Earlier work this paper cites.
Smooth minimization of non-smooth functions
Y. Nesterov · 2005
Earlier work this paper cites.
Fast Moreau envelope computation I: Numerical algorithms
Y. Lucet · 2006
Earlier work this paper cites.
Structured low-rank approximation and its applications
I. Markovsky · 2008
Earlier work this paper cites.
Sparse and stable Markowitz portfolios
J. Brodie, I. Daubechies, C. De Mol, D. Giannone and I. Loris · 2009
Earlier work this paper cites.
Exact matrix completion via convex optimization
E. J. Candès and B. Recht · 2009
Cited alongside, same era.
Sparse reconstruction by separable approximation
S. J. Wright, R. D. Nowak and M. A. T. Figueiredo · 2009
Cited alongside, same era.
Computing a nearest correlation matrix with factor structure
R. Borsdorf, N. J. Higham and M. Raydan · 2010
Cited alongside, same era.
A majorized penalty approach for calibrating rank constrained correlation matrix problems, Technical report, National University of Singapore, 2010
Y. Gao and D. Sun · 2010
Cited alongside, same era.
Guaranteed minimum-rank solutions for linear matrix equations via nuclear norm minimization
B. Recht, M. Fazel and P. A. Parrilo · 2010
Cited alongside, same era.
A DC programming approach for sparse eigenvalue problem,
M. Thiao, D. T. Pham and H. A. Le Thi · 2010
A general iterative shrinkage and thresholding algorithm for non-convex regularized optimization problems
P. Gong, C. Zhang, Z. Lu, J. Huang and J. Ye · 2013
Later among the works it cites.
Sparse approximation via penalty decomposition methods
Z. Lu and Y. Zhang · 2013
Later among the works it cites.
Non-negative least squares for high-dimensional linear models: Consistency and sparse recovery without regularization
M. Slawski and M. Hein · 2013
Later among the works it cites.
Better approximation and faster algorithm using the proximal average
Y. L. Yu · 2013
Later among the works it cites.
Global convergence of splitting methods for nonconvex composite optimization
G. Li and T. K. Pong · 2015
Later among the works it cites.
Sparse recovery via partial regularization: Models, theory and algorithms
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Convex Analysis and Monotone Operator Theory in Hilbert Spaces
H. H. Bauschke and P. L. Combettes · 2011
Cited alongside, same era.
Templates for convex cone problems with applications to sparse signal recovery
S. Becker, E. J. Candès and M. Grant · 2011
Cited alongside, same era.
The solution path of the generalized Lasso
R. Tibshirani and J. Taylor · 2011
Cited alongside, same era.
Estimation of simultaneously sparse and low rank matrices
E. Richard, P.-A. Savalle and N. Vayatis · 2012
Cited alongside, same era.
Sparse portfolio selection via quasi-norm regularization
C. Chen, X. Li, C. Tolman, S. Wang and Y. Ye · 2013
Cited alongside, same era.
Z. Lu and X. Li · 2015
Later among the works it cites.
Penalty decomposition methods for rank minimization
Z. Lu, Y. Zhang and X. Li · 2015
Later among the works it cites.
Convex fused Lasso denoising with non-convex regularization and its use for pulse detection
A. Parekh and I. W. Selesnick · 2015
Later among the works it cites.
Minimizing nonconvex non-separable functions
Y. L. Yu, X. Zheng, M. Marchetti-Bowick and E. Xing · 2015
Later among the works it cites.
Difference-of-convex learning: directional stationarity, optimality, and sparsity
M. Ahn, J. S. Pang and J. Xin · 2017
Closest in time.
Efficient DC algorithm for constrained sparse optimization
K. Tono, A. Takeda and J. Gotoh · 2017
Closest in time.