The following pages link to (Q2896183):
Displaying 30 items.
- An inexact successive quadratic approximation method for L-1 regularized optimization (Q301652) (← links)
- Practical inexact proximal quasi-Newton method with global complexity analysis (Q344963) (← links)
- Block coordinate descent algorithms for large-scale sparse multiclass classification (Q399900) (← links)
- Nonmonotone Barzilai-Borwein gradient algorithm for \(\ell_1\)-regularized nonsmooth minimization in compressive sensing (Q474971) (← links)
- Natural coordinate descent algorithm for \(\ell_1\)-penalised regression in generalised linear models (Q1659358) (← links)
- Sparse and kernel OPLS feature extraction based on eigenvalue problem solving (Q1677852) (← 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)
- Proximal quasi-Newton methods for regularized convex optimization with linear and accelerated sublinear convergence rates (Q1744900) (← links)
- ADMM-softmax: an ADMM approach for multinomial logistic regression (Q1988494) (← links)
- An extended Newton-type algorithm for \(\ell_2\)-regularized sparse logistic regression and its efficiency for classifying large-scale datasets (Q2033090) (← links)
- A decomposition method for Lasso problems with zero-sum constraint (Q2106751) (← links)
- Hybrid MPI/OpenMP parallel asynchronous distributed alternating direction method of multipliers (Q2244063) (← links)
- A two-step fixed-point proximity algorithm for a class of non-differentiable optimization models in machine learning (Q2333729) (← links)
- Performance of first- and second-order methods for \(\ell_1\)-regularized least squares problems (Q2374363) (← links)
- A random block-coordinate Douglas-Rachford splitting method with low computational complexity for binary logistic regression (Q2419533) (← links)
- Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function (Q2452370) (← links)
- A Fast Active Set Block Coordinate Descent Algorithm for $\ell_1$-Regularized Least Squares (Q2796799) (← links)
- A Multilevel Framework for Sparse Optimization with Application to Inverse Covariance Estimation and Logistic Regression (Q2830631) (← links)
- (Q4558572) (← links)
- (Q4637005) (← links)
- (Q5053252) (← links)
- An Iterative Reduction FISTA Algorithm for Large-Scale LASSO (Q5088796) (← links)
- Convex Optimization for Group Feature Selection in Networked Data (Q5139860) (← links)
- Stochastic proximal quasi-Newton methods for non-convex composite optimization (Q5198046) (← links)
- An Efficient Proximal Block Coordinate Homotopy Method for Large-Scale Sparse Least Squares Problems (Q5216783) (← links)
- A fast conjugate gradient algorithm with active set prediction for ℓ<sub>1</sub> optimization (Q5238070) (← links)
- Cyclic Coordinate-Update Algorithms for Fixed-Point Problems: Analysis and Applications (Q5348257) (← links)
- Structured sparsity through convex optimization (Q5965303) (← links)
- A reduced half thresholding algorithm (Q6164988) (← links)