Open Access
2009 HYBRID PROXIMAL POINT ALGORITHMS FOR SOLVING CONSTRAINED MINIMIZATION PROBLEMS IN BANACH SPACES
Lu-Chuan Ceng, Shuechin Huang, Yeong-Cheng Liou
Taiwanese J. Math. 13(2B): 805-820 (2009). DOI: 10.11650/twjm/1500405406

Abstract

The purpose of this paper is to introduce two hybrid proximal point algorithms to solve the constrained minimization problem for a convex functional in a uniformly convex and uniformly smooth Banach space. Using those iterative schemes, we establish the strong convergence theorems for relatively nonexpansive mappings which generalize the recent results in the literature.

Citation

Download Citation

Lu-Chuan Ceng. Shuechin Huang. Yeong-Cheng Liou. "HYBRID PROXIMAL POINT ALGORITHMS FOR SOLVING CONSTRAINED MINIMIZATION PROBLEMS IN BANACH SPACES." Taiwanese J. Math. 13 (2B) 805 - 820, 2009. https://doi.org/10.11650/twjm/1500405406

Information

Published: 2009
First available in Project Euclid: 18 July 2017

zbMATH: 1176.49006
MathSciNet: MR2510834
Digital Object Identifier: 10.11650/twjm/1500405406

Subjects:
Primary: 47H09 , 47J25 , 49J40

Keywords: constrained minimization problem , convex functional , generalized projection , hybrid proximal point algorithm , relatively nonexpansive mapping , strong convergence

Rights: Copyright © 2009 The Mathematical Society of the Republic of China

Vol.13 • No. 2B • 2009
Back to Top