Journal
JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS
Volume 141, Issue 1, Pages 93-105Publisher
SPRINGER/PLENUM PUBLISHERS
DOI: 10.1007/s10957-008-9499-7
Keywords
Generalized fractional programming; Dinkelbach-type algorithm; Convergence analysis
Ask authors/readers for more resources
We propose a unified framework to study various versions of Dinkelbach-type algorithms for solving the generalized fractional programming problem. Classical algorithms used carefully selected iterate points and incorporated subtle convergence proofs. Our generic algorithm, however, is natural and simple. Moreover, the convergence analysis can be carried out through geometric observations and fundamental properties of convex functions. Consequently, the classical results are either refined or strengthened with new insights.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available