Concave programming for minimizing the zero-norm over polyhedral sets
From MaRDI portal
Publication:989849
DOI10.1007/s10589-008-9202-9zbMath1229.90170OpenAlexW2073875488MaRDI QIDQ989849
Francesco Rinaldi, Marco Sciandrone, Fabio Schoen
Publication date: 23 August 2010
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-008-9202-9
Related Items
New results on the equivalence between zero-one programming and continuous concave programming ⋮ A concave optimization-based approach for sparse portfolio selection ⋮ Global optimization for sparse solution of least squares problems ⋮ DC approximation approaches for sparse optimization ⋮ Supervised classification and mathematical optimization ⋮ The use of grossone in elastic net regularization and sparse support vector machines ⋮ A concave optimization-based approach for sparse multiobjective programming ⋮ Data filtering for cluster analysis by \(\ell _0\)-norm regularization ⋮ Local optimality for stationary points of group zero-norm regularized problems and equivalent surrogates ⋮ Zero-norm regularized problems: equivalent surrogates, proximal MM method and statistical error bound ⋮ Sparse optimization via vector \(k\)-norm and DC programming with an application to feature selection for support vector machines ⋮ Heuristics for Finding Sparse Solutions of Linear Inequalities ⋮ Sparse approximation over the cube ⋮ A smoothing method for sparse optimization over convex sets ⋮ Feasibility Pump-like heuristics for mixed integer problems ⋮ Frank-Wolfe and friends: a journey into projection-free first-order optimization methods ⋮ Solving \(\ell_0\)-penalized problems with simple constraints via the Frank-Wolfe reduced dimension method ⋮ On finding a generalized lowest rank solution to a linear semi-definite feasibility problem ⋮ The CONEstrip Algorithm ⋮ DC Approximation Approach for ℓ0-minimization in Compressed Sensing ⋮ An effective procedure for feature subset selection in logistic regression based on information criteria ⋮ Feature selection in SVM via polyhedral \(k\)-norm ⋮ Concave programming for finding sparse solutions to problems with convex constraints ⋮ Double regularization methods for robust feature selection and SVM classification via DC programming
Uses Software
Cites Work
- Unnamed Item
- On the approximability of minimizing nonzero variables or unsatisfied relations in linear systems
- Atomic Decomposition by Basis Pursuit
- An Algorithm for the Optimal Solution of Linear Inequalities and its Application to Pattern Recognition
- Stable recovery of sparse overcomplete representations in the presence of noise
- Sparse representations in unions of bases
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
- 10.1162/153244303322753616
- 10.1162/153244303322753751
This page was built for publication: Concave programming for minimizing the zero-norm over polyhedral sets
