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

ISSN： 0022-3239

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

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

Generalized Bregman Projections in Convex Feasibility Problems

By Kiwiel K.C.

Journal of Optimization Theory and Applications, Vol. 96, Iss. 1, 1998-01 ,pp. : 139-157

Springer Publishing Company

Access to resources Recommend Favorite

Convergence rate analysis and error bounds for projection algorithms in convex feasibility problems

By Beck Amir Teboulle Marc

Optimization Methods and Software, Vol. 18, Iss. 4, 2003-08 ,pp. : 377-394

Taylor & Francis Ltd

Access to resources Recommend Favorite

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

By Yang Yuning Yang Qingzhi

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

Taylor & Francis Ltd

Access to resources Recommend Favorite

Two Characterizations of Super-Reflexive Banach Spaces by the Behaviour of Differences of Convex Functions

By Boiso M.C.

Journal of Functional Analysis, Vol. 191, Iss. 1, 2002-05 ,pp. : 1-16

Academic Press

Access to resources Recommend Favorite

Two Strong Convergence Theorems for a Proximal Method in Reflexive Banach Spaces

By Reich Simeon Sabach Shoham

Numerical Functional Analysis and Optimization, Vol. 31, Iss. 1, 2010-01 ,pp. : 22-44

Taylor & Francis Ltd

Access to resources Recommend Favorite