IDEAS home Printed from https://ideas.repec.org/p/crg/wpaper/dt2013-08.html
   My bibliography  Save this paper

Solving Proximal Split Feasibility Problems without prior knowledge of operator norms

Author

Listed:
  • A. Moudafi

    (CEREGMIA, Université des Antilles et de la Guyane)

  • B.S. Thakur

    (School of Studies in Mathematics, Pt.Ravishankar Shukla University, Raipur, 492010, India)

Abstract

In this paper our interest is in investigating properties and numerical solutions of Proximal Split feasibility Problems. First, we consider the problem of nding a point which minimizes a convex function f such that its image under a bounded linear op- erator A minimizes another convex function g. Based on an idea introduced in [9], we propose a split proximal algorithm with a way of selecting the step-sizes such that its implementation does not need any prior information about the operator norm. Because the calculation or at least an estimate of the operator norm kAk is not an easy task. Secondly, we investigate the case where one of the two involved functions is prox-regular, the novelty of this approach is that the associated proximal mapping is not nonexpan- sive any longer. Such situation is encountered, for instance, in numerical solution to phase retrieval problem in crystallography, astronomy and inverse scattering [10] and is therefore of great practical interest.

Suggested Citation

  • A. Moudafi & B.S. Thakur, 2013. "Solving Proximal Split Feasibility Problems without prior knowledge of operator norms," Documents de Travail 2013-08, CEREGMIA, Université des Antilles et de la Guyane.
    • Handle: RePEc:crg:wpaper:dt2013-08
    as

    Download full text from publisher

    File URL: http://www2.univ-ag.fr/RePEc/DT/DT2013-08_Moudafi_Thakur.pdf
    File Function: First version, 2013
    Download Restriction: no
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:crg:wpaper:dt2013-08. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Janis Hilaricus (email available below). General contact details of provider: https://edirc.repec.org/data/ceuagmq.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.