Continuous exact relaxation and alternating proximal gradient algorithm for partial sparse and partial group sparse optimization problems
From MaRDI portal
(Redirected from Publication:6569683)
Recommendations
- Solving constrained nonsmooth group sparse optimization via group Capped-\(\ell_1\) relaxation and group smoothing proximal gradient algorithm
- Difference-of-Convex Algorithms for a Class of Sparse Group \ell₀ Regularized Optimization Problems
- scientific article; zbMATH DE number 7594592
- Partial gradient optimal thresholding algorithms for a class of sparse optimization problems
- A smoothing proximal gradient algorithm with extrapolation for the relaxation of \({\ell_0}\) regularization problem
Cites work
- A continuous exact _0 penalty (CEL0) for least squares regularized problem
- A group bridge approach for variable selection
- A singular value shrinkage thresholding algorithm for folded concave penalized low-rank matrix optimization problems
- A unified view of exact continuous penalties for _2-_0 minimization
- Alternating structure-adapted proximal gradient descent for nonconvex nonsmooth block-regularized problems
- An efficient Hessian based algorithm for solving large-scale sparse group Lasso problems
- Analysis of multi-stage convex relaxation for sparse regularization
- Compressed Sensing With Nonlinear Observations and Related Nonlinear Optimization Problems
- Computation of second-order directional stationary points for group sparse optimization
- Computing B-stationary points of nonsmooth DC programs
- DC approximation approaches for sparse optimization
- Difference-of-Convex Algorithms for a Class of Sparse Group \ell₀ Regularized Optimization Problems
- Group descent algorithms for nonconvex penalized linear and logistic regression models with grouped predictors
- Group Sparse Optimization for Images Recovery Using Capped Folded Concave Functions
- Group sparse optimization via \(\ell_{p,q}\) regularization
- Group Sparse Recovery via the \ell ^0(\ell ^2) Penalty: Theory and Algorithm
- Group variable selection via \(\ell_{p,0}\) regularization and application to optimal scoring
- scientific article; zbMATH DE number 46303 (Why is no real title available?)
- Learning sparse classifiers with difference of convex functions algorithms
- Lower bound theory of nonzero entries in solutions of _2-_p minimization
- Model Selection and Estimation in Regression with Grouped Variables
- Nearly unbiased variable selection under minimax concave penalty
- On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
- Optimality and complexity for constrained optimization problems with nonconvex regularization
- Probing the Pareto frontier for basis pursuit solutions
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- Smoothing composite proximal gradient algorithm for sparse group Lasso problems with nonsmooth loss functions
- Solution sets of three sparse optimization problems for multivariate regression
- Solving constrained nonsmooth group sparse optimization via group Capped-\(\ell_1\) relaxation and group smoothing proximal gradient algorithm
- Statistical challenges with high dimensionality: feature selection in knowledge discovery
- The \(\ell_{2,q}\) regularized group sparse optimization: lower bound theory, recovery bound and algorithms
- The benefit of group sparsity
- The composite absolute penalties family for grouped and hierarchical variable selection
- The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
Cited in
(1)
This page was built for publication: Continuous exact relaxation and alternating proximal gradient algorithm for partial sparse and partial group sparse optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6569683)
