论文信息 - Generalized Cheney-Loeb-Dinkelbach-Type Algorithms

Generalized Cheney-Loeb-Dinkelbach-Type Algorithms

We present a class of generalized Cheney-Loeb-Dinkelbach-type (i.e. DC-type) algorithms, together with the problems they solve, and discuss convergence properties. Our algorithms, which are as simple as the DC one, are applicable to classes of programs larger than fractional. In two particular cases, the first being an essentially max-min problem and the second a Pareto extremum, we prove 1.61 and second order convergence respectively. Applications are given to extended fractional max-min and fractional Pareto extremum problems.

Jacob Flachs | J. Flachs

[1] W. Hogan. Point-to-Set Maps in Mathematical Programming , 1973 .

[2] A. Ralston. A first course in numerical analysis , 1965 .

[3] E. Cheney. Introduction to approximation theory , 1966 .

[4] Anthony V. Fiacco,et al. Sensitivity analysis for nonlinear programming using penalty methods , 1976, Math. Program..

[5] H. L. Loeb,et al. Two new algorithms for rational approximation , 1961 .

[6] M. J. D. Powell,et al. The Differential Correction Algorithm for Rational $\ell _\infty $-Approximation , 1972 .

[7] S. Schaible. Fractional Programming. II, On Dinkelbach's Algorithm , 1976 .

[8] Jacques A. Ferland,et al. A note on an algorithm for generalized fractional programs , 1986 .

[9] Stephen M. Robinson,et al. Perturbed Kuhn-Tucker points and rates of convergence for a class of nonlinear-programming algorithms , 1974, Math. Program..

[10] Werner Dinkelbach. On Nonlinear Fractional Programming , 1967 .