An efficient simultaneous method for the constrained multiple-sets split feasibility problem
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. Copyright Springer Science+Business Media, LLC 2012
Volume (Year): 52 (2012)
Issue (Month): 3 (July)
|Contact details of provider:|| Web page: http://www.springer.com|
|Order Information:||Web: http://www.springer.com/math/journal/10589|
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- repec:spr:pharme:v:22:y:2004:i:4:p:225-244 is not listed on IDEAS
- Bing-Sheng He, 2009. "Parallel splitting augmented Lagrangian methods for monotone structured variational inequalities," Computational Optimization and Applications, Springer, vol. 42(2), pages 195-212, March.
When requesting a correction, please mention this item's handle: RePEc:spr:coopap:v:52:y:2012:i:3:p:825-843. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Sonal Shukla)or (Rebekah McClure)
If references are entirely missing, you can add them using this form.