Prox-regularization methods for generalized fractional programming

If a fractional program does not have a unique solution or the feasible set is unbounded, numerical difficulties can occur. By using a prox-regularization method that generates a sequence of auxiliary problems with unique solutions, these difficulties are avoided. Two regularization methods are introduced here. They are based on Dinkelbach-type algorithms for generalized fractional programming, but use a regularized parametric auxiliary problem. Convergence results and numerical examples are presented.