Concave programming for minimizing the zero-norm over polyhedral sets
From MaRDI portal
Publication:989849
DOI10.1007/S10589-008-9202-9zbMATH Open1229.90170OpenAlexW2073875488MaRDI QIDQ989849FDOQ989849
Authors: F. Rinaldi, Fabio Schoen, Marco Sciandrone 
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
Recommendations
- A smoothing method for sparse optimization over polyhedral sets
- Minimum-support solutions of polyhedral concave programs*
- A smoothing method for sparse optimization over convex sets
- scientific article; zbMATH DE number 1215260
- A concave optimization-based approach for sparse multiobjective programming
Cites Work
- 10.1162/153244303322753616
- Stable recovery of sparse overcomplete representations in the presence of noise
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
- Sparse representations in unions of bases
- Atomic decomposition by basis pursuit
- 10.1162/153244303322753751
- Title not available (Why is that?)
- On the approximability of minimizing nonzero variables or unsatisfied relations in linear systems
- An Algorithm for the Optimal Solution of Linear Inequalities and its Application to Pattern Recognition
Cited In (31)
- Feasibility Pump-like heuristics for mixed integer problems
- Zonotopes and the LP-Newton method
- Supervised classification and mathematical optimization
- Normal cones to a polyhedral convex set and generating efficient faces in linear multiobjective programming
- Dual formulation of the sparsity constrained optimization problem: application to classification
- A concave optimization-based approach for sparse portfolio selection
- New results on the equivalence between zero-one programming and continuous concave programming
- Global optimization for sparse solution of least squares problems
- DC approximation approach for \(\ell_0\)-minimization in compressed sensing
- 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
- Domain Contraction in Nonlinear Programming: Minimizing a Quadratic Concave Objective Over a Polyhedron
- Heuristics for Finding Sparse Solutions of Linear Inequalities
- The use of grossone in elastic net regularization and sparse support vector machines
- DC approximation approaches for sparse optimization
- Normal conical algorithm for concave minimization over polytopes
- An effective procedure for feature subset selection in logistic regression based on information criteria
- Solving \(\ell_0\)-penalized problems with simple constraints via the Frank-Wolfe reduced dimension method
- Concave programming for finding sparse solutions to problems with convex constraints
- A concave optimization-based approach for sparse multiobjective programming
- Feature selection in SVM via polyhedral \(k\)-norm
- Data filtering for cluster analysis by \(\ell _0\)-norm regularization
- Double regularization methods for robust feature selection and SVM classification via DC programming
- Sparse approximation over the cube
- Concave Minimization Via Collapsing Polytopes
- A smoothing method for sparse optimization over convex sets
- On finding a generalized lowest rank solution to a linear semi-definite feasibility problem
- Frank-Wolfe and friends: a journey into projection-free first-order optimization methods
- The CONEstrip algorithm
- A smoothing method for sparse optimization over polyhedral sets
- Sparse optimization via vector \(k\)-norm and DC programming with an application to feature selection for support vector machines
Uses Software
This page was built for publication: Concave programming for minimizing the zero-norm over polyhedral sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q989849)
