Pages that link to "Item:Q4265521"

The following pages link to Minimum-support solutions of polyhedral concave programs^* (Q4265521):

Displaying 17 items.

• A proximal method for composite minimization (Q304260) (← links)
• Recent advances in mathematical programming with semi-continuous variables and cardinality constraint (Q384213) (← links)
• Equivalence and strong equivalence between the sparsest and least \(\ell _1\)-norm nonnegative solutions of linear systems and their applications (Q489110) (← links)
• Equivalence of minimal \(\ell _{0}\)- and \(\ell _{p }\)-norm solutions of linear equalities, inequalities and linear programs for sufficiently small \(p\) (Q650241) (← links)
• Successive convex approximations to cardinality-constrained convex programs: a piecewise-linear DC approach (Q742312) (← links)
• Knapsack feasibility as an absolute value equation solvable by successive linear programming (Q1024724) (← links)
• A solution approach for cardinality minimization problem based on fractional programming (Q2168753) (← links)
• Sparse optimization in feature selection: application in neuroimaging (Q2250090) (← links)
• Minimal Multiset Grammars for Recurrent Dynamics (Q2975911) (← links)
• Constructing New Weighted <i>ℓ</i>₁-Algorithms for the Sparsest Points of Polyhedral Sets (Q2976140) (← links)
• Support vector machine classification with noisy data: a second order cone programming approach (Q3163026) (← links)
• Unsupervised classification via convex absolute value inequalities (Q4981845) (← links)
• Weak Stability of <i>ℓ</i>₁-Minimization Methods in Sparse Data Reconstruction (Q5219713) (← links)
• Combined SVM-based feature selection and classification (Q5896777) (← links)
• Combined SVM-based feature selection and classification (Q5920547) (← links)
• The Geometry of Sparse Analysis Regularization (Q6158006) (← links)
• Cardinality minimization, constraints, and regularization: a survey (Q6585278) (← links)