
glmnet
 Referenced in 426 articles
[sw08159]
 grouped multinomial. The algorithm uses cyclical coordinate descent in a pathwise fashion, as described...

glasso
 Referenced in 353 articles
[sw07432]
 primal algorithms pglasso and dpglasso, that also operate by blockcoordinate descent, where ... particular different approaches to solving their coordinate subproblems. We conclude that dpglasso...

sparsenet
 Referenced in 71 articles
[sw19133]
 package SparseNet: coordinate descent with nonconvex penalties. We address the problem of sparse selection ... convexrelaxation algorithms for finding good solutions. We pursue a coordinatedescent approach for optimization ... standardizing reparametrization that assists our pathwise algorithm. The MC+ penalty is ideally suited to this...

QICD
 Referenced in 10 articles
[sw19679]
 Descent Algorithm for Highdimensional Nonconvex Penalized Quantile Regression. This algorithm combines the coordinate descent...

cvplogistic
 Referenced in 4 articles
[sw29394]
 Model using Majorization Minimization by Coordinate Descent (MMCD) Algorithm. The package uses majorization minimization ... coordinate descent (MMCD) algorithm to compute the solution surface for concave penalized logistic regression model ... also provides the local linear approximation by coordinate descant (LLACD) and adaptive rescaling algorithms...

APPLE
 Referenced in 4 articles
[sw13354]
 variable selection and parameter estimation. A new algorithm, APPLE, is proposed for calculating the Approximate ... modified predictorcorrector method and the coordinatedescent algorithm. APPLE is compared with several well...

SDBOX
 Referenced in 25 articles
[sw05137]
 variables are bounded. This algorithm investigates the local behaviour of the objective function ... coordinate directions. Whenever a “suitable” descent feasible coordinate direction is detected a new point ... progressively obtained during the iterates of the algorithm can be used to build an approximation...

dglars
 Referenced in 2 articles
[sw23497]
 efficient predictorcorrector or a cyclic coordinate descent algorithm, as described in the paper linked...

SALES
 Referenced in 1 article
[sw31659]
 Descent and Proximal Gradient Algorithms. A coordinate descent algorithm for computing the solution path...

sglasso
 Referenced in 2 articles
[sw16715]
 coordinate algorithms are implemented to compute the sglasso estimator, i.e. a cyclic coordinate ... minimization (CCM) and a cyclic coordinate descent (CCD) algorithm...

coxnet
 Referenced in 1 article
[sw13712]
 penalties. The package uses onestep coordinate descent algorithm and runs extremely fast by taking...

cqrReg
 Referenced in 2 articles
[sw21332]
 ADMM), majorizeminimization (MM), and coordinate descent (CD) algorithms. Our new approaches address the lack...

QPsimplex
 Referenced in 2 articles
[sw31751]
 wellsuited for branchandbound algorithms for the discrete counterparts of these problems ... reformulation lends itself to simple coordinate descent and bisection algorithms utilizing the simplex method...

discretecdAlgorithm
 Referenced in 0 articles
[sw16321]
 Structure learning of Bayesian network using coordinatedescent algorithm. This algorithm is designed for discrete...

CatReg
 Referenced in 1 article
[sw33924]
 cyclical blockcoordinate descent, iterating an innovative dynamic programming algorithm to compute exact solutions...

ccdrAlgorithm
 Referenced in 0 articles
[sw16299]
 CCDr (Concave penalized Coordinate Descent with reparametrization) structure learning algorithm as described in Aragam ... uses sparse regularization and blockcyclic coordinate descent...

cmenet
 Referenced in 7 articles
[sw21048]
 method called cmenet, which employs coordinate descent and two principles called CME coupling and reduction ... gene activation behavior. Efficient implementations of our algorithms are available in the R package cmenet...

flm
 Referenced in 1 article
[sw28185]
 fast algorithm for computing the estimators, which is based on a functional coordinate descent...

outliernmf
 Referenced in 0 articles
[sw18395]
 data. Our iterative algorithm TONMF is based on block coordinate descent (BCD) framework. We define...

SearchFill
 Referenced in 1 article
[sw26745]
 overlap, thus avoiding local minima. Once the algorithm has targeted a point with low overlap ... method works as a steepest descent optimization. Our method, with only two free parameters ... able to detect the correct number and coordinates of vacancies in a wide spectrum...