L₁-norm regularized indefinite kernel logistic regression
From MaRDI portal
\(L 1\)-norm regularized indefinite kernel logistic regression
Cites work
- A feature selection Newton method for support vector machine classification
- A production-transportation problem with stochastic demand and concave production costs
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- DC programming and DCA: thirty years of developments
- Global convergence of a proximal linearized algorithm for difference of convex functions
- scientific article; zbMATH DE number 1804115 (Why is no real title available?)
- scientific article; zbMATH DE number 2076851 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- scientific article; zbMATH DE number 6438182 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- Indefinite proximity learning: a review
- Large margin classification with indefinite similarities
- Multi-Modal Curriculum Learning for Semi-Supervised Image Classification
- Regularization networks and support vector machines
- Solution of the multisource Weber and conditional Weber problems by d. -c. programming
- Sparse kernel logistic regression based on L 1/2 regularization
- Stable signal recovery from incomplete and inaccurate measurements
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
This page was built for publication: \(L_1\)-norm regularized indefinite kernel logistic regression
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7314257)
