DocumentCode :
3716122
Title :
Adaptive cyclic and randomized coordinate descent for the sparse total least squares problem
Author :
Alexandru Onose;Bogdan Dumitrescu
Author_Institution :
Department of Signal Processing Tampere University of Technology PO BOX 553, 33101, Tampere, Finland
fYear :
2015
Firstpage :
1696
Lastpage :
1700
Abstract :
Coordinate descent (CD) is a simple and general optimization technique. We use it to solve the sparse total least squares problem in an adaptive manner, working on the l1-regularized Rayleigh quotient function. We propose two algorithmic approaches for choosing the coordinates: cyclic and randomized. In both cases, the number of CD steps per time instant is a parameter that can serve as a trade-off between complexity and performance. We present numerical experiments showing that the proposed algorithms can approach stationary error near that of the oracle. The randomized algorithm is slightly better than the cyclic one with respect to convergence speed.
Keywords :
"Signal processing algorithms","Complexity theory","Europe","Adaptive algorithms","Finite impulse response filters","Indexes"
Publisher :
ieee
Conference_Titel :
Signal Processing Conference (EUSIPCO), 2015 23rd European
Electronic_ISBN :
2076-1465
Type :
conf
DOI :
10.1109/EUSIPCO.2015.7362673
Filename :
7362673
Link To Document :
بازگشت