A comparison between a primal and a dual cutting plane algorithm for posynomial geometric programming problems

DOI10.1007/BF00940767zbMath0548.90065OpenAlexW1998077069MaRDI QIDQ799488

F. Cole, Willy Gochet, Yves Smeers

Publication date: 1985

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

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

zbMATH Keywords

computational experiencesubgradientsnondifferentiabilityposynomial geometric programmingprimal and dual cutting plane algorithms

Mathematics Subject Classification ID

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

Related Items

A new two-level linear relaxed bound method for geometric programming problems ⋮ On geometric programming and complementary slackness

Cites Work

• Reversed geometric programming: A branch-and-bound method involving linear subproblems
• A modified reduced gradient method for dual posynomial programming
• The Cutting-Plane Method for Solving Convex Programs
• Convex Analysis
• Unnamed Item
• Unnamed Item
• Unnamed Item