Subspace quadratic regularization method for group sparse multinomial logistic regression
From MaRDI portal
Publication:2044487
Recommendations
- Sparse group Lasso and high dimensional multinomial classification
- An extended Newton-type algorithm for \(\ell_2\)-regularized sparse logistic regression and its efficiency for classifying large-scale datasets
- A Subspace Acceleration Method for Minimization Involving a Group Sparsity-Inducing Regularizer
- Alternating direction method of multipliers for \(\ell_{1}\)-\(\ell_{2}\)-regularized logistic regression model
- An improved OWL-QN method for solving sparse logistic regression problems
Cites work
- scientific article; zbMATH DE number 3945130 (Why is no real title available?)
- A QP-free constrained Newton-type method for variational inequality problems
- An extended Newton-type algorithm for \(\ell_2\)-regularized sparse logistic regression and its efficiency for classifying large-scale datasets
- Block coordinate descent algorithms for large-scale sparse multiclass classification
- Computing a Trust Region Step
- Greedy sparsity-constrained optimization
- Group descent algorithms for nonconvex penalized linear and logistic regression models with grouped predictors
- Majorization-Minimization Algorithms in Signal Processing, Communications, and Machine Learning
- Multinomial logistic regression algorithm
- Numerical Optimization
- Optimization problems involving group sparsity terms
- Proximal Newton-type methods for minimizing composite functions
- Regression modeling strategies. With applications to linear models, logistic regression, and survival analysis
- Sparse Approximate Solutions to Linear Systems
- Sparse Multinomial Logistic Regression via Approximate Message Passing
- Sparse group Lasso and high dimensional multinomial classification
- Statistical Models
- Variable selection in general multinomial logit models
- Variational Analysis
Cited in
(9)- Sparse group Lasso and high dimensional multinomial classification
- A splitting augmented Lagrangian method embedding in the BB method for solving the sparse logistic problem
- Iteratively reweighted group Lasso based on log-composite regularization
- An extended Newton-type algorithm for \(\ell_2\)-regularized sparse logistic regression and its efficiency for classifying large-scale datasets
- Optimality conditions for Tucker low-rank tensor optimization
- \(\ell_{2,0}\)-norm based selection and estimation for multivariate generalized linear models
- Relaxation quadratic approximation greedy pursuit method based on sparse learning
- An improved OWL-QN method for solving sparse logistic regression problems
- A Subspace Acceleration Method for Minimization Involving a Group Sparsity-Inducing Regularizer
This page was built for publication: Subspace quadratic regularization method for group sparse multinomial logistic regression
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2044487)
