An efficient simultaneous method for the constrained multiple-sets split feasibility problem

Wenxing Zhang, Deren Han, Xiaoming YUAN*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

15 Citations (Scopus)

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 languageEnglish
Pages (from-to)825-843
Number of pages19
JournalComputational Optimization and Applications
Volume52
Issue number3
DOIs
Publication statusPublished - Jul 2012

Scopus Subject Areas

  • Control and Optimization
  • Computational Mathematics
  • Applied Mathematics

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