Pages that link to "Item:Q890292"

The following pages link to Feature selection in machine learning: an exact penalty approach using a difference of convex function algorithm (Q890292):

Displaying 32 items.

• DC approximation approaches for sparse optimization (Q319281) (← links)
• DCA based algorithms for feature selection in multi-class support vector machine (Q513636) (← links)
• Double regularization methods for robust feature selection and SVM classification via DC programming (Q781867) (← links)
• Feature selection for linear SVMs under uncertain data: robust optimization based on difference of convex functions algorithms (Q889303) (← links)
• Difference of convex functions algorithms (DCA) for image restoration via a Markov random field model (Q1642987) (← links)
• DC programming and DCA for solving Brugnano-Casulli piecewise linear systems (Q1652418) (← links)
• Cost-sensitive feature selection for support vector machines (Q1734839) (← links)
• DC programming and DCA: thirty years of developments (Q1749443) (← links)
• A unified Douglas-Rachford algorithm for generalized DC programming (Q2114583) (← links)
• A truncated Newton algorithm for nonconvex sparse recovery (Q2143093) (← links)
• Phase-only transmit beampattern design for large phased array antennas with multi-point nulling (Q2146523) (← links)
• Reproducing kernels and choices of associated feature spaces, in the form of \(L^2\)-spaces (Q2235966) (← links)
• Feature selection in SVM via polyhedral \(k\)-norm (Q2300635) (← links)
• A DC programming approach for feature selection in support vector machines learning (Q2442767) (← links)
• A unified DC programming framework and efficient DCA based approaches for large scale batch reinforcement learning (Q2633537) (← links)
• Learning sparse classifiers with difference of convex functions algorithms (Q2867410) (← links)
• A Continuous Exact $\ell_0$ Penalty (CEL0) for Least Squares Regularized Problem (Q3192668) (← links)
• A model-free variable selection method for reducing the number of redundant variables (Q4559351) (← links)
• Convex Optimization for Group Feature Selection in Networked Data (Q5139860) (← links)
• A new approach for solving mixed integer DC programs using a continuous relaxation with no integrality gap and smoothing techniques (Q5151528) (← links)
• A DC Programming Approach for Sparse Estimation of a Covariance Matrix (Q5356977) (← links)
• A Unified View of Exact Continuous Penalties for $\ell_2$-$\ell_0$ Minimization (Q5359501) (← links)
• Efficient Nonnegative Matrix Factorization by DC Programming and DCA (Q5380443) (← links)
• Sparse Covariance Matrix Estimation by DCA-Based Algorithms (Q5380866) (← links)
• Group Sparse Optimization for Images Recovery Using Capped Folded Concave Functions (Q5860273) (← links)
• Zero-norm regularized problems: equivalent surrogates, proximal MM method and statistical error bound (Q6051308) (← links)
• MAP inference algorithms without approximation for collective graphical models on path graphs via discrete difference of convex algorithm (Q6097141) (← links)
• Sum-of-squares relaxations in robust DC optimization and feature selection (Q6142071) (← links)
• Open issues and recent advances in DC programming and DCA (Q6200375) (← links)
• Sparse \(L_0\)-norm least squares support vector machine with feature selection (Q6544594) (← links)
• Estimation of \(l_0\) norm penalized models: a statistical treatment (Q6554254) (← links)
• Solving a centralized dynamic group key management problem by an optimization approach (Q6629060) (← links)