On the convergence of the proximal point algorithm for convex minimization
SIAM Journal on Control and Optimization
Iterative Averaging of Entropic Projections for Solving Stochastic Convex Feasibility Problems
Computational Optimization and Applications
Strong Convergence of Block-Iterative Outer Approximation Methods for Convex Optimization
SIAM Journal on Control and Optimization
A Weak-to-Strong Convergence Principle for Fejé-Monotone Methods in Hilbert Spaces
Mathematics of Operations Research
Bregman Monotone Optimization Algorithms
SIAM Journal on Control and Optimization
On certain conditions for the existence of solutions of equilibrium problems
Mathematical Programming: Series A and B - Nonlinear convex optimization and variational inequalities
A Proximal-Projection Method for Finding Zeros of Set-Valued Operators
SIAM Journal on Control and Optimization
Convex Analysis and Monotone Operator Theory in Hilbert Spaces
Convex Analysis and Monotone Operator Theory in Hilbert Spaces
| Hi-index | 0.00 |
We propose two algorithms for finding (common) zeros of finitely many maximal monotone mappings in reflexive Banach spaces. These algorithms are based on the Bregman distance related to a well-chosen convex function and improve previous results. Finally, we mention two applications of our algorithms for solving equilibrium problems and convex feasibility problems.