Convergence of prox-regularization methods for generalized fractional programming
RAIRO - Operations Research - Recherche Opérationnelle, Volume 36 (2002) no. 1, p. 73-94

We analyze the convergence of the prox-regularization algorithms introduced in [1], 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 [1]. 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 [1].

DOI : https://doi.org/10.1051/ro:2002006
Keywords: generalized fractional programs, Dinkelbach-type algorithms, proximal point algorithm, rate of convergence
@article{RO_2002__36_1_73_0,
     author = {Roubi, Ahmed},
     title = {Convergence of prox-regularization methods for generalized fractional programming},
     journal = {RAIRO - Operations Research - Recherche Op\'erationnelle},
     publisher = {EDP-Sciences},
     volume = {36},
     number = {1},
     year = {2002},
     pages = {73-94},
     doi = {10.1051/ro:2002006},
     zbl = {1103.90401},
     mrnumber = {1920380},
     language = {en},
     url = {http://www.numdam.org/item/RO_2002__36_1_73_0}
}
Roubi, Ahmed. Convergence of prox-regularization methods for generalized fractional programming. RAIRO - Operations Research - Recherche Opérationnelle, Volume 36 (2002) no. 1, pp. 73-94. doi : 10.1051/ro:2002006. http://www.numdam.org/item/RO_2002__36_1_73_0/

[1] M. Gugat, Prox-Regularization Methods for Generalized Fractional Programming. J. Optim. Theory Appl. 99 (1998) 691-722. | MR 1657967 | Zbl 0973.90078

[2] J.-P. Crouzeix, J.A. Ferland and S. Schaible, An Algorithm for Generalized Fractional Programs. J. Optim. Theory Appl. 47 (1985) 35-49. | MR 802388 | Zbl 0548.90083

[3] J.-P. Crouzeix, J.A. Ferland and S. Schaible, Note on an Algorithm for Generalized Fractional Programs. J. Optim. Theory Appl. 50 (1986) 183-187. | MR 851133 | Zbl 0573.90090

[4] W. Dinkelbach, On Nonlinear Fractional Programming. Management Sci. 13 (1967) 492-498. | MR 242488 | Zbl 0152.18402

[5] A. Roubi, Method of Centers for Generalized Fractional Programming. J. Optim. Theory Appl. 107 (2000) 123-143. | MR 1800932 | Zbl 0964.90045

[6] B. Martinet, Régularisation d'Inéquations Variationnelles par Approximation Successives. RAIRO: Oper. Res. 4 (1970) 154-158. | Numdam | Zbl 0215.21103

[7] R.T. Rockafellar, Monotone Operators and the Proximal Point Algorithm. SIAM J. Control Optim. 14 (1976) 877-898. | MR 410483 | Zbl 0358.90053

[8] O. Güler, On the Convergence of the Proximal Point Algorithm for Convex Minimization. SIAM J. Control Optim. 29 (1991) 403-419. | MR 1092735 | Zbl 0737.90047

[9] A. Kaplan and R. Tichatschke, Stable Methods for Ill-Posed Variational Problems. Akademic Verlag, Berlin, Germany (1994). | MR 1279379 | Zbl 0804.49011

[10] C. Lemaréchal and C. Sagastizábal, Practical Aspects of the Moreau-Yosida Regularization: Theoretical Preliminaries. SIAM J. Optim. 7 (1997) 367-385. | Zbl 0876.49019

[11] I. Ekeland and R. Temam, Analyse Convexe et Problèmes Variationnels. Gauthier-Villars, Paris, Bruxelles, Montréal (1974). | MR 463993 | Zbl 0281.49001

[12] J.V. Burke and M.C. Ferris, Weak Sharp Minima in Mathematical Programming. SIAM J. Control Optim. 31 (1993) 1340-1359. | MR 1234006 | Zbl 0791.90040

[13] O. Cornejo, A. Jourani and C. Zalinescu, Conditioning and Upper-Lipschitz Inverse Subdifferentials in Nonsmooth Optimization Problems. J. Optim. Theory Appl. 95 (1997) 127-148. | MR 1477353 | Zbl 0890.90164