A Bregman projection algorithm with self adaptive step sizes for split variational inequality problems involving non-Lipschitz operators
From MaRDI portal
Publication:6561483
DOI10.23952/JNVA.8.2024.3.04MaRDI QIDQ6561483
Publication date: 25 June 2024
Published in: Journal of Nonlinear and Variational Analysis (Search for Journal in Brave)
pseudomonotone operatorBregman projectionsplit variational inequality problemline search ruleTseng's extragradient method
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A relaxed projection method for split variational inequalities
- The subgradient extragradient method for solving variational inequalities in Hilbert space
- Algorithms for the split variational inequality problem
- Convergence of the modified extragradient method for variational inequalities with non-Lipschitz operators
- Strong convergence of projected subgradient methods for nonsmooth and nonstrictly convex minimization
- Bregman distances and Chebyshev sets
- An interior point method with Bregman functions for the variational inequality problem with paramonotone operators
- Pseudo-monotone complementarity problems in Hilbert space
- A multiprojection algorithm using Bregman projections in a product space
- Iterative methods for approximating fixed points of Bregman nonexpansive operators
- Weak sharpness and finite convergence for solutions of nonsmooth variational inequalities in Hilbert spaces
- New Bregman projection methods for solving pseudo-monotone variational inequality problem
- A strongly convergent modified Halpern subgradient extragradient method for solving the split variational inequality problem
- Inertial methods for finding minimum-norm solutions of the split variational inequality problem beyond monotonicity
- Bregman distances, totally convex functions, and a method for solving operator equations in Banach spaces
- A new method for solving split variational inequality problems without co-coerciveness
- Strong convergence of self-adaptive inertial algorithms for solving split variational inclusion problems with applications
- An improved inertial extragradient subgradient method for solving split variational inequality problems
- Analysis of two versions of relaxed inertial algorithms with Bregman divergences for solving variational inequalities
- A new projection and contraction method for solving split monotone variational inclusion, pseudomonotone variational inequality, and common fixed point problems
- INEXACT VERSIONS OF PROXIMAL POINT AND AUGMENTED LAGRANGIAN ALGORITHMS IN BANACH SPACES
- Iterative Algorithms for Nonlinear Operators
- Iterative oblique projection onto convex sets and the split feasibility problem
- A Modified Forward-Backward Splitting Method for Maximal Monotone Mappings
- Modified Tseng's extragradient methods with self-adaptive step size for solving bilevel split variational inequality problems
- Two Bregman projection methods for solving variational inequalities
- Simple and Optimal Methods for Stochastic Variational Inequalities, I: Operator Extrapolation
- Convex Analysis
- New Bregman projection algorithms for solving the split feasibility problem
This page was built for publication: A Bregman projection algorithm with self adaptive step sizes for split variational inequality problems involving non-Lipschitz operators
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6561483)