• DocumentCode
    1852268
  • Title

    P-norm minimization over intersections of convex sets

  • Author

    Bayram, Ilker

  • Author_Institution
    Dept. of Electron. & Telecommun. Eng., Istanbul Tech. Univ., Istanbul, Turkey
  • fYear
    2012
  • fDate
    27-31 Aug. 2012
  • Firstpage
    1159
  • Lastpage
    1163
  • Abstract
    We consider the minimization of the ℓ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 ℓ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.
  • Keywords
    minimisation; relaxation theory; set theory; ℓ1 norm; ℓp norm; Douglas-Rachford algorithm; convex constraint; convex set; dual problem; p-norm minimization; relaxation; Bridges; Convergence; Image reconstruction; Minimization; Noise measurement; Signal processing algorithms; Vectors; Basis pursuit; Douglas-Rachford algorithm; Dykstra´s algorithm; bridge estimate; minimum norm solution;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Signal Processing Conference (EUSIPCO), 2012 Proceedings of the 20th European
  • Conference_Location
    Bucharest
  • ISSN
    2219-5491
  • Print_ISBN
    978-1-4673-1068-0
  • Type

    conf

  • Filename
    6334070
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1852268