Smoothing functions for sparse optimization: a unified framework
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3595804 (Why is no real title available?)
- scientific article; zbMATH DE number 4119957 (Why is no real title available?)
- $l_{q}$ Sparsity Penalized Linear Regression With Cyclic Descent
- A Fast Approach for Overcomplete Sparse Decomposition Based on Smoothed $\ell ^{0}$ Norm
- A Globally Convergent Successive Approximation Method for Severely Nonsmooth Equations
- A class of smoothing functions for nonlinear and mixed complementarity problems
- A smoothing trust-region Newton-CG method for minimax problem
- A smoothing-out technique for min—max optimization
- A switching regression method using inequality conditions
- Coordinate descent algorithms for nonconvex penalized regression, with applications to biological feature selection
- Fast Sparse Representation Based on Smoothed ℓ0 Norm
- Nearly unbiased variable selection under minimax concave penalty
- New smoothing approximations to piecewise smooth functions and applications
- Nondifferentiable optimization via smooth approximation: General analytical approach
- On Smoothing Exact Penalty Functions for Convex Constrained Optimization
- On a new smoothing technique for non-smooth, non-convex optimization
- Optimality conditions and a smoothing trust region Newton method for nonlipschitz optimization
- Quantile estimators with orthogonal pinball loss function
- Quantile regression.
- Smooth minimization of non-smooth functions
- Smoothed Functionals in Stochastic Optimization
- Smoothing and first order methods: a unified framework
- Smoothing approximations for some piecewise smooth functions
- Smoothing approximations to nonsmooth optimization problems
- Smoothing functions and smoothing Newton method for complementarity and variational inequality problems
- Smoothing methods for nonsmooth, nonconvex minimization
- Sparse Approximate Solutions to Linear Systems
- Stable restoration and separation of approximately sparse signals
- Super-Resolution With Sparse Mixing Estimators
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
This page was built for publication: Smoothing functions for sparse optimization: a unified framework
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7254847)