A Bregman projection algorithm with self adaptive step sizes for split variational inequality problems involving non-Lipschitz operators

DOI10.23952/JNVA.8.2024.3.04MaRDI QIDQ6561483zbMATH OpenFDO

Authors Liya Liu, Sun Young Cho

Publication date 25 June 2024

Published in Journal of Nonlinear and Variational Analysis (Search for Journal in Brave)

zbMATH Keywords

Bregman projectionpseudomonotone operatorsplit variational inequality problemline search ruleTseng's extragradient method

Mathematics Subject Classification ID

Functional analysis (46-XX) Operator theory (47-XX)

Cites work

• scientific article; zbMATH DE number 5653524 (Why is no real title available?)
• scientific article; zbMATH DE number 3534286 (Why is no real title available?)
• scientific article; zbMATH DE number 7282700 (Why is no real title available?)
• scientific article; zbMATH DE number 3296905 (Why is no real title available?)
• scientific article; zbMATH DE number 3200865 (Why is no real title available?)
• A Modified Forward-Backward Splitting Method for Maximal Monotone Mappings
• A multiprojection algorithm using Bregman projections in a product space
• A new Bregman projection method for solving variational inequalities in Hilbert spaces
• A new method for solving split variational inequality problems without co-coerciveness
• A new projection and contraction method for solving split monotone variational inclusion, pseudomonotone variational inequality, and common fixed point problems
• A relaxed projection method for split variational inequalities
• A strongly convergent modified Halpern subgradient extragradient method for solving the split variational inequality problem
• Algorithms for the split variational inequality problem
• An improved inertial extragradient subgradient method for solving split variational inequality problems
• An interior point method with Bregman functions for the variational inequality problem with paramonotone operators
• Analysis of two versions of relaxed inertial algorithms with Bregman divergences for solving variational inequalities
• Bregman distances and Chebyshev sets
• Bregman distances, totally convex functions, and a method for solving operator equations in Banach spaces
• Convergence of the modified extragradient method for variational inequalities with non-Lipschitz operators
• Convex Analysis
• INEXACT VERSIONS OF PROXIMAL POINT AND AUGMENTED LAGRANGIAN ALGORITHMS IN BANACH SPACES
• Inertial methods for finding minimum-norm solutions of the split variational inequality problem beyond monotonicity
• Iterative Algorithms for Nonlinear Operators
• Iterative methods for approximating fixed points of Bregman nonexpansive operators
• Iterative oblique projection onto convex sets and the split feasibility problem
• Modified Tseng's extragradient methods with self-adaptive step size for solving bilevel split variational inequality problems
• New Bregman projection algorithms for solving the split feasibility problem
• New Bregman projection methods for solving pseudo-monotone variational inequality problem
• Pseudo-monotone complementarity problems in Hilbert space
• Simple and optimal methods for stochastic variational inequalities. I: Operator extrapolation
• Strong convergence of projected subgradient methods for nonsmooth and nonstrictly convex minimization
• Strong convergence of self-adaptive inertial algorithms for solving split variational inclusion problems with applications
• The subgradient extragradient method for solving variational inequalities in Hilbert space
• Two Bregman projection methods for solving variational inequalities
• Weak sharpness and finite convergence for solutions of nonsmooth variational inequalities in Hilbert spaces

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)