Concave programming for minimizing the zero-norm over polyhedral sets
From MaRDI portal
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
- scientific article; zbMATH DE number 1215260 (Why is no real title available?)
- 10.1162/153244303322753616
- 10.1162/153244303322753751
- An Algorithm for the Optimal Solution of Linear Inequalities and its Application to Pattern Recognition
- Atomic decomposition by basis pursuit
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
- On the approximability of minimizing nonzero variables or unsatisfied relations in linear systems
- Sparse representations in unions of bases
- Stable recovery of sparse overcomplete representations in the presence of noise
Cited in
(31)- Feasibility Pump-like heuristics for mixed integer problems
- Sparse optimization via vector \(k\)-norm and DC programming with an application to feature selection for support vector machines
- 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
- The use of grossone in elastic net regularization and sparse support vector machines
- Heuristics for Finding Sparse Solutions of Linear Inequalities
- 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
- Double regularization methods for robust feature selection and SVM classification via DC programming
- Data filtering for cluster analysis by \(\ell _0\)-norm regularization
- Concave Minimization Via Collapsing Polytopes
- Sparse approximation over the cube
- 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
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)
