A minimization algorithm for equilibrium problems with polyhedral constraints
J. X. Cruz Neto, Jurandir O. Lopes, P. A. Soares · Optimization · 2015
Our aim in this paper is to study an infeasible interior proximal method for solving equilibrium problems with polyhedral constrains in a quasiconvex setting. Under mild assumptions, we show that the sequence generated by our algorithm is well defined and it converges to a solution of the problem when regularization parameters converge to zero.