An Inexact Proximal Point Method for Solving Generalized Fractional Programs

Jean-Jacques Strodiot, Jean-Pierre Crouzeix, Jacques A. Ferland, Van Hien Nguyen

Research output: Contribution to journalArticle


In this paper, we present several new implementable methods for solving a generalized fractional program with convex data. They are Dinkelbach-type methods where a prox-regularization term is added to avoid the numerical difficulties arising when the solution of the problem is not unique. In these methods, at each iteration a regularized parametric problem is solved inexactly to obtain an approximation of the optimal value of the problem. Since the parametric problem is nonsmooth and convex, we propose to solve it by using a classical bundle method where the parameter is updated after each ‘serious step’. We mainly study two kinds of such steps, and we prove the convergence and the rate of convergence of each of the corresponding methods. Finally, we present some numerical experience to illustrate the behavior of the proposed algorithms, and we discuss the practical efficiency of each one.
Original languageEnglish
Pages (from-to)121-138
JournalJournal of Global Optimization
Publication statusUnpublished - 2008


Dive into the research topics of 'An Inexact Proximal Point Method for Solving Generalized Fractional Programs'. Together they form a unique fingerprint.

Cite this