DC auxiliary principle methods for solving lexicographic equilibrium problems.

In this paper, we present DC (difference of convex functions) auxiliary principle methods for solving lexicographic equilibrium problems. Under the strongly monotone and Lipchitz-type assumptions of the cost bifunction, we study the convergence of the sequence generated by the proposed algorithms to a unique solution of the considered lexicographic equilibrium problem. Moreover, we also study the asymptotic behavior of the algorithm for solving the considered problem under the presence of computational errors. Finally, we give some numerical experiments to illustrate the behaviour of the proposed algorithms and provide their comparison with some known algorithms. [ABSTRACT FROM AUTHOR]