# Generalized Eckstein–Bertsekas proximal point algorithm based on [formula omitted]-maximal monotonicity design

- Authors
- Journal
- Computers & Mathematics with Applications 0898-1221
- Publisher
- Elsevier
- Publication Date
- Volume
- 56
- Issue
- 7
- Identifiers
- DOI: 10.1016/j.camwa.2008.04.026
- Keywords
- Disciplines

## Abstract

Abstract A general design for the Eckstein–Bertsekas proximal point algorithm, using the notion of the A -maximal monotonicity, is developed. Convergence analysis for the generalized Eckstein–Bertsekas proximal point algorithm in the context of solving a class of nonlinear inclusion problems is explored. Some auxiliary results of interest involving A -maximal monotone mappings are also included. The obtained results generalize investigations on general maximal monotonicity and beyond.

## There are no comments yet on this publication. Be the first to share your thoughts.