A comparison of optimization methods and software for large-scale L1-regularized linear classifi\-cation
From MaRDI portal
Recommendations
- An interior-point method for large-scale l₁-regularized logistic regression
- Coordinate descent method for large-scale L2-loss linear support vector machines
- Block coordinate descent algorithms for large-scale sparse multiclass classification
- Survey of solving the optimization problems for sparse learning
- A distributed block coordinate descent method for training l₁ regularized linear classifiers
Cited in
(40)- Natural coordinate descent algorithm for \(\ell_1\)-penalised regression in generalised linear models
- Sparse and kernel OPLS feature extraction based on eigenvalue problem solving
- Feature selection and tumor classification for microarray data using relaxed Lasso and generalized multi-class support vector machine
- A family of inexact SQA methods for non-smooth convex minimization with provable convergence guarantees based on the Luo-Tseng error bound property
- Proximal quasi-Newton methods for regularized convex optimization with linear and accelerated sublinear convergence rates
- ADMM-softmax: an ADMM approach for multinomial logistic regression
- An extended Newton-type algorithm for \(\ell_2\)-regularized sparse logistic regression and its efficiency for classifying large-scale datasets
- A decomposition method for Lasso problems with zero-sum constraint
- Hybrid MPI/OpenMP parallel asynchronous distributed alternating direction method of multipliers
- A two-step fixed-point proximity algorithm for a class of non-differentiable optimization models in machine learning
- Performance of first- and second-order methods for _1-regularized least squares problems
- A random block-coordinate Douglas-Rachford splitting method with low computational complexity for binary logistic regression
- Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function
- A fast active set block coordinate descent algorithm for _1-regularized least squares
- A multilevel framework for sparse optimization with application to inverse covariance estimation and logistic regression
- An inexact successive quadratic approximation method for L-1 regularized optimization
- Coordinate descent method for large-scale L2-loss linear support vector machines
- LIBLINEAR: a library for large linear classification
- An interior-point method for large-scale l₁-regularized logistic regression
- Practical inexact proximal quasi-Newton method with global complexity analysis
- Block coordinate descent algorithms for large-scale sparse multiclass classification
- scientific article; zbMATH DE number 6982986 (Why is no real title available?)
- A distributed block coordinate descent method for training l₁ regularized linear classifiers
- Nonmonotone Barzilai-Borwein gradient algorithm for \(\ell_1\)-regularized nonsmooth minimization in compressive sensing
- scientific article; zbMATH DE number 7626751 (Why is no real title available?)
- An iterative reduction FISTA algorithm for large-scale LASSO
- Convex optimization for group feature selection in networked data
- Survey of solving the optimization problems for sparse learning
- Stochastic proximal quasi-Newton methods for non-convex composite optimization
- An efficient proximal block coordinate homotopy method for large-scale sparse least squares problems
- A fast conjugate gradient algorithm with active set prediction for ℓ1 optimization
- Cyclic coordinate-update algorithms for fixed-point problems: analysis and applications
- An improved GLMNET for L1-regularized logistic regression
- Structured sparsity through convex optimization
- A reduced half thresholding algorithm
- Feature screening strategy for non-convex sparse logistic regression with log sum penalty
- Cardinality minimization, constraints, and regularization: a survey
- Sparse SVM with hard-margin loss: a Newton-augmented Lagrangian method in reduced dimensions
- A unified framework for solving ill-posed problems using regularized conjugate gradient, Broyden-Fletcher-Goldfarb-Shanno (BFGS), and limited-memory BFGS
- A note on the generalized Hessian of the least squares associated with systems of linear inequalities
This page was built for publication: A comparison of optimization methods and software for large-scale L1-regularized linear classifi\-cation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2896183)
