Accelerated gradient methods for sparse statistical learning with nonconvex penalties
From MaRDI portal
Publication:6494394
DOI10.1007/S11222-023-10371-8MaRDI QIDQ6494394
Unnamed Author, Masoud Asgharian, Kai Yang
Publication date: 30 April 2024
Published in: Statistics and Computing (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Coordinate descent algorithms for nonconvex penalized regression, with applications to biological feature selection
- Nearly unbiased variable selection under minimax concave penalty
- A modified local quadratic approximation algorithm for penalized optimization problems
- Accelerated gradient methods for nonconvex nonlinear and stochastic programming
- Gradient methods for minimizing composite functions
- An optimal method for stochastic composite optimization
- One-step sparse estimates in nonconcave penalized likelihood models
- Introductory lectures on convex optimization. A basic course.
- Cyclic seesaw process for optimization and identification
- Convergence rates for optimised adaptive importance samplers
- Non-concave penalization in linear mixed-effect models and regularized selection of fixed effects
- Calibrating nonconvex penalized regression in ultra-high dimension
- Pathwise coordinate optimization
- SparseNet: Coordinate Descent With Nonconvex Penalties
- Eigenvalues and Condition Numbers of Random Matrices
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- First-Order Methods in Optimization
- Regularization and Variable Selection Via the Elastic Net
- Smoothly Clipped Absolute Deviation on High Dimensions
- A fast unified algorithm for solving group-lasso penalize learning problems
This page was built for publication: Accelerated gradient methods for sparse statistical learning with nonconvex penalties
