Title

Generalized Eckstein-Bertsekas proximal point algorithm involving (H, eta)-monotonicity framework

Authors

Authors

R. U. Verma

Comments

Authors: contact us about adding a copy of your work at STARS@ucf.edu

Abbreviated Journal Title

Math. Comput. Model.

Keywords

general firm nonexpansiveness; variational inclusions; maximal monotonic; mapping; (H, eta)-monotonic mapping; generalized Eckstein-Bertsekas; proximal point algorithm; generalized resolvent operator; VARIATIONAL-INEQUALITIES; MAXIMAL MONOTONICITY; SPLITTING METHOD; OPERATORS; CONVERGENCE; MAPPINGS; Computer Science, Interdisciplinary Applications; Computer Science, ; Software Engineering; Mathematics, Applied

Abstract

A general framework for the Eckstein-Bertsekas proximal point algorithm, based on the notion of (H, eta)-monotonicity, is developed. Convergence analysis for the generalized Eckstein-Bertsekas proximal point algorithm in the context of solving a class of nonlinear inclusions is examined. Furthermore, some results on general firm nonexpansiveness and resolvent mapping corresponding to (H, eta)-monotonicity are given. (c) 2006 Elsevier Ltd. All rights reserved.

Journal Title

Mathematical and Computer Modelling

Volume

45

Issue/Number

9-10

Publication Date

1-1-2007

Document Type

Article

Language

English

First Page

1214

Last Page

1230

WOS Identifier

WOS:000245321200016

ISSN

0895-7177

Share

COinS