IDEAS home Printed from https://ideas.repec.org/h/spr/spochp/978-3-319-33255-0_7.html
   My bibliography  Save this book chapter

Abstract Version of CARP Algorithm

In: Approximate Solutions of Common Fixed-Point Problems

Author

Listed:
  • Alexander J. Zaslavski

    (The Technion - Israel Institute of Technology)

Abstract

In this chapter we study the convergence of an abstract version of the algorithm which is called in the literature as component-averaged row projections or CARP. This algorithm was introduced for solving a convex feasibility problem in a finite-dimensional space, when a given collection of sets is divided into blocks in such a manner that all sets belonging to every block are subsets of a vector subspace associated with the block. All the blocks are processed in parallel and the algorithm operates in vector subspaces of the whole vector space. This method becomes efficient, in particular, when the dimensions of the subspaces are essentially smaller than the dimension of the whole space. In this chapter we study CARP for problems in a normed space, which is not necessarily finite-dimensional.

Suggested Citation

  • Alexander J. Zaslavski, 2016. "Abstract Version of CARP Algorithm," Springer Optimization and Its Applications, in: Approximate Solutions of Common Fixed-Point Problems, chapter 0, pages 251-288, Springer.
    • Handle: RePEc:spr:spochp:978-3-319-33255-0_7
    DOI: 10.1007/978-3-319-33255-0_7
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    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:spr:spochp:978-3-319-33255-0_7. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.