A nonmonotonic explicit proximal-like method for solving equilibrium programming with convex constraints
From MaRDI portal
Publication:5053404
DOI10.22034/KJM.2022.263701.2113MaRDI QIDQ5053404FDOQ5053404
Authors: Nuttapol Pakkaranang, Kanikar Muangchoo, Nattawut Pholasa, Nopparat Wairojjana 
Publication date: 6 December 2022
Recommendations
- Accelerated non-monotonic explicit proximal-type method for solving equilibrium programming with convex constraints and its applications
- 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
- Weak convergence and strong convergence of nonmonotonic explicit iterative methods for solving equilibrium problems
- Equilibrium programming and new iterative methods in Hilbert spaces
Parallel numerical computation (65Y05) Fixed-point theorems (47H10) Numerical methods for variational inequalities and related problems (65K15) Parallel algorithms in computer science (68W10)
Cites Work
- Convex analysis and monotone operator theory in Hilbert spaces
- Non-cooperative games
- Equilibrium points in n -person games
- 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?)
- Another control condition in an iterative method for nonexpansive mappings
- Title not available (Why is that?)
- Mean Value Methods in Iteration
- 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?)
- Title not available (Why is that?)
- Strongly convergent algorithms by using new adaptive regularization parameter for equilibrium problems
- Halpern subgradient extragradient method extended to 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
- A new weak convergence non-monotonic self-adaptive iterative scheme for solving equilibrium problems
- Two strongly convergent methods governed by pseudo-monotone bi-function in a real Hilbert space with applications
- 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 new two-step proximal algorithm of solving the problem of equilibrium programming
- 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
- Shooting method for solving equilibrium programming problems
- Accelerated non-monotonic explicit proximal-type method for solving equilibrium programming with convex constraints and its applications
- Title not available (Why is that?)
This page was built for publication: A nonmonotonic explicit proximal-like method for solving equilibrium programming with convex constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5053404)
