Steepest†descent proximal point algorithms for a class of variational inequalities in Banach spaces

Nguyen Buong

Mathematische Nachrichten, 2018, vol. 291, issue 8-9, 1191-1207

Abstract: In this paper, we present a new approach to the problem of finding a common zero for a system of m†accretive mappings in a uniformly convex Banach space with a uniformly Gâteaux differentiable norm. We propose an implicit iteration method and two explicit ones, based on compositions of resolvents with the steepest†descent method. We show that our results contain some iterative methods in literature as special cases. An extension of the Xu's regularization method for the proximal point algorithm from Hilbert spaces onto Banach ones under simple conditions of convergence and a new variant for the method of alternating resolvents are obtained. Numerical experiments are given to affirm efficiency of the methods.

Date: 2018
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
https://doi.org/10.1002/mana.201600240

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:bla:mathna:v:291:y:2018:i:8-9:p:1191-1207

Ordering information: This journal article can be ordered from
http://www.blackwell ... bs.asp?ref=0025-584X

Access Statistics for this article

Mathematische Nachrichten is currently edited by Robert Denk

More articles in Mathematische Nachrichten from Wiley Blackwell
Bibliographic data for series maintained by Wiley Content Delivery ().