Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Coordinate descent

Known as: Coordinate (disambiguation), 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… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2015
Highly Cited
2015
Coordinate descent algorithms solve optimization problems by successively performing approximate minimization along coordinate… Expand
  • figure 1
Is this relevant?
Highly Cited
2015
Highly Cited
2015
We describe an asynchronous parallel stochastic coordinate descent algorithm for minimizing smooth unconstrained or separably… Expand
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • table 2
Is this relevant?
Highly Cited
2015
Highly Cited
2015
We propose a new randomized coordinate descent method for minimizing the sum of convex functions each of which depends on a small… Expand
  • table 1
  • table 2
  • table 3
  • table 4
  • figure 1
Is this relevant?
Highly Cited
2014
Highly Cited
2014
In this paper we develop a randomized block-coordinate descent method for minimizing the sum of a smooth and a simple nonsmooth… Expand
  • table 1
  • table 2
  • table 3
  • table 4
  • table 6
Is this relevant?
Highly Cited
2013
Highly Cited
2013
In this paper we study smooth convex programming problems where the decision variables vector is split into several blocks of… Expand
  • table 3.1
  • table 3.2
Is this relevant?
Highly Cited
2013
Highly Cited
2013
Stochastic gradient descent is popular for large scale optimization but has slow convergence asymptotically due to the inherent… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
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… Expand
Is this relevant?
Highly Cited
2011
Highly Cited
2011
We propose Shotgun, a parallel coordinate descent algorithm for minimizing L1-regularized losses. Though coordinate descent seems… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
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… Expand
  • table 2
  • figure 1
  • figure 2
  • figure 3
  • figure 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… Expand
  • table 1
  • figure 1
  • table 2
  • table 3
  • table 4
Is this relevant?