File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1007/s10589-011-9429-8
- Scopus: eid_2-s2.0-84865253650
- WOS: WOS:000306836900011
- Find via
Supplementary
- Citations:
- Appears in Collections:
Article: An efficient simultaneous method for the constrained multiple-sets split feasibility problem
Title | An efficient simultaneous method for the constrained multiple-sets split feasibility problem |
---|---|
Authors | |
Keywords | Multiple-sets split feasibility problem Simultaneous method Convex feasibility problem |
Issue Date | 2012 |
Citation | Computational Optimization and Applications, 2012, v. 52, n. 3, p. 825-843 How to Cite? |
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. © Springer Science+Business Media, LLC 2011. |
Persistent Identifier | http://hdl.handle.net/10722/251001 |
ISSN | 2023 Impact Factor: 1.6 2023 SCImago Journal Rankings: 1.322 |
ISI Accession Number ID |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Zhang, Wenxing | - |
dc.contributor.author | Han, Deren | - |
dc.contributor.author | Yuan, Xiaoming | - |
dc.date.accessioned | 2018-02-01T01:54:18Z | - |
dc.date.available | 2018-02-01T01:54:18Z | - |
dc.date.issued | 2012 | - |
dc.identifier.citation | Computational Optimization and Applications, 2012, v. 52, n. 3, p. 825-843 | - |
dc.identifier.issn | 0926-6003 | - |
dc.identifier.uri | http://hdl.handle.net/10722/251001 | - |
dc.description.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. © Springer Science+Business Media, LLC 2011. | - |
dc.language | eng | - |
dc.relation.ispartof | Computational Optimization and Applications | - |
dc.subject | Multiple-sets split feasibility problem | - |
dc.subject | Simultaneous method | - |
dc.subject | Convex feasibility problem | - |
dc.title | An efficient simultaneous method for the constrained multiple-sets split feasibility problem | - |
dc.type | Article | - |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.doi | 10.1007/s10589-011-9429-8 | - |
dc.identifier.scopus | eid_2-s2.0-84865253650 | - |
dc.identifier.volume | 52 | - |
dc.identifier.issue | 3 | - |
dc.identifier.spage | 825 | - |
dc.identifier.epage | 843 | - |
dc.identifier.eissn | 1573-2894 | - |
dc.identifier.isi | WOS:000306836900011 | - |
dc.identifier.issnl | 0926-6003 | - |