A comparison of computational strategies for geometric programs

DOI10.1007/BF00933403MaRDI QIDQ1243253zbMATH OpenOpenAlexFDO

Authors P. V. L. N. Sarma, X. M. Martens, M. J. Rijckaert, Gintaras V. Reklaitis

Publication date 1978

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

Full work available at URL https://doi.org/10.1007/bf00933403

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Cites work

• Duality Theory for Geometric Programming
• Geometric programming with signomials
• Geometric programs treated with slack variables +
• scientific article; zbMATH DE number 3301979 (Why is no real title available?)
• scientific article; zbMATH DE number 3310599 (Why is no real title available?)
• Linearizing Geometric Programs
• The Convex Simplex Method
• The Cutting-Plane Method for Solving Convex Programs

Cited in

(6)

• Convexity of products of univariate functions and convexification transformations for geometric programming
• A cutting-plane algorithm with linear and geometric rates of convergence
• Linearly constrained estimation by mathematical programming
• Un algoritmo de programacion geometrica basado en funciones penalidad-multiplicadoras
• On the computational utility of posynomial geometric programming solution methods
• A second order affine scaling algorithm for the geometric programming dual with logarithmic barrier

This page was built for publication: A comparison of computational strategies for geometric programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1243253)