Solving nonnegative sparsity-constrained optimization via DC quadratic-piecewise-linear approximations
type: Item
instance of: scholarly article
title: Solving nonnegative sparsity-constrained optimization via DC quadratic-piecewise-linear approximations
zbMATH Open document ID: 1481.90293
author: Chungen Shen
author: Xiao Liu
published in: Journal of Global Optimization
publication date: 2021-11-26T00:00:00Z
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 90C26
zbMATH DE Number: 7433947
zbMATH Keywords: nonnegative sparsity-constrained optimization
zbMATH Keywords: penalized DC formulation
zbMATH Keywords: piecewise-linear approximations
zbMATH Keywords: global convergence
MaRDI profile type: Publication
full work available at URL: s10898-021-01028-9
OpenAlex ID: W3158183392
cites work: Difference-of-Convex Learning: Directional Stationarity, Optimality, and Sparsity
cites work: Introduction to Nonsmooth Optimization
cites work: Covariance-Preconditioned Iterative Methods for Nonnegatively Constrained Astronomical Imaging
cites work: Two-Point Step Size Gradient Methods
cites work: Bilinear separation of two sets in \(n\)-space
cites work: Best subset selection via a modern optimization lens
cites work: Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
cites work: Benchmarking optimization software with performance profiles.
cites work: An introduction to nonsmooth analysis
cites work: Minimizing Piecewise-Concave Functions Over Polyhedra
cites work: Minimizing nonsmooth DC functions via successive DC piecewise-affine approximations
cites work: Feature selection in SVM via polyhedral \(k\)-norm
cites work: DC formulations and algorithms for sparse optimization problems
cites work: Robust investment strategies with discrete asset choice constraints using DC programming
cites work: Perfect Recovery Conditions for Non-negative Sparse Modeling
cites work: The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
cites work: DC approximation approaches for sparse optimization
cites work: A successive difference-of-convex approximation method for a class of nonconvex nonsmooth optimization problems
cites work: Nonmonotone Enhanced Proximal DC Algorithms for a Class of Structured Nonsmooth DC Programming
cites work: Enhanced proximal DC algorithms with extrapolation for a class of structured nonsmooth DC minimization
cites work: Sparse Approximate Solutions to Linear Systems
cites work: Introductory lectures on convex optimization. A basic course.
cites work: Non-negative least squares for high-dimensional linear models: consistency and sparse recovery without regularization
cites work: Simultaneous pursuit of out-of-sample performance and sparsity in index tracking portfolios
cites work: Linear best approximation using a class of polyhedral norms
cites work: A proximal difference-of-convex algorithm with extrapolation
cites work: Nonnegative-Lasso and application in index tracking
cites work: Extrapush for Convex Smooth Decentralized Optimization Over Directed Networks
DOI: 10.1007/S10898-021-01028-9
description: scientific article; zbMATH DE number 7433947