Convergence analysis of new construction explicit methods for solving equilibrium programming and fixed point problems
Summary: In this paper, we present improved iterative methods for evaluating the numerical solution of an equilibrium problem in a Hilbert space with a pseudomonotone and a Lipschitz-type bifunction. The method is built around two computing phases of a proximal-like mapping with inertial terms. Many such simpler step size rules that do not involve line search are examined, allowing the technique to be enforced more effectively without knowledge of the Lipschitz-type constant of the cost bifunction. When the control parameter conditions are properly defined, the iterative sequences converge weakly on a particular solution to the problem. We provide weak convergence theorems without knowing the Lipschitz-type bifunction constants. A few numerical tests were performed, and the results demonstrated the appropriateness and rapid convergence of the new methods over traditional ones.
- Equilibrium programming and new iterative methods in Hilbert spaces
- Weak convergence and strong convergence of nonmonotonic explicit iterative methods for solving equilibrium problems
- Convergence analysis of a general inertial projection-type method for solving pseudomonotone equilibrium problems with applications
- On solving pseudomonotone equilibrium problems via two new extragradient-type methods under convex constraints
- A modified explicit iterative techniques for solving equilibrium problems
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A new Popov's subgradient extragradient method for two classes of equilibrium programming in a real Hilbert space
- A New Projection Method for Variational Inequality Problems
- An inertial proximal method for maximal monotone operators via discretization of a nonlinear oscillator with damping
- An inertial-like proximal algorithm for equilibrium problems
- Application of the proximal point method to nonmonotone equilibrium problems
- Approximating fixed points of nonexpansive mappings by the Ishikawa iteration process
- Construction of fixed points of nonlinear mappings in Hilbert space
- Convergence of an adaptive penalty scheme for finding constrained equilibria
- Convex analysis and monotone operator theory in Hilbert spaces
- Dual extragradient algorithms extended to equilibrium problems
- Equilibrium models and variational inequalities.
- Equilibrium points in n -person games
- Equilibrium programming using proximal-like algorithms
- Existence and solution methods for equilibria
- Existence of an Equilibrium for a Competitive Economy
- Extragradient algorithms extended to equilibrium problems¶
- Generalized monotone bifunctions and equilibrium problems
- scientific article; zbMATH DE number 3901504 (Why is no real title available?)
- scientific article; zbMATH DE number 1090020 (Why is no real title available?)
- scientific article; zbMATH DE number 2202892 (Why is no real title available?)
- scientific article; zbMATH DE number 3278986 (Why is no real title available?)
- Inertial extragradient algorithms for solving equilibrium problems
- Inertial projection and contraction algorithms for variational inequalities
- Modified extragradient algorithms for solving equilibrium problems
- Modified Popov's explicit iterative algorithms for solving pseudomonotone equilibrium problems
- New extragradient methods with non-convex combination for pseudomonotone equilibrium problems with applications in Hilbert spaces
- Non-cooperative games
- On the proximal point method for equilibrium problems in Hilbert spaces
- Some methods of speeding up the convergence of iteration methods
- The extragradient algorithm with inertial effects extended to equilibrium problems
- The inertial iterative extragradient methods for solving pseudomonotone equilibrium programming in Hilbert spaces
- The iterative methods for solving pseudomontone equilibrium problems
- The subgradient extragradient method extended to pseudomonotone equilibrium problems and fixed point problems in Hilbert space
- The subgradient extragradient method for pseudomonotone equilibrium problems
- The subgradient extragradient method for solving variational inequalities in Hilbert space
- Weak convergence of explicit extragradient algorithms for solving equilibrium problems
- Weak convergence of the sequence of successive approximations for nonexpansive mappings
This page was built for publication: Convergence analysis of new construction explicit methods for solving equilibrium programming and fixed point problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2158407)
