Solving nonnegative sparsity-constrained optimization via DC quadratic-piecewise-linear approximations
From MaRDI portal
Publication:2052409
DOI10.1007/s10898-021-01028-9zbMath1481.90293OpenAlexW3158183392MaRDI QIDQ2052409
Publication date: 26 November 2021
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-021-01028-9
global convergencepiecewise-linear approximationsnonnegative sparsity-constrained optimizationpenalized DC formulation
Related Items (1)
Cites Work
- Unnamed Item
- Best subset selection via a modern optimization lens
- DC approximation approaches for sparse optimization
- Non-negative least squares for high-dimensional linear models: consistency and sparse recovery without regularization
- Simultaneous pursuit of out-of-sample performance and sparsity in index tracking portfolios
- Linear best approximation using a class of polyhedral norms
- Bilinear separation of two sets in \(n\)-space
- Introductory lectures on convex optimization. A basic course.
- Nonnegative-Lasso and application in index tracking
- A proximal difference-of-convex algorithm with extrapolation
- DC formulations and algorithms for sparse optimization problems
- Minimizing nonsmooth DC functions via successive DC piecewise-affine approximations
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
- Feature selection in SVM via polyhedral \(k\)-norm
- A successive difference-of-convex approximation method for a class of nonconvex nonsmooth optimization problems
- Enhanced proximal DC algorithms with extrapolation for a class of structured nonsmooth DC minimization
- Introduction to Nonsmooth Optimization
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Robust investment strategies with discrete asset choice constraints using DC programming
- Two-Point Step Size Gradient Methods
- Perfect Recovery Conditions for Non-negative Sparse Modeling
- Extrapush for Convex Smooth Decentralized Optimization Over Directed Networks
- Sparse Approximate Solutions to Linear Systems
- Minimizing Piecewise-Concave Functions Over Polyhedra
- Nonmonotone Enhanced Proximal DC Algorithms for a Class of Structured Nonsmooth DC Programming
- Difference-of-Convex Learning: Directional Stationarity, Optimality, and Sparsity
- Covariance-Preconditioned Iterative Methods for Nonnegatively Constrained Astronomical Imaging
- Benchmarking optimization software with performance profiles.
This page was built for publication: Solving nonnegative sparsity-constrained optimization via DC quadratic-piecewise-linear approximations
