A comparison of computational strategies for geometric programs

DOI10.1007/BF00933403zbMath0369.90123OpenAlexW2021890679MaRDI QIDQ1243253

M. J. Rijckaert, P. V. L. N. Sarma, X. M. Martens, 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)

Related Items

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

Cites Work

• Unnamed Item
• Unnamed Item
• Geometric programming with signomials
• The Cutting-Plane Method for Solving Convex Programs
• The Convex Simplex Method
• Duality Theory for Geometric Programming
• Linearizing Geometric Programs
• Geometric programs treated with slack variables +