• glasso

  • Referenced in 251 articles [sw07432]
  • glasso, that also operate by block-coordinate descent, where Θ is the optimization target ... particular different approaches to solving their coordinate sub-problems. We conclude that dp-glasso...
  • glmnet

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

  • Referenced in 52 articles [sw19133]
  • package SparseNet: coordinate descent with nonconvex penalties. We address the problem of sparse selection ... finding good solutions. We pursue a coordinate-descent approach for optimization, and study its convergence...
  • SDBOX

  • Referenced in 19 articles [sw05137]
  • coordinate directions. Whenever a “suitable” descent feasible coordinate direction is detected a new point...
  • QICD

  • Referenced in 5 articles [sw19679]
  • Algorithm. Extremely fast algorithm ”QICD”, Iterative Coordinate Descent Algorithm for High-dimensional Nonconvex Penalized Quantile ... Regression. This algorithm combines the coordinate descent algorithm in the inner iteration with the majorization...
  • Glmnet

  • Referenced in 6 articles [sw25026]
  • Features include: high efficiency by using coordinate descent with warm starts and active set iterations...
  • cvplogistic

  • Referenced in 3 articles [sw29394]
  • Regression 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 (LLA-CD) and adaptive rescaling algorithms...
  • APPLE

  • Referenced in 4 articles [sw13354]
  • modified predictor-corrector method and the coordinate-descent algorithm. APPLE is compared with several well...
  • cmenet

  • Referenced in 4 articles [sw21048]
  • method called cmenet, which employs coordinate descent and two principles called CME coupling and reduction...
  • ordinalNet

  • Referenced in 3 articles [sw20527]
  • models with elastic net penalty by coordinate descent. Supported model families include cumulative probability, stopping...
  • dglars

  • Referenced in 2 articles [sw23497]
  • efficient predictor-corrector or a cyclic coordinate descent algorithm, as described in the paper linked...
  • ahaz

  • Referenced in 1 article [sw24684]
  • Coordinate Descent Methods for the Penalized Semiparametric Additive Hazards Model...
  • clogitL1

  • Referenced in 1 article [sw24385]
  • elastic net penalties. Uses cyclic coordinate descent and warm starts to compute the entire path...
  • sglasso

  • Referenced in 1 article [sw16715]
  • coordinate minimization (CCM) and a cyclic coordinate descent (CCD) algorithm...
  • coxnet

  • Referenced in 1 article [sw13712]
  • penalties. The package uses one-step coordinate descent algorithm and runs extremely fast by taking...
  • cqrReg

  • Referenced in 1 article [sw21332]
  • multipliers (ADMM), majorize-minimization (MM), and coordinate descent (CD) algorithms. Our new approaches address...
  • flm

  • Referenced in 1 article [sw28185]
  • which is based on a functional coordinate descent, and an R package, flm, whose backend...
  • FarRSA

  • Referenced in 1 article [sw25237]
  • solved, which allow conjugate gradient or coordinate descent techniques to be employed; (iv) a computationally...
  • bSDMM

  • Referenced in 1 article [sw29720]
  • proximal analog to inexact coordinate descent methods under constraints. Unlike alternative approaches for joint solvers...
  • ccdrAlgorithm

  • Referenced in 0 articles [sw16299]
  • Implementation of the CCDr (Concave penalized Coordinate Descent with reparametrization) structure learning algorithm as described ... uses sparse regularization and block-cyclic coordinate descent...