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

DOI10.1007/BF00936164zbMath0517.90061MaRDI QIDQ1053602

J. G. Ecker, Richard S. Sacher, Michael Kupferschmid

Publication date: 1984

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

zbMATH Keywords

robustnessapproximate solutionsefficiencyellipsoid algorithmaccuracycomputational comparisonsgeneralized reduced gradient algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Methods of reduced gradient type (90C52) Mathematical programming (90C99)

Related Items (2)

Un algoritmo de programacion geometrica basado en funciones penalidad-multiplicadoras ⋮ Investigation of path-following algorithms for signomial geometric programming problems

Uses Software

• NAG
• nag

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Solving geometric programs using GRG: Results and comparisons
• An ellipsoid algorithm for nonlinear programming
• The Cutting-Plane Method for Solving Convex Programs
• On the computational utility of posynomial geometric programming solution methods
• A Geometric Programming Model for Optimal Allocation of Stream Dissolved Oxygen
• A set of geometric programming test problems and their solutions
• Design and Testing of a Generalized Reduced Gradient Code for Nonlinear Programming
• Linearizing Geometric Programs

This page was built for publication: Comparison of a special-purpose algorithm with general-purpose algorithms for solving geometric programming problems