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

DOI10.1007/BF00940767zbMATH Open0548.90065OpenAlexW1998077069MaRDI QIDQ799488FDOQ799488

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

nondifferentiabilitysubgradientscomputational experienceposynomial geometric programmingprimal and dual cutting plane algorithms

Mathematics Subject Classification ID

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

Cites Work

• Convex Analysis
• The Cutting-Plane Method for Solving Convex Programs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Reversed geometric programming: A branch-and-bound method involving linear subproblems
• A modified reduced gradient method for dual posynomial programming

Cited In (3)

• A nontangential cutting plane algorithm
• A new two-level linear relaxed bound method for geometric programming problems
• On geometric programming and complementary slackness

   Recommendations

• An infeasible interior-point algorithm for solving primal and dual geometric programs 👍 👎
• Infeasible interior-point algorithm based optimization method for geometric programming 👍 👎
• Title not available (Why is that?) 👍 👎
• A new algorithm for geometric programming based on the linear structure of its dual problem. 👍 👎
• Posynomial geometric programming as a special case of semi-infinite linear programming 👍 👎

This page was built for publication: A comparison between a primal and a dual cutting plane algorithm for posynomial geometric programming problems

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