首页 | 本学科首页   官方微博 | 高级检索  
     检索      


A minimization algorithm for equilibrium problems with polyhedral constraints
Authors:JX Cruz Neto  JO Lopes  PA Soares Jr
Institution:1. CCN, DM, Universidade Federal do Piauí, Terezina, Brazil.jxavier@ufpi.edu.br;3. CCN, DM, Universidade Federal do Piauí, Terezina, Brazil.;4. CCN, DM, Universidade Estadual do Piauí, Terezina, Brazil.
Abstract: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.
Keywords:equilibrium problem  infeasible interior proximal point method  second-order homogeneous distances  generalized convexity
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号