Accelerated non-monotonic explicit proximal-type method for solving equilibrium programming with convex constraints and its applications

DOI10.3934/MATH.2021622MaRDI QIDQ2671103zbMATH OpenOpenAlexFDO

Authors Pongsakorn Yotkaew, Nopparat Wairojjana, Nuttapol Pakkaranang

Publication date 3 June 2022

Published in AIMS Mathematics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.3934/math.2021622

zbMATH Keywords

strong convergencevariational inequalitiesequilibrium problemfixed point problemsLipschitz-type condition

Mathematics Subject Classification ID

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)

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

Cites work

• scientific article; zbMATH DE number 3901504 (Why is no real title available?)
• scientific article; zbMATH DE number 3534286 (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?)
• A new modified subgradient extragradient algorithm extended for equilibrium problems with application in fixed point problems
• A new weak convergence non-monotonic self-adaptive iterative scheme for solving equilibrium problems
• Another control condition in an iterative method for nonexpansive mappings
• Construction of fixed points of nonlinear mappings in Hilbert space
• Convergence analysis of a general inertial projection-type method for solving pseudomonotone equilibrium problems with applications
• Convergence of an adaptive penalty scheme for finding constrained equilibria
• Equilibrium models and variational inequalities.
• Equilibrium points in n -person games
• Equilibrium programming using proximal-like algorithms
• Existence of an Equilibrium for a Competitive Economy
• Extragradient algorithms extended to equilibrium problems¶
• Finite-Dimensional Variational Inequalities and Complementarity Problems
• Generalized monotone bifunctions and equilibrium problems
• Inertial extragradient algorithms for solving equilibrium problems
• Modified inertial subgradient extragradient algorithms for pseudomonotone equilibrium problems with the constraint of nonexpansive mappings
• Modified proximal-like extragradient methods for two classes of equilibrium problems in Hilbert spaces with applications
• Non-cooperative games
• Projection methods with alternating inertial steps for variational inequalities: weak and linear convergence
• Some methods of speeding up the convergence of iteration methods
• Strong convergence of projected subgradient methods for nonsmooth and nonstrictly convex minimization
• Strongly convergent algorithms by using new adaptive regularization parameter for equilibrium problems
• The subgradient extragradient method for solving variational inequalities in Hilbert space
• Two new extragradient methods for solving equilibrium problems
• Viscosity-type method for solving pseudomonotone equilibrium problems in a real Hilbert space with applications
• Weak convergence and strong convergence of nonmonotonic explicit iterative methods for solving equilibrium problems

Cited in

(6)

• Three novel two-step proximal-like methods for solving equilibrium and fixed point problems in real Hilbert spaces
• A nonmonotonic explicit proximal-like method for solving equilibrium programming with convex constraints
• 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)