A successive convex approximation approach for sparse solutions of convex programs
From MaRDI portal
Recommendations
- DC approximation approaches for sparse optimization
- Successive convex approximations to cardinality-constrained convex programs: a piecewise-linear DC approach
- Sparse Approximation via Penalty Decomposition Methods
- DC approximation approach for \(\ell_0\)-minimization in compressed sensing
- Complementarity formulations of \(\ell_0\)-norm optimization
Cited in
(8)- DC approximation approach for \(\ell_0\)-minimization in compressed sensing
- Solving nonnegative sparsity-constrained optimization via DC quadratic-piecewise-linear approximations
- Sparse convex optimization toolkit: a mixed-integer framework
- Successive element correction algorithms for sparse unconstrained optimization
- DC approximation approaches for sparse optimization
- Solving highly nonlinear convex separable programs using successive approximation
- Concave programming for finding sparse solutions to problems with convex constraints
- Successive convex approximations to cardinality-constrained convex programs: a piecewise-linear DC approach
This page was built for publication: A successive convex approximation approach for sparse solutions of convex programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5402622)
