Some modified relaxed alternating projection methods for solving the two-sets convex feasibility problem

ISSN： 0233-1934

Source： Optimization, Vol.62, Iss.4, 2013-04, pp. : 509-525

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

A Successive Projection Algorithm for Solving the Multiple-Sets Split Feasibility Problem

By Liu Binghua Qu Biao Zheng Na

Numerical Functional Analysis and Optimization, Vol. 35, Iss. 11, 2014-11 ,pp. : 1459-1466

Taylor & Francis Ltd

Access to resources Recommend Favorite

Weak convergence theorems of the modified relaxed projection algorithms for the split feasibility problem in Hilbert spaces

By Dong Qiao-Li Yao Yonghong He Songnian

Optimization Letters, Vol. 8, Iss. 3, 2014-03 ,pp. : 1031-1046

Springer Publishing Company

Access to resources Recommend Favorite

Convergence of Bregman Projection Methods for Solving Consistent Convex Feasibility Problems in Reflexive Banach Spaces

By Alber Y. Butnariu D.

Journal of Optimization Theory and Applications, Vol. 92, Iss. 1, 1997-01 ,pp. : 33-61

Springer Publishing Company

Access to resources Recommend Favorite

Non-monotonous accelerated parallel subgradient projection algorithm for convex feasibility problem

By Dang Yazheng Gao Yan

Optimization, Vol. 63, Iss. 4, 2014-04 ,pp. : 571-584

Taylor & Francis Ltd

Access to resources Recommend Favorite

Variable target value relaxed alternating projection method

By Cegielski A. Dylewski R.

Computational Optimization and Applications, Vol. 47, Iss. 3, 2010-11 ,pp. : 455-476

Springer Publishing Company

Access to resources Recommend Favorite