Volume 36, Number 1, January-March 2002
|Page(s)||73 - 94|
|Published online||15 July 2002|
Convergence of Prox-Regularization Methods for Generalized Fractional Programming
Faculté des Sciences et Techniques, Département
de Mathématiques et Informatique, Route de Casablanca, BP. 577, Settat,
We analyze the convergence of the prox-regularization algorithms introduced in , to solve generalized fractional programs, without assuming that the optimal solutions set of the considered problem is nonempty, and since the objective functions are variable with respect to the iterations in the auxiliary problems generated by Dinkelbach-type algorithms DT1 and DT2, we consider that the regularizing parameter is also variable. On the other hand we study the convergence when the iterates are only ηk-minimizers of the auxiliary problems. This situation is more general than the one considered in . We also give some results concerning the rate of convergence of these algorithms, and show that it is linear and some times superlinear for some classes of functions. Illustrations by numerical examples are given in .
Key words: Generalized fractional programs / Dinkelbach-type algorithms / proximal point algorithm / rate of convergence.
© EDP Sciences, 2002
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.