Double projection algorithms for solving the split feasibility problems
MetadataShow full item record
Funding and Sponsorship
We propose two new double projection algorithms for solving the split feasibility problem (SFP). Different from the extragradient projection algorithms, the proposed algorithms do not require fixed stepsize and do not employ the same projection region at different projection steps. We adopt flexible rules for selecting the stepsize and the projection region. The proposed algorithms are shown to be convergent under certain assumptions. Numerical experiments show that the proposed methods appear to be more efficient than the relaxed- CQ algorithm.
Showing items related by title, author, creator and subject.
Adaptive antenna array beamforming using a concatenation of recursive least square and least mean square algorithmsSrar, Jalal Abdulsayed (2011)In recent years, adaptive or smart antennas have become a key component for various wireless applications, such as radar, sonar and cellular mobile communications including worldwide interoperability for microwave ...
Improving the relevance of web search results by combining web snippet categorization, clustering and personalizationZhu, Dengya (2010)Web search results are far from perfect due to the polysemous and synonymous characteristics of nature languages, information overload as the results of information explosion on the Web, and the flat list, “one size fits ...
Performance comparisons of bonding box-based contact detection algorithms and a new improvement technique based on parallelizationYazdani, M.; Paseh, H.; Sharifzadeh, Mostafa (2016)Purpose - The purpose of this paper is to find a convenient contact detection algorithm in order to apply in distinct element simulation. Design/methodology/approach - Taking the most computation effort, the performance ...