GPU-accelerated parallel optimization for sparse regularization

Jun 1, 2020ยท
Xingran Wang
Tianyi Liu
Tianyi Liu
,
Minh Trinh-Hoang
,
Marius Pesavento
ยท 0 min read
Abstract
We prove the concept that the block successive convex approximation algorithm can be configured in a flexible manner to adjust for implementations on modern parallel hardware architecture. A shuffle order update scheme and an all-close termination criterion are considered for efficient performance and convergence comparisons. Four different implementations are studied and compared. Simulation results on hardware show the condition of using shuffle order and selection of block numbers and implementations.
Type
Publication
2020 IEEE 11th Sensor Array and Multichannel Signal Processing Workshop (SAM)