An interior-point method for large-scale l₁-regularized logistic regression
From MaRDI portal
Publication:3174129
Recommendations
- A fast hybrid algorithm for large-scale \(l_{1}\)-regularized logistic regression
- A comparison of optimization methods and software for large-scale L1-regularized linear classifi\-cation
- Alternating direction method of multipliers for \(\ell_{1}\)-\(\ell_{2}\)-regularized logistic regression model
- An interior point method for \(L_{1 / 2}\)-SVM and application to feature selection in classification
- Tuning parameter calibration for _1-regularized logistic regression
Cited in
(82)- ℓ1 Regularization in Infinite Dimensional Feature Spaces
- A Trust-region Method for Nonsmooth Nonconvex Optimization
- Kernel logistic regression using truncated Newton method
- A linearly convergent algorithm without prior knowledge of operator norms for solving \(\ell_1 - \ell_2\) minimization
- A regularized interior-point method for constrained linear least squares
- Space alternating penalized Kullback proximal point algorithms for maximizing likelihood with nondifferentiable penalty
- Sparse optimization in feature selection: application in neuroimaging
- Gap safe screening rules for sparsity enforcing penalties
- Copula density estimation by finite mixture of parametric copula densities
- APPLE: approximate path for penalized likelihood estimators
- Alternating direction method of multipliers with variable metric indefinite proximal terms for convex optimization
- Block coordinate proximal gradient methods with variable Bregman functions for nonsmooth separable optimization
- On the local convergence of a stochastic semismooth Newton method for nonsmooth nonconvex optimization
- Dimension reduction and variable selection in case control studies via regularized likelihood optimization
- An extended Newton-type algorithm for \(\ell_2\)-regularized sparse logistic regression and its efficiency for classifying large-scale datasets
- Nonmonotone enhanced proximal DC algorithms for a class of structured nonsmooth DC programming
- A relaxed interior point method for low-rank semidefinite programming problems with applications to matrix completion
- Coordinate ascent for penalized semiparametric regression on high-dimensional panel count data
- Building up a robust risk mathematical platform to predict colorectal cancer
- Optimizing optimization: accurate detection of hidden interactions in active body systems from noisy data
- ADMM-softmax: an ADMM approach for multinomial logistic regression
- Gene selection and prediction for cancer classification using support vector machines with a reject option
- Smoothing strategy along with conjugate gradient algorithm for signal reconstruction
- A multilevel framework for sparse optimization with application to inverse covariance estimation and logistic regression
- Inexact proximal memoryless quasi-Newton methods based on the Broyden family for minimizing composite functions
- Globalized inexact proximal Newton-type methods for nonconvex composite functions
- Multinomial regression with elastic net penalty and its grouping effect in gene selection
- Optimality conditions for sparse nonlinear programming
- A coordinate gradient descent method for \(\ell_{1}\)-regularized convex minimization
- Iterative reweighted minimization methods for \(l_p\) regularized unconstrained nonlinear programming
- Sparse Logistic Regression with Lp Penalty for Biomarker Identification
- Weighted thresholding homotopy method for sparsity constrained optimization
- Another look at linear programming for feature selection via methods of regularization
- Spatial general autoregressive model-based image interpolation accommodates arbitrary scale factors
- Inexact primal-dual gradient projection methods for nonlinear optimization on convex set
- Sequence-based prediction of protein-protein interaction sites with L1-logreg classifier
- Mixed linear system estimation and identification
- Restricted Robinson constraint qualification and optimality for cardinality-constrained cone programming
- Estimating time-varying networks
- Feature subset selection for logistic regression via mixed integer optimization
- A pseudo-heuristic parameter selection rule for \(l^1\)-regularized minimization problems
- Tuning parameter calibration for \(\ell_1\)-regularized logistic regression
- Trust region Newton method for logistic regression
- A comparison of optimization methods and software for large-scale L1-regularized linear classifi\-cation
- A fast hybrid algorithm for large-scale \(l_{1}\)-regularized logistic regression
- Accelerating cross-validation in multinomial logistic regression with \(\ell_1\)-regularization
- An inexact proximal generalized alternating direction method of multipliers
- High-dimensional Ising model selection using \(\ell _{1}\)-regularized logistic regression
- Sparse Recovery via Partial Regularization: Models, Theory, and Algorithms
- Recovering occlusion boundaries from an image
- MLSLR: multilabel learning via sparse logistic regression
- Support vector machines based on convex risk functions and general norms
- Recovery of seismic wavefields by an \(l_{q}\)-norm constrained regularization method
- A partially inexact proximal alternating direction method of multipliers and its iteration-complexity analysis
- Logistic regression: from art to science
- Incrementally updated gradient methods for constrained and regularized optimization
- Nonmonotone Barzilai-Borwein gradient algorithm for \(\ell_1\)-regularized nonsmooth minimization in compressive sensing
- Dimensionality reduction for density ratio estimation in high-dimensional spaces
- Alternating direction method of multipliers for \(\ell_{1}\)-\(\ell_{2}\)-regularized logistic regression model
- A Lagrange-Newton algorithm for sparse nonlinear programming
- An improved GLMNET for L1-regularized logistic regression
- A proximal ADMM with the Broyden family for convex optimization problems
- A random active set method for strictly convex quadratic problem with simple bounds
- Estimation of dynamic systems using a method of characteristics filter
- A fast trans-lasso algorithm with penalized weighted score function
- scientific article; zbMATH DE number 7306914 (Why is no real title available?)
- Feature screening strategy for non-convex sparse logistic regression with log sum penalty
- JANOS: An Integrated Predictive and Prescriptive Modeling Framework
- Large‐scale regression‐based pattern discovery: The example of screening the WHO global drug safety database
- A semismooth Newton stochastic proximal point algorithm with variance reduction
- A smoothing neural network for minimization \(l_1\)-\(l_p\) in sparse signal reconstruction with measurement noises
- Cardinality-constrained structured data-fitting problems
- SMT: Sparse multivariate tree
- Stochastic DCA for sparse multiclass logistic regression
- An interior point method for \(L_{1 / 2}\)-SVM and application to feature selection in classification
- An inexact regularized proximal Newton method without line search
- On the complexity of logistic regression models
- Parameter choices for sparse regularization with the ℓ1 norm *
- Empirical comparison study of approximate methods for structure selection in binary graphical models
- A generalized alternating direction implicit method for consensus optimization: application to distributed sparse logistic regression
- A primal and dual active set algorithm for truncated \(L_1\) regularized logistic regression
- Sequential safe feature elimination rule for \(L_1\)-regularized regression with Kullback-Leibler divergence
This page was built for publication: An interior-point method for large-scale \(l_1\)-regularized logistic regression
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3174129)
