The following pages link to (Q5405181):
Displaying 30 items.
- A modified local quadratic approximation algorithm for penalized optimization problems (Q147630) (← links)
- An inexact successive quadratic approximation method for L-1 regularized optimization (Q301652) (← links)
- A centroid-based gene selection method for microarray data classification (Q738623) (← links)
- A multicriteria approach to find predictive and sparse models with stable feature selection for high-dimensional data (Q1664508) (← links)
- Feature selection and tumor classification for microarray data using relaxed Lasso and generalized multi-class support vector machine (Q1717062) (← links)
- A family of inexact SQA methods for non-smooth convex minimization with provable convergence guarantees based on the Luo-Tseng error bound property (Q1739040) (← links)
- An extended Newton-type algorithm for \(\ell_2\)-regularized sparse logistic regression and its efficiency for classifying large-scale datasets (Q2033090) (← links)
- An effective procedure for feature subset selection in logistic regression based on information criteria (Q2044566) (← links)
- A guide for sparse PCA: model comparison and applications (Q2073736) (← links)
- A stochastic extra-step quasi-Newton method for nonsmooth nonconvex optimization (Q2149551) (← links)
- Global complexity analysis of inexact successive quadratic approximation methods for regularized optimization under mild assumptions (Q2200083) (← links)
- An incremental aggregated proximal ADMM for linearly constrained nonconvex optimization with application to sparse logistic regression problems (Q2226322) (← links)
- A fast SVD-hidden-nodes based extreme learning machine for large-scale data analytics (Q2418132) (← links)
- Empirical risk minimization: probabilistic complexity and stepsize strategy (Q2419551) (← links)
- A globally convergent proximal Newton-type method in nonsmooth convex optimization (Q2687066) (← links)
- A Multilevel Framework for Sparse Optimization with Application to Inverse Covariance Estimation and Logistic Regression (Q2830631) (← links)
- (Q4558572) (← links)
- (Q4637005) (← links)
- FaRSA for ℓ<sub>1</sub>-regularized convex optimization: local convergence and numerical experience (Q4638928) (← links)
- (Q4998894) (← links)
- (Q4999017) (← links)
- Sparse Approximations with Interior Point Methods (Q5044994) (← links)
- A Subspace Acceleration Method for Minimization Involving a Group Sparsity-Inducing Regularizer (Q5072590) (← links)
- (Q5149027) (← links)
- (Q5152646) (← links)
- Fused Multiple Graphical Lasso (Q5254994) (← links)
- A Reduced-Space Algorithm for Minimizing $\ell_1$-Regularized Convex Functions (Q5348467) (← links)
- Concave Likelihood-Based Regression with Finite-Support Response Variables (Q6079713) (← links)
- A new large-scale learning algorithm for generalized additive models (Q6134363) (← links)
- Accelerating inexact successive quadratic approximation for regularized optimization through manifold identification (Q6165598) (← links)
