Strong convergence theorem for a new Bregman extragradient method with a different line-search process for solving variational inequality problems in reflexive Banach spaces
From MaRDI portal
Publication:6124342
Monotone operators and generalizations (47H05) Fixed-point theorems (47H10) Iterative procedures involving nonlinear operators (47J25) Numerical solutions to equations with nonlinear operators (65J15) Numerical methods for variational inequalities and related problems (65K15) Mathematical programming (90Cxx)
Recommendations
- Strong convergence theorem of Bregman algorithm for solving variational inequalities in Banach spaces
- A new Halpern-type Bregman projection method for solving variational inequality problems in reflexive Banach space
- Inertial Extragradient Method for Solving Variational Inequality and Fixed Point Problems of a Bregman Demigeneralized Mapping in a Reflexive Banach Spaces
- A new Bregman projection method with a self-adaptive process for solving variational inequality problem in reflexive Banach spaces
- A Bregman subgradient extragradient method with self-adaptive technique for solving variational inequalities in reflexive Banach spaces
Cites work
- scientific article; zbMATH DE number 5125723 (Why is no real title available?)
- scientific article; zbMATH DE number 5653524 (Why is no real title available?)
- scientific article; zbMATH DE number 3716008 (Why is no real title available?)
- scientific article; zbMATH DE number 3534286 (Why is no real title available?)
- A Hybrid Extragradient-Viscosity Method for Monotone Operators and Fixed Point Problems
- A Modified Forward-Backward Splitting Method for Maximal Monotone Mappings
- A generalized projection-based scheme for solving convex constrained optimization problems
- A new double-projection method for solving variational inequalities in Banach spaces
- A new low-cost double projection method for solving variational inequalities
- A strong convergence theorem for Tseng's extragradient method for solving variational inequality problems
- Accelerated subgradient extragradient methods for variational inequality problems
- An inertial subgradient extragradient algorithm extended to pseudomonotone equilibrium problems
- An iterative row-action method for interval convex programming
- Analysis of versions of relaxed inertial projection and contraction method
- Convergence analysis for the proximal split feasibility problem using an inertial extrapolation term method
- ESSENTIAL SMOOTHNESS, ESSENTIAL STRICT CONVEXITY, AND LEGENDRE FUNCTIONS IN BANACH SPACES
- Extensions of Korpelevich's extragradient method for the variational inequality problem in Euclidean space
- Extragradient methods for solving non-Lipschitzian pseudo-monotone variational inequalities
- Inertial projection and contraction algorithms for variational inequalities
- Inertial projection-type methods for solving quasi-variational inequalities in real Hilbert spaces
- Iterative Algorithms for Nonlinear Operators
- Iterative algorithms for solving fixed point problems and variational inequalities with uniformly continuous monotone operators
- Korpelevich's method for variational inequality problems in Banach spaces
- Modified inertial Mann algorithm and inertial CQ-algorithm for nonexpansive mappings
- New self-adaptive step size algorithms for solving split variational inclusion problems and its applications
- Note on the modified relaxation CQ algorithm for the split feasibility problem
- Outer approximation methods for solving variational inequalities defined over the solution set of a split convex feasibility problem
- Outer approximation methods for solving variational inequalities in Hilbert space
- Projected reflected gradient methods for monotone variational inequalities
- Re-examination of Bregman functions and new properties of their divergences
- Single Bregman projection method for solving variational inequalities in reflexive Banach spaces
- Single projection algorithm for variational inequalities in Banach spaces with application to contact problem
- Single projection method for pseudo-monotone variational inequality in Hilbert spaces
- Solutions to inexact resolvent inclusion problems with applications to nonlinear analysis and optimization
- Strong convergence of extragradient methods for solving bilevel pseudo-monotone variational inequality problems
- Strong convergence of extragradient methods with a new step size for solving variational inequality problems
- Strong convergence of projected subgradient methods for nonsmooth and nonstrictly convex minimization
- Strong convergence of subgradient extragradient methods for the variational inequality problem in Hilbert space
- Strong convergence of the Halpern subgradient extragradient method for solving variational inequalities in Hilbert spaces
- The subgradient extragradient method for solving variational inequalities in Hilbert space
- Totally convex functions for fixed points computation and infinite dimensional optimization
- Two simple projection-type methods for solving variational inequalities
- Weak and strong convergence theorems for solving pseudo-monotone variational inequalities with non-Lipschitz mappings
Cited in
(3)- An improved subgradient extragradient method with two different parameters for solving variational inequalities in reflexive Banach spaces
- Strong convergence theorem of Bregman algorithm for solving variational inequalities in Banach spaces
- A new Halpern-type Bregman projection method for solving variational inequality problems in reflexive Banach space
This page was built for publication: Strong convergence theorem for a new Bregman extragradient method with a different line-search process for solving variational inequality problems in reflexive Banach spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6124342)
