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.
2019
2019
We consider the problem of simultaneous reduction of acoustic echo, reverberation and noise. In real scenarios, these distortion… 
2018
2018
Gradient descent, and coordinate descent in particular, are core tools in machine learning and elsewhere. Large problem instances… 
2017
2017
Chapter 3 proposed the coordinate search (CS) algorithm for unconstrained optimization. The algorithm worked based on local… 
2016
2016
We study the composite minimization problem where the objective function is the sum of two convex functions: one is the sum of a… 
2015
2015
Time series analysis is an important research topic in science and engineering. Real-world time series are usually non-stationary… 
2014
2014
In recent studies on sparse modeling, $l_q$ ($0<q<1$) regularization has received considerable attention due to its superiorities… 
2011
2011
This paper proposes a novel Linear Programming (LP) based algorithm, called Dynamic Tree-Block Coordinate Ascent (DT-BCA), for… 
2010
2010
In this paper, we consider the problem of joint sensor calibration and target signature estimation using distributed measurements… 
2008
2008
A novel pilot generation and detection system for aligning the second loop of an adaptive feedforward compensated power amplifier… 
1953
1953