Coordinate descent

Known as: Coordinate ascent 
Coordinate descent is a derivative-free optimization algorithm. To find a local minimum of a function, one does line search along one coordinate… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1979-2018
010020019792018

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2016
Highly Cited
2016
In this work we show that randomized (block) coordinate descent methods can be accelerated by parallelization when applied to the… (More)
  • table 1
  • table 2
  • table 3
  • table 4
  • table 5
Is this relevant?
Highly Cited
2015
Highly Cited
2015
Coordinate descent algorithms solve optimization problems by successively performing approximate minimization along coordinate… (More)
  • figure 1
Is this relevant?
Highly Cited
2014
Highly Cited
2014
We describe an asynchronous parallel stochastic coordinate descent algorithm for minimizing smooth unconstrained or separably… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • table 2
Is this relevant?
Highly Cited
2012
Highly Cited
2012
In this paper we propose new methods for solving huge-scale optimization problems. For problems of this size, even the simplest… (More)
Is this relevant?
Highly Cited
2011
Highly Cited
2011
We propose Shotgun, a parallel coordinate descent algorithm for minimizing L1regularized losses. Though coordinate descent seems… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2011
Highly Cited
2011
Nonnegative Matrix Factorization (NMF) is an effective dimension reduction method for non-negative dyadic data, and has proven to… (More)
  • figure 1
  • table 1
  • figure 2
  • table 4
Is this relevant?
Highly Cited
2008
Highly Cited
2008
Imposition of a lasso penalty shrinks parameter estimates toward zero and performs continuous model selection. Lasso penalized… (More)
  • table 1
  • figure 1
  • table 2
  • table 3
  • table 4
Is this relevant?
Highly Cited
2008
Highly Cited
2008
In many applications, data appear with a huge number of instances as well as features. Linear Support Vector Machines (SVM) is… (More)
  • table 2
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2001
Highly Cited
2001
We study the convergence properties of a (block) coordinate descent method applied to minimize a nondifferentiable (nonconvex… (More)
Is this relevant?
Highly Cited
1996
Highly Cited
1996
Over the past years there has been considerable interest in statistically optimal reconstruction of cross-sectional images from… (More)
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?