Learning sparse classifiers with difference of convex functions algorithms
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 5968873
- Feature selection in machine learning: an exact penalty approach using a difference of convex function algorithm
- Difference-of-convex learning: directional stationarity, optimality, and sparsity
- D.C. programming for sparse proximal support vector machines
- A DC programming approach for sparse linear discriminant analysis
Cites work
- 10.1162/153244303322753616
- A bilinear formulation for vector sparsity optimization
- A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
- A DC programming approach for feature selection in support vector machines learning
- Combined SVM-based feature selection and classification
- Lasso-type recovery of sparse representations for high-dimensional data
- Massive data discrimination via linear support vector machines
- Multicategory ψ-Learning
- Optimization based DC programming and DCA for hierarchical clustering
- Recovering Sparse Signals With a Certain Family of Nonconvex Penalties and DC Programming
- Robust Truncated Hinge Loss Support Vector Machines
- The Concave-Convex Procedure
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
Cited in
(26)- DC programming and DCA: thirty years of developments
- Minimization of transformed L₁ penalty: theory, difference of convex function algorithm, and robust application in compressed sensing
- Sparse signal recovery via generalized Gaussian function
- Group variable selection via \(\ell_{p,0}\) regularization and application to optimal scoring
- Minimizing a sum of clipped convex functions
- Solution methodologies for minimizing a sum of pointwise minima of two functions
- DC approximation approach for \(\ell_0\)-minimization in compressed sensing
- A method for reducing the number of support vectors in fuzzy support vector machine
- DC approximation approaches for sparse optimization
- DC programming and DCA for general DC programs
- DCA based algorithms for feature selection in multi-class support vector machine
- Stochastic DCA for sparse multiclass logistic regression
- Difference-of-convex learning: directional stationarity, optimality, and sparsity
- Sparse covariance matrix estimation by DCA-based algorithms
- A DC Programming Approach for Finding Communities in Networks
- Classification using a sparse combination of basis functions
- Sparse reconstruction via the mixture optimization model with iterative support estimate
- Neural network for a class of sparse optimization with L₀-regularization
- Unified SVM algorithm based on LS-DC loss
- Open issues and recent advances in DC programming and DCA
- Sparse \(L_0\)-norm least squares support vector machine with feature selection
- Continuous exact relaxation and alternating proximal gradient algorithm for partial sparse and partial group sparse optimization problems
- Cardinality objective nonlinear programs for facility capacity expansion
- Feature selection for linear SVMs under uncertain data: robust optimization based on difference of convex functions algorithms
- Feature selection in machine learning: an exact penalty approach using a difference of convex function algorithm
- A bilinear formulation for vector sparsity optimization
This page was built for publication: Learning sparse classifiers with difference of convex functions algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2867410)
