On the convergence of inexact alternate minimization in problems with _0 penalties
From MaRDI portal
(Redirected from On the convergence of inexact alternate minimization in problems with _0 penalties)
On the convergence of inexact alternate minimization in problems with \(\ell 0\) penalties
On the convergence of inexact alternate minimization in problems with \(\ell 0\) penalties
Recommendations
- The analysis of alternating minimization method for double sparsity constrained optimization problem
- Convergent inexact penalty decomposition methods for cardinality-constrained problems
- On optimal solutions of the constrained \({\ell}_{0}\) regularization and its penalty problem
- Convergence of alternating direction method for minimizing sum of two nonconvex functions with linear constraints
- Sparse Approximation via Penalty Decomposition Methods
Cites work
- 10.1162/153244303322753751
- A mathematical introduction to compressive sensing
- An effective procedure for feature subset selection in logistic regression based on information criteria
- An efficient optimization approach for best subset selection in linear regression, with application to model selection and fitting in autoregressive time-series
- Best subset selection via a modern optimization lens
- Convergent decomposition techniques for training RBF neural networks
- Convergent inexact penalty decomposition methods for cardinality-constrained problems
- CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization
- Globally convergent block-coordinate techniques for unconstrained optimization
- scientific article; zbMATH DE number 1818892 (Why is no real title available?)
- scientific article; zbMATH DE number 6508162 (Why is no real title available?)
- Iterative hard thresholding for compressed sensing
- Meshfree approximation methods with Matlab. With CD-ROM.
- On the limited memory BFGS method for large scale optimization
- Optimization with sparsity-inducing penalties
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- Sparse Approximation via Penalty Decomposition Methods
This page was built for publication: On the convergence of inexact alternate minimization in problems with \(\ell_0\) penalties
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6559515)
