Accelerated non-monotonic explicit proximal-type method for solving equilibrium programming with convex constraints and its applications
DOI10.3934/MATH.2021622OpenAlexW3183794570MaRDI QIDQ2671103FDOQ2671103
Authors: Pongsakorn Yotkaew, Nopparat Wairojjana, Nuttapol Pakkaranang 
Publication date: 3 June 2022
Published in: AIMS Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/math.2021622
Recommendations
- A nonmonotonic explicit proximal-like method for solving equilibrium programming with convex constraints
- A new explicit extragradient method for solving equilibrium problems with convex constraints
- A new two-step proximal algorithm of solving the problem of equilibrium programming
- Equilibrium programming and new iterative methods in Hilbert spaces
- Modified proximal-like extragradient methods for two classes of equilibrium problems in Hilbert spaces with applications
strong convergencevariational inequalitiesequilibrium problemfixed point problemsLipschitz-type condition
Parallel numerical computation (65Y05) Monotone operators and generalizations (47H05) Iterative procedures involving nonlinear operators (47J25) Numerical methods for variational inequalities and related problems (65K15) Parallel algorithms in computer science (68W10)
Cites Work
- Non-cooperative games
- Equilibrium points in n -person games
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Construction of fixed points of nonlinear mappings in Hilbert space
- Strong convergence of projected subgradient methods for nonsmooth and nonstrictly convex minimization
- Generalized monotone bifunctions and equilibrium problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Another control condition in an iterative method for nonexpansive mappings
- The subgradient extragradient method for solving variational inequalities in Hilbert space
- Title not available (Why is that?)
- Existence of an Equilibrium for a Competitive Economy
- Equilibrium programming using proximal-like algorithms
- Convergence of an adaptive penalty scheme for finding constrained equilibria
- Extragradient algorithms extended to equilibrium problems¶
- Equilibrium models and variational inequalities.
- Title not available (Why is that?)
- Some methods of speeding up the convergence of iteration methods
- Strongly convergent algorithms by using new adaptive regularization parameter for equilibrium problems
- Projection methods with alternating inertial steps for variational inequalities: weak and linear convergence
- Inertial extragradient algorithms for solving equilibrium problems
- Two new extragradient methods for solving equilibrium problems
- Modified proximal-like extragradient methods for two classes of equilibrium problems in Hilbert spaces with applications
- Convergence analysis of a general inertial projection-type method for solving pseudomonotone equilibrium problems with applications
- Viscosity-type method for solving pseudomonotone equilibrium problems in a real Hilbert space with applications
- Modified inertial subgradient extragradient algorithms for pseudomonotone equilibrium problems with the constraint of nonexpansive mappings
- A new weak convergence non-monotonic self-adaptive iterative scheme for solving equilibrium problems
- Weak convergence and strong convergence of nonmonotonic explicit iterative methods for solving equilibrium problems
- A new modified subgradient extragradient algorithm extended for equilibrium problems with application in fixed point problems
Cited In (6)
- A nonmonotonic explicit proximal-like method for solving equilibrium programming with convex constraints
- Three novel two-step proximal-like methods for solving equilibrium and fixed point problems in real Hilbert spaces
- A new two-step proximal algorithm of solving the problem of equilibrium programming
- An accelerated monotonic convergent algorithm for a class of non-Lipschitzian NCP\((F)\) involving an \(M\)-matrix
- A new explicit extragradient method for solving equilibrium problems with convex constraints
- A two-step proximal point algorithm for nonconvex equilibrium problems with applications to fractional programming
This page was built for publication: Accelerated non-monotonic explicit proximal-type method for solving equilibrium programming with convex constraints and its applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2671103)
