Pages that link to "Item:Q989849"
From MaRDI portal
The following pages link to Concave programming for minimizing the zero-norm over polyhedral sets (Q989849):
Displaying 29 items.
- DC approximation approaches for sparse optimization (Q319281) (← links)
- Supervised classification and mathematical optimization (Q339559) (← links)
- Double regularization methods for robust feature selection and SVM classification via DC programming (Q781867) (← links)
- Zonotopes and the LP-Newton method (Q833464) (← links)
- New results on the equivalence between zero-one programming and continuous concave programming (Q839801) (← links)
- Normal conical algorithm for concave minimization over polytopes (Q1177231) (← links)
- Normal cones to a polyhedral convex set and generating efficient faces in linear multiobjective programming (Q1577616) (← links)
- Data filtering for cluster analysis by \(\ell _0\)-norm regularization (Q1686543) (← links)
- On finding a generalized lowest rank solution to a linear semi-definite feasibility problem (Q1785372) (← links)
- An effective procedure for feature subset selection in logistic regression based on information criteria (Q2044566) (← links)
- The use of grossone in elastic net regularization and sparse support vector machines (Q2156901) (← links)
- A concave optimization-based approach for sparse multiobjective programming (Q2174899) (← links)
- A smoothing method for sparse optimization over convex sets (Q2191281) (← links)
- Frank-Wolfe and friends: a journey into projection-free first-order optimization methods (Q2240671) (← links)
- Solving \(\ell_0\)-penalized problems with simple constraints via the Frank-Wolfe reduced dimension method (Q2257078) (← links)
- Feature selection in SVM via polyhedral \(k\)-norm (Q2300635) (← links)
- Feasibility Pump-like heuristics for mixed integer problems (Q2448898) (← links)
- The CONEstrip Algorithm (Q2805768) (← links)
- DC Approximation Approach for ℓ0-minimization in Compressed Sensing (Q2808067) (← links)
- A concave optimization-based approach for sparse portfolio selection (Q2905343) (← links)
- Concave programming for finding sparse solutions to problems with convex constraints (Q3096890) (← links)
- Concave Minimization Via Collapsing Polytopes (Q3770289) (← links)
- Domain Contraction in Nonlinear Programming: Minimizing a Quadratic Concave Objective Over a Polyhedron (Q3978620) (← links)
- Global optimization for sparse solution of least squares problems (Q5058393) (← links)
- Local optimality for stationary points of group zero-norm regularized problems and equivalent surrogates (Q6051201) (← links)
- Zero-norm regularized problems: equivalent surrogates, proximal MM method and statistical error bound (Q6051308) (← links)
- Sparse optimization via vector \(k\)-norm and DC programming with an application to feature selection for support vector machines (Q6051312) (← links)
- Heuristics for Finding Sparse Solutions of Linear Inequalities (Q6053490) (← links)
- Dual formulation of the sparsity constrained optimization problem: application to classification (Q6585821) (← links)
