Nonconvex regularizer and homotopy-based sparse optimization: convergent algorithms and applications
From MaRDI portal
Cites work
- A continuous exact _0 penalty (CEL0) for least squares regularized problem
- A coordinate gradient descent method for nonsmooth separable minimization
- A fast algorithm for sparse reconstruction based on shrinkage, subspace optimization, and continuation
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A highly efficient semismooth Newton augmented Lagrangian method for solving lasso problems
- A primal dual active set with continuation algorithm for the \(\ell^0\)-regularized optimization problem
- A proximal-gradient homotopy method for the sparse least-squares problem
- Alternating direction algorithms for \(\ell_1\)-problems in compressive sensing
- Analysis of multi-stage convex relaxation for sparse regularization
- Complexity of unconstrained \(L_2 - L_p\) minimization
- Convex optimization algorithms
- DC formulations and algorithms for sparse optimization problems
- Exact penalty decomposition method for zero-norm minimization based on MPEC formulation
- Fixed-Point Continuation for \ell₁-Minimization: Methodology and Convergence
- Global and quadratic convergence of Newton hard-thresholding pursuit
- Gradient methods for minimizing composite functions
- Greedy sparsity-constrained optimization
- Group Sparse Optimization for Images Recovery Using Capped Folded Concave Functions
- Group Sparse Recovery via the \ell ^0(\ell ^2) Penalty: Theory and Algorithm
- Iterative thresholding for sparse approximations
- Iteratively weighted thresholding homotopy method for the sparse solution of underdetermined linear equations
- Nearly unbiased variable selection under minimax concave penalty
- Optimization problems involving group sparsity terms
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- Sparse Approximate Solutions to Linear Systems
- Sparse Approximation via Penalty Decomposition Methods
- Sparse Recovery via Partial Regularization: Models, Theory, and Algorithms
- Two-Point Step Size Gradient Methods
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- Variational Analysis
- Weighted thresholding homotopy method for sparsity constrained optimization
This page was built for publication: Nonconvex regularizer and homotopy-based sparse optimization: convergent algorithms and applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6854838)
