Sequential splitting algorithms with Bregman distance for solving equilibrium problems
From MaRDI portal
Cites work
- A dynamical system for strongly pseudo-monotone equilibrium problems
- A simple proof of the mean ergodic theorem for nonlinear contractions in Banach spaces
- An iterative row-action method for interval convex programming
- Approximating fixed points of nonexpansive mappings by the Ishikawa iteration process
- Bregman distances, totally convex functions, and a method for solving operator equations in Banach spaces
- Bregman proximal point type algorithms for quasiconvex minimization
- Convergence of Bregman projection methods for solving consistent convex feasibility problems in reflexive Banach spaces
- Convergence theorems of common elements for equilibrium problems and fixed point problems in Banach spaces
- Convex Analysis
- Convex analysis and monotone operator theory in Hilbert spaces
- Equilibrium programming using proximal-like algorithms
- Existence of solutions for nonlinear implicit differential equations: an equilibrium problem approach
- Existence theorems for generalized noncoercive equilibrium problems: The quasi-convex case
- scientific article; zbMATH DE number 2129319 (Why is no real title available?)
- scientific article; zbMATH DE number 1046019 (Why is no real title available?)
- scientific article; zbMATH DE number 1090020 (Why is no real title available?)
- scientific article; zbMATH DE number 2156763 (Why is no real title available?)
- scientific article; zbMATH DE number 3296905 (Why is no real title available?)
- scientific article; zbMATH DE number 7709328 (Why is no real title available?)
- Hybrid proximal-type algorithms for generalized equilibrium problems, maximal monotone operators, and relatively nonexpansive mappings
- Iterative averaging of entropic projections for solving stochastic convex feasibility problems
- Modified extragradient method with Bregman distance for variational inequalities
- Noncoercive mixed equilibrium problems under pseudomonotone perturbations and applications to nonlinear evolution equations with lack of coercivity
- Noncoercive stationary Navier-Stokes equations of heat-conducting fluids modeled by hemivariational inequalities: an equilibrium problem approach
- On the convergence of splitting proximal methods for equilibrium problems in Hilbert spaces
- Proximal minimization algorithm with \(D\)-functions
- Proximal Minimization Methods with Generalized Bregman Functions
- Proximal point method with Bregman distance for quasiconvex pseudomonotone equilibrium problems
- Re-examination of Bregman functions and new properties of their divergences
- Regularized general nonconvex mixed equilibrium problems: predictor-corrector methods and algorithms
- Splitting extragradient-like algorithms for strongly pseudomonotone equilibrium problems
- Splitting extragradient-like algorithms with Bregman distance for solving equilibrium problems
- Totally convex functions for fixed points computation and infinite dimensional optimization
- Two new splitting algorithms for equilibrium problems
- Vector variational inequalities and vector optimization. Theory and applications
Cited in
(4)- On inertial subgradient-like extragradient methods with proximal contraction strategy for variational inequalities
- Adaptive step-size extragradient algorithm with variance reduction for solving mixed variational inequality problems
- Approximation method for solving non-monotone equilibrium problems in Hilbert spaces
- Inertial subgradient projection algorithms for solving splitting equilibrium problems and applications
This page was built for publication: Sequential splitting algorithms with Bregman distance for solving equilibrium problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6963301)
