p-NORM MINIMIZATION OVER INTERSECTIONS OF CONVEX SETS


Bayram I.

20th European Signal Processing Conference (EUSIPCO), Bucharest, Romania, 27 - 31 August 2012, pp.1159-1163 identifier

  • Publication Type: Conference Paper / Full Text
  • City: Bucharest
  • Country: Romania
  • Page Numbers: pp.1159-1163

Abstract

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.