Random coordinate descent

Randomized (Block) Coordinate Descent Method is an optimization algorithm popularized by Nesterov (2010) and Richtárik and Takáč (2011). The first… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

2007-2016
02420072016

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
In this paper we employ a parallel version of a randomized (block) coordinate descent method for minimizing the sum of a… (More)
Is this relevant?
2015
2015
Submodular function minimization is a fundamental optimization problem that arises in several applications in machine learning… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2015
2015
In this paper we analyze several new methods for solving nonconvex optimization problems with the objective function formed as a… (More)
  • table 1
  • figure 1
  • figure 2
Is this relevant?
2015
2015
In this paper, we study the minimization of &#x2113;<sub>0</sub> regularized optimization problems, where the objective function… (More)
  • table I
  • table II
  • figure 1
  • figure 2
Is this relevant?
2014
2014
In this paper we propose a variant of the random coordinate descent method for solving linearly constrained convex optimization… (More)
  • table 1
  • table 2
  • table 3
  • figure 1
  • figure 2
Is this relevant?
2013
2013
In this paper, we develop randomized block-coordinate descent methods for minimizing multi-agent convex optimization problems… (More)
  • figure 1
  • table I
  • figure 2
  • table II
Is this relevant?
2013
2013
In this paper we develop a random coordinate descent method suitable for solving large-scale sparse nonconvex optimization… (More)
  • table I
Is this relevant?
2013
2013
In this paper we develop a random block coordinate descent method for minimizing large-scale convex problems with linearly… (More)
  • table 3.1
Is this relevant?
2012
2012
In this paper we develop a novel randomized block-coordinate descent method for minimizing multi-agent convex optimization… (More)
  • figure 3.1
Is this relevant?
2007
2007
The 0/1 loss is an important cost function for perceptrons. Nevertheless it cannot be easily minimized by most existing… (More)
  • table I
  • figure 3
  • figure 4
  • table II
  • table III
Is this relevant?