Global Convergence Analysis of Algorithms for Finding Feasible Points in Norm-Relaxed MFD

Author： Chen X.B.   Kostreva M.M.  

Publisher： Springer Publishing Company

ISSN： 0022-3239

Source： Journal of Optimization Theory and Applications, Vol.100, Iss.2, 1999-02, pp. : 287-309

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

Self-Tuning Norm-Relaxed Method of Feasible Directions

By Korycki J.   Kostreva M.  

Journal of Optimization Theory and Applications, Vol. 92, Iss. 2, 1997-02 ,pp. : 311-330

Springer Publishing Company

Access to resources Recommend Favorite

Iterative methods for finding minimum-norm fixed points of nonexpansive mappings with applications

By Yao Yonghong  

Optimization, Vol. 60, Iss. 6, 2011-06 ,pp. : 645-658

Taylor & Francis Ltd

Access to resources Recommend Favorite

Convergence Analysis of Perturbed Feasible Descent Methods

By Solodov M.V.  

Journal of Optimization Theory and Applications, Vol. 93, Iss. 2, 1997-05 ,pp. : 337-353

Springer Publishing Company

Access to resources Recommend Favorite

Convergence in Norm of Projection Regularized Krasnoselski-Mann Iterations for Fixed Points of Cutters

By Dong Qiao-Li   He Songnian  

Numerical Functional Analysis and Optimization, Vol. 34, Iss. 5, 2013-04 ,pp. : 485-495

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