Abstract Version of CARP Algorithm

Alexander J. Zaslavski
Additional contact information
Alexander J. Zaslavski: The Technion - Israel Institute of Technology

Chapter Chapter 7 in Approximate Solutions of Common Fixed-Point Problems, 2016, pp 251-288 from Springer

Abstract: 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.

Date: 2016
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:spochp:978-3-319-33255-0_7

Ordering information: This item can be ordered from
http://www.springer.com/9783319332550

DOI: 10.1007/978-3-319-33255-0_7

Access Statistics for this chapter

More chapters in Springer Optimization and Its Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().