Two Strong Convergence Theorems for a Proximal Method in Reflexive Banach Spaces
Publication:3577998
DOI10.1080/01630560903499852zbMath1200.47085OpenAlexW2048685143MaRDI QIDQ3577998
Publication date: 13 July 2010
Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/01630560903499852
maximal monotone operatorBanach spaceBregman projectionLegendre functionstrong convergence theoremcommon zeroproximal type algorithm
Monotone operators and generalizations (47H05) Iterative procedures involving nonlinear operators (47J25) Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09)
Related Items (only showing first 100 items - show all)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Weak convergence theorems for nonexpansive mappings in Banach spaces
- Strong convergence of contraction semigroups and of iterative methods for accretive operators in Banach spaces
- An iterative row-action method for interval convex programming
- Produits infinis de resolvantes
- Proximal minimization algorithm with \(D\)-functions
- Iterative averaging of entropic projections for solving stochastic convex feasibility problems
- A strongly convergent hybrid proximal method in Banach spaces.
- Projection and proximal point methods: Convergence results and counterexamples.
- Totally convex functions for fixed points computation and infinite dimensional optimization
- Infinite products of resolvents of accretive operators
- Approximating solutions of maximal monotone operators in Hilbert spaces
- Strong convergence theorems for nonexpansive mappings and nonexpansive semigroups.
- An inexact proximal-type algorithm in Banach spaces
- Bregman distances, totally convex functions, and a method for solving operator equations in Banach spaces
- On the Convergence of the Proximal Point Algorithm for Convex Minimization
- Monotone Operators and the Proximal Point Algorithm
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Variational Analysis
- Construction of best Bregman approximations in reflexive Banach spaces
- Strong Convergence of a Proximal-Type Algorithm in a Banach Space
- Bregman Monotone Optimization Algorithms
- ESSENTIAL SMOOTHNESS, ESSENTIAL STRICT CONVEXITY, AND LEGENDRE FUNCTIONS IN BANACH SPACES
- Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
- Strong Convergence of Block-Iterative Outer Approximation Methods for Convex Optimization
- A Proximal-Projection Method for Finding Zeros of Set-Valued Operators
- A Weak-to-Strong Convergence Principle for Fejér-Monotone Methods in Hilbert Spaces
- Weak and strong convergence of solutions to accretive operator inclusions and applications
This page was built for publication: Two Strong Convergence Theorems for a Proximal Method in Reflexive Banach Spaces