𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Convergence of a Dinkelbach-type algorithm in generalized fractional programming

✍ Scribed by J. Borde; J. P. Crouzeix

Publisher
Springer
Year
1987
Tongue
English
Weight
768 KB
Volume
31
Category
Article
ISSN
0340-9422

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A new type of condensation curvilinear p
A new type of condensation curvilinear path algorithm for unconstrained generalized geometric programming
✍ Yanjun Wang; Kecun Zhang; Peiping Shen πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 724 KB

new type of condensation curvilinear path algorithm is proposed for unconstrained generalized geometric programming (GGP). First, a new type of condensation problem is presented based on the special structure of GGP. Then a particular curvilinear path for the problem is constructed, along which we g

Some results of convergence acceleration
Some results of convergence acceleration for a general Ο‘-type algorithm
✍ A. Fdil πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 876 KB

In this paper, we propose a general O-type algorithm for accelerating the convergence of sequences. It generalizes some known sequence transformations such as the O-algorithm, the iterated O2, the iterated A 2, and the T-algorithm. Some general convergence acceleration results are given. Some result