Interior Proximal Algorithm for Quasiconvex Programming Problems and Variational Inequalities with Linear Constraints
In this paper, we propose two interior proximal algorithms inspired by the logarithmic-quadratic proximal method. The first method we propose is for general linearly constrained quasiconvex minimization problems. For this method, we prove global convergence when the regularization parameters go to zero. The latter assumption can be dropped when the function is assumed to be pseudoconvex. We also obtain convergence results for quasimonotone variational inequalities, which are more general than monotone ones.
proximal algorithm variational inequalities quasiconvex function quasiconvex linearly constrained problems quasimonotone operator