Solving nonnegative sparsity-constrained optimization via DC quadratic-piecewise-linear approximations
From MaRDI portal
Publication:2052409
Recommendations
- DC approximation approaches for sparse optimization
- Sparsity constrained nonlinear optimization: optimality conditions and algorithms
- An inexact successive quadratic approximation method for a class of difference-of-convex optimization problems
- A gradient projection algorithm with a new stepsize for nonnegative sparsity-constrained optimization
- A successive convex approximation approach for sparse solutions of convex programs
Cites work
- A proximal difference-of-convex algorithm with extrapolation
- A successive difference-of-convex approximation method for a class of nonconvex nonsmooth optimization problems
- An introduction to nonsmooth analysis
- Benchmarking optimization software with performance profiles.
- Best subset selection via a modern optimization lens
- Bilinear separation of two sets in n-space
- Covariance-Preconditioned Iterative Methods for Nonnegatively Constrained Astronomical Imaging
- DC approximation approaches for sparse optimization
- DC formulations and algorithms for sparse optimization problems
- Difference-of-convex learning: directional stationarity, optimality, and sparsity
- Enhanced proximal DC algorithms with extrapolation for a class of structured nonsmooth DC minimization
- ExtraPush for convex smooth decentralized optimization over directed networks
- Feature selection in SVM via polyhedral \(k\)-norm
- Introduction to nonsmooth optimization. Theory, practice and software
- Introductory lectures on convex optimization. A basic course.
- Linear best approximation using a class of polyhedral norms
- Minimizing Piecewise-Concave Functions Over Polyhedra
- Minimizing nonsmooth DC functions via successive DC piecewise-affine approximations
- Non-negative least squares for high-dimensional linear models: consistency and sparse recovery without regularization
- Nonmonotone enhanced proximal DC algorithms for a class of structured nonsmooth DC programming
- Nonnegative-Lasso and application in index tracking
- Perfect Recovery Conditions for Non-negative Sparse Modeling
- Robust investment strategies with discrete asset choice constraints using DC programming
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Simultaneous pursuit of out-of-sample performance and sparsity in index tracking portfolios
- Sparse Approximate Solutions to Linear Systems
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
- Two-Point Step Size Gradient Methods
Cited in
(3)
This page was built for publication: Solving nonnegative sparsity-constrained optimization via DC quadratic-piecewise-linear approximations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2052409)
