p-NORM MINIMIZATION OVER INTERSECTIONS OF CONVEX SETS

Bayram I.

20th European Signal Processing Conference (EUSIPCO), Bucharest, Romanya, 27 - 31 Ağustos 2012, ss.1159-1163 identifier

  • Yayın Türü: Bildiri / Tam Metin Bildiri
  • Basıldığı Şehir: Bucharest
  • Basıldığı Ülke: Romanya
  • Sayfa Sayıları: ss.1159-1163
  • İstanbul Teknik Üniversitesi Adresli: Evet

Özet

We consider the minimization of the l(p) norm subject to convex constraints. The problem considered in this paper may be regarded as a relaxation of a similar problem that employs the l(1) norm. We derive the dual problem, which is unconstrained and devise an algorithm for the dual problem by adapting the Douglas-Rachford algorithm. We demonstrate the utility of the algorithm on an experiment and discuss its differences with an existing algorithm.