Smoothed optimization for sparse off-grid directions-of-arrival estimation

Cheng Yu Hung, Mostafa Kaveh

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

This paper is concerned with the development of a computationally efficient optimization algorithm for off-grid direction finding using a sparse observation model. The optimization problem can be formulated as one smooth plus two nonsmooth functions. We propose two accelerated smoothing proximal gradient algorithms. The Nesterov smoothing methodology is utilized to reformulate nonsmooth functions into smooth ones, and the accelerated proximal gradient algorithm is adopted to solve the smoothed optimization problem. The computational efficiency and efficacy of the proposed algorithms are demonstrated numerically.

Original languageEnglish (US)
Title of host publication2017 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2017 - Proceedings
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages3121-3125
Number of pages5
ISBN (Electronic)9781509041176
DOIs
StatePublished - Jun 16 2017
Event2017 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2017 - New Orleans, United States
Duration: Mar 5 2017Mar 9 2017

Publication series

NameICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings
ISSN (Print)1520-6149

Other

Other2017 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2017
Country/TerritoryUnited States
CityNew Orleans
Period3/5/173/9/17

Keywords

  • Accelerated proximal gradient
  • Group sparsity
  • Nondifferentiable
  • Nonsmooth function
  • Smoothing

Fingerprint

Dive into the research topics of 'Smoothed optimization for sparse off-grid directions-of-arrival estimation'. Together they form a unique fingerprint.

Cite this