Comparison of a special-purpose algorithm with general-purpose algorithms for solving geometric programming problems

The authors study the performance of four general-purpose nonlinear programming algorithms and one special-purpose geometric programming algorithm when used to solve geometric programming problems. Experiments are reported which show that the special-purpose algorithm GGP often finds approximate sol...

Full description

Saved in:
Bibliographic Details
Published in:Journal of optimization theory and applications 1984-06, Vol.43 (2), p.237-263
Main Authors: Ecker, J. G., Kupferschmid, M., Sacher, R. S.
Format: Article
Language:English
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The authors study the performance of four general-purpose nonlinear programming algorithms and one special-purpose geometric programming algorithm when used to solve geometric programming problems. Experiments are reported which show that the special-purpose algorithm GGP often finds approximate solutions more quickly than the general purpose algorithm GRG2, but is usually not significantly more efficient than GRG2 when greater accuracy is required. However, for some of the most difficult test problems attempted, GGP was dramatically superior to all of the other algorithms. The other algorithms are usually not as efficient as GGP or GRG2. The ellipsoid algorithm is most robust.
ISSN:0022-3239
1573-2878
DOI:10.1007/BF00936164