Analysis of two versions of relaxed inertial algorithms with Bregman divergences for solving variational inequalities
From MaRDI portal
Publication:2675768
Recommendations
- Relaxed extragradient iterative methods for variational inequalities
- Convergence of two-stage method with Bregman divergence for solving variational inequalities
- Relaxed inertial Tseng extragradient method for variational inequality and fixed point problems
- Convergence analysis of a relaxed extragradient–proximal point algorithm application to variational inequalities
- scientific article; zbMATH DE number 7753351
- Relaxed extragradient methods for systems of variational inequalities
- A relaxation iterative algorithm for a system of general nonconvex variational inequalities
- Relaxed inertial methods for solving split variational inequality problems without product space formulation
- Convergence of relaxed inertial subgradient extragradient methods for quasimonotone variational inequality problems
- Bregman proximal point algorithm revisited: a new inexact version and its inertial variant
Cites work
- A conjugate gradient method to solve convex constrained monotone equations with applications in compressive sensing
- A Modified Forward-Backward Splitting Method for Maximal Monotone Mappings
- A new Bregman projection method for solving variational inequalities in Hilbert spaces
- A novel inertial projection and contraction method for solving pseudomonotone variational inequality problems
- A variant of korpelevich’s method for variational inequalities with a new search strategy
- A Weak-to-Strong Convergence Principle for Fejér-Monotone Methods in Hilbert Spaces
- Accelerated hybrid and shrinking projection methods for variational inequality problems
- An extragradient algorithm for monotone variational inequalities
- An inertial Popov's method for solving pseudomonotone variational inequalities
- An inertial projection and contraction method with a line search technique for variational inequality and fixed point problems
- An inertial proximal method for maximal monotone operators via discretization of a nonlinear oscillator with damping
- Asymptotic Behavior of Relatively Nonexpansive Operators in Banach Spaces
- Bregman distances and Chebyshev sets
- Bregman distances, totally convex functions, and a method for solving operator equations in Banach spaces
- Clustering with Bregman divergences.
- Convergence of the modified extragradient method for variational inequalities with non-Lipschitz operators
- Convex Analysis
- Convexity of the set of fixed points of a quasi-pseudocontractive type Lipschitz mapping and the shrinking projection method
- Deep neural network structures solving variational inequalities
- Existence and Approximation of Fixed Points of Bregman Firmly Nonexpansive Mappings in Reflexive Banach Spaces
- Fast and simple Bregman projection methods for solving variational inequalities and related problems in Banach spaces
- First-order methods in optimization
- Fixed points of nonexpanding maps
- scientific article; zbMATH DE number 1807400 (Why is no real title available?)
- scientific article; zbMATH DE number 5653524 (Why is no real title available?)
- scientific article; zbMATH DE number 3715314 (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?)
- scientific article; zbMATH DE number 3575377 (Why is no real title available?)
- scientific article; zbMATH DE number 932419 (Why is no real title available?)
- scientific article; zbMATH DE number 3296905 (Why is no real title available?)
- Improved inertial extragradient methods for solving pseudo-monotone variational inequalities
- INEXACT VERSIONS OF PROXIMAL POINT AND AUGMENTED LAGRANGIAN ALGORITHMS IN BANACH SPACES
- Introduction to nonlinear and convex analysis
- Iterative method with inertial terms for nonexpansive mappings: applications to compressed sensing
- Iterative methods for approximating fixed points of Bregman nonexpansive operators
- Modified extragradient method with Bregman distance for variational inequalities
- Modified projection method for strongly pseudomonotone variational inequalities
- Modified Tseng's extragradient methods for solving pseudo-monotone variational inequalities
- On some non-linear elliptic differential functional equations
- On the Convergence of the Proximal Point Algorithm for Convex Minimization
- Pseudo-monotone complementarity problems in Hilbert space
- Relaxed extragradient algorithm for solving pseudomonotone variational inequalities in Hilbert spaces
- Robust solutions to box-constrained stochastic linear variational inequality problem
- Self-adaptive inertial subgradient extragradient algorithm for solving pseudomonotone variational inequalities
- Solving variational inequalities with monotone operators on domains given by linear minimization oracles
- Some methods of speeding up the convergence of iteration methods
- Strong convergence of an extragradient-like algorithm involving pseudo-monotone mappings
- Strong convergence of projected subgradient methods for nonsmooth and nonstrictly convex minimization
- Strong convergence theorems for nonexpansive mappings and nonexpansive semigroups.
- The forward-backward-forward method from continuous and discrete perspective for pseudo-monotone variational inequalities in Hilbert spaces
- The subgradient extragradient method for solving variational inequalities in Hilbert space
- Two modified inertial projection algorithms for bilevel pseudomonotone variational inequalities with applications to optimal control problems
- Versions of the subgradient extragradient method for pseudomonotone variational inequalities
- Viscosity approximation methods for fixed-points problems
- Weak and strong convergence of an inertial proximal method for solving Ky Fan minimax inequalities
Cited in
(15)- A new projection and contraction method for solving split monotone variational inclusion, pseudomonotone variational inequality, and common fixed point problems
- Strong convergence theorem of a new modified Bregman extragradient method to solve fixed point problems and variational inequality problems in general reflexive Banach spaces
- A Bregman projection algorithm with self adaptive step sizes for split variational inequality problems involving non-Lipschitz operators
- Inertial Halpern-type methods for variational inequality with application to medical image recovery
- Three novel inertial subgradient extragradient methods for quasi-monotone variational inequalities in Banach spaces
- Strong convergence of Bregman projection algorithms for solving split feasibility problems
- Modified extragradient methods with inertial technique for solving pseudo-monotone variational inequality problems
- Forward-backward splitting methods with two inertial parameters for solving inclusion problems in Banach spaces
- Convergence analysis of Bregman projection methods with a new extrapolation technique for solving variational inequalities in reflexive Banach spaces
- Strongly convergent two-step inertial subgradient extragradient methods for solving quasi-monotone variational inequalities with applications
- Inertial self-adaptive algorithms with new step size rule for solving split variational inclusion problems in Banach spaces
- Halpern-type Bregman projection algorithms for split variational inequality problems
- Convergence analysis of modified Bregman extragradient method for variational inequality problems
- Inertial projection and contraction methods for solving variational inequalities with applications to image restoration problems
- A new Bregman projection method with line-search process for solving variational inequalities and fixed point problems
This page was built for publication: Analysis of two versions of relaxed inertial algorithms with Bregman divergences for solving variational inequalities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2675768)
