Abstract
The multiple-sets split feasibility problem (MSFP) captures various applications arising in many areas. Recently, by introducing a function measuring the proximity to the involved sets, Censor et al. proposed to solve the MSFP via minimizing the proximity function, and they developed a class of simultaneous methods to solve the resulting constrained optimization model numerically. In this paper, by combining the ideas of the proximity function and the operator splitting methods, we propose an efficient simultaneous method for solving the constrained MSFP. The efficiency of the new method is illustrated by some numerical experiments.
| Original language | English |
|---|---|
| Pages (from-to) | 825-843 |
| Number of pages | 19 |
| Journal | Computational Optimization and Applications |
| Volume | 52 |
| Issue number | 3 |
| DOIs | |
| Publication status | Published - Jul 2012 |
User-Defined Keywords
- Convex feasibility problem
- Multiple-sets split feasibility problem
- Simultaneous method
Fingerprint
Dive into the research topics of 'An efficient simultaneous method for the constrained multiple-sets split feasibility problem'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver