Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
In this paper, the operation of a full-duplex (FD) multiple-input multiple-output (MIMO) underlay cognitive radio (CR) network is… 
2014
2014
In this paper we present a novel randomized block coordinate descent method for the minimization of a convex composite objective… 
2010
2010
In previous work, we studied the compensation of modal dispersion in multimode fiber (MMF) using several different configurations… 
Highly Cited
2009
Highly Cited
2009
A number of linear programming relaxations have been proposed for finding most likely settings of the variables (MAP) in large… 
Highly Cited
1997
Highly Cited
1997
  • J. Fessler
  • 1997
  • Corpus ID: 16901515
We present a new class of algorithms for edge-preserving restoration of piecewise-smooth images measured in non- Gaussian noise… 
1990
1990
We propose a dual descent method for the problem of minimizing a convex, possibly nondifferentiable, separable cost subject to… 
1953
1953