A descent method with inexact linear search for nonsmooth equilibrium problems equilibrium problem. It uses the procedure of inexact linear search of the Armijo type. The proposed method
A descent method with inexact linear search for nonsmooth equilibrium problems equilibrium problem. It uses the procedure of inexact linear search of the Armijo type. The proposed method
A Subgradient Projection Method for Set-Valued Network Equilibrium ProblemsIn the present work, we describe a general set-valued variant of the network
equilibrium problem Combined relaxation method for mixed equilibrium problems nonsmooth bifunction. Such mixed
equilibrium problems are solved with a combined relaxation method using
D-gap functions and descent methods for a class of monotone equilibrium problemsWe consider a general class of monotone
equilibrium problems, which involve
nonsmooth convex
Combined relaxation method for mixed equilibrium problems nonsmooth bifunction. Such mixed
equilibrium problems are solved with a combined relaxation method using
D-gap functions and descent methods for a class of monotone equilibrium problemsWe consider a general class of monotone
equilibrium problems, which involve
nonsmooth convex
Nonsmooth penalty and subgradient algorithms to solve the problem of projection onto a polytopeNonsmooth penalty and subgradient algorithms to solve the
problem of projection onto a polytope