3 citations · 5 across the 7 of their papers we have counts for
Showing 2018 · math.OCShow all
3 papers · 2 filters
math.OC2018
Algorithms for finding global and local equilibrium points of Nash-Cournot equilibrium models involving concave cost
Le Dung Muu, Nguyen Van Quy
We consider Nash-Cournot oligopolistic equilibrium models involving separable concave cost functions. In contrast to the models with linear and convex cost functions, in these mode…
math.OC2018
A splitting algorithm for fixed points of nonexpansive mappings and equilibrium problems
Le Dung Muu, Xuan Thanh Le
We consider the problem of finding a fixed point of a nonexpansive mapping, which is also a solution of a pseudo-monotone equilibrium problem, where the bifunction in the equilibri…
math.OC2018
Splitting gradient algorithms for solving monotone equilibrium problems
Le Dung Muu, Phung Minh Duc, Xuan Thanh Le
It is well known that the projection method is not convergent for monotone equilibrium problems. Recently Sosa \textit{et al.} in \cite{SS2011} proposed a projection algorithm ensu…