A unifying framework of high-dimensional sparse estimation with difference-of-convex (DC) regularizations
From MaRDI portal
Publication:2163076
Cites work
- A proof of convergence of the concave-convex procedure using Zangwill's theory
- A unified approach to model selection and sparse recovery using regularized least squares
- Adaptive Lasso for sparse high-dimensional regression models
- Analysis of multi-stage convex relaxation for sparse regularization
- Calibrating nonconvex penalized regression in ultra-high dimension
- Computing B-stationary points of nonsmooth DC programs
- Confidence Intervals and Hypothesis Testing for High-Dimensional Regression
- Confidence intervals for low dimensional parameters in high dimensional linear models
- Convex analysis approach to d. c. programming: Theory, algorithms and applications
- DC programming: overview.
- Difference-of-convex learning: directional stationarity, optimality, and sparsity
- Global minimization of a difference of two convex functions
- scientific article; zbMATH DE number 5957408 (Why is no real title available?)
- scientific article; zbMATH DE number 3950216 (Why is no real title available?)
- scientific article; zbMATH DE number 1220667 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- Hypothesis Testing in High-Dimensional Regression Under the Gaussian Random Design Model: Asymptotic Theory
- Least angle regression. (With discussion)
- Minimization of transformed L₁ penalty: theory, difference of convex function algorithm, and robust application in compressed sensing
- Multi-stage convex relaxation for feature selection
- Nearly unbiased variable selection under minimax concave penalty
- Nonconcave penalized likelihood with a diverging number of parameters.
- On asymptotically optimal confidence regions and tests for high-dimensional models
- On functions representable as a difference of convex functions
- On the pervasiveness of difference-convexity in optimization and statistics
- One-step sparse estimates in nonconcave penalized likelihood models
- Optimal computational and statistical rates of convergence for sparse nonconvex learning problems
- Sharp Thresholds for High-Dimensional and Noisy Sparsity Recovery Using $\ell _{1}$-Constrained Quadratic Programming (Lasso)
- Simultaneous analysis of Lasso and Dantzig selector
- SparseNet: coordinate descent with nonconvex penalties
- Statistics for high-dimensional data. Methods, theory and applications.
- Strong oracle optimality of folded concave penalized estimation
- The Adaptive Lasso and Its Oracle Properties
- The Concave-Convex Procedure
- The Dantzig selector: statistical estimation when \(p\) is much larger than \(n\). (With discussions and rejoinder).
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
Cited in
(3)
This page was built for publication: A unifying framework of high-dimensional sparse estimation with difference-of-convex (DC) regularizations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2163076)
