Skip to search formSkip to main contentSkip to account menu

Random coordinate descent

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

Related topics

Related topics

5 relations
Convex functionCoordinate descentGradient descentList of numerical analysis topics

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
Massive MIMO Multicast Beamforming via Accelerated Random Coordinate Descent
One key feature of massive multiple-input multiple-output systems is the large number of antennas and users. As a result… 
2018
2018
On the Application of Energy Inspired Model to Label Denoising
Learning in the presence of label noise is a promising research issue, which can well accommodate to the reality of weakly… 
2018
2018
A Variation on a Random Coordinate Minimization Method for Constrained Polynomial Optimization
In this letter we propose an algorithm for solving constrained polynomial minimization problems. The algorithm is a variation on… 
2016
2016
Randomized block coordinate descendant STRONG for large-scale Stochastic Optimization
STRONG is a response surface methodology based algorithm that iteratively constructs linear or quadratic fitness model to guide… 
2015
2015
Parallel and distributed random coordinate descent method for convex error bound minimization
In this paper we propose a parallel and distributed random (block) coordinate descent method for minimizing the sum of a… 
2015
2015
Distributed and parallel random coordinate descent methods for convex programming over big data networks
In this paper we develop random block coordinate gradient descent methods for minimizing large scale linearly constrained… 
2015
2015
Distributed and parallel random coordinate descent methods for huge convex programming over networks
In this paper we develop parallel random coordinate gradient descent methods for minimizing huge linearly constrained separable… 
2013
2013
A random coordinate descent algorithm for large-scale sparse nonconvex optimization
In this paper we develop a random coordinate descent method suitable for solving large-scale sparse nonconvex optimization… 
2012
2012
A random coordinate descent method for large-scale resource allocation problems
In this paper we develop a randomized (block) coordinate descent method for solving singly linear equality constrained… 
2011
2011
An accelerated random coordinate descent algorithm for compressed sensing
This paper introduces a new accelerated random coordinate descent algorithm for solving problems in the field of compressive… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)