A comparison between a primal and a dual cutting plane algorithm for posynomial geometric programming problems
From MaRDI portal
(Redirected from Publication:799488)
Recommendations
- An infeasible interior-point algorithm for solving primal and dual geometric programs
- Infeasible interior-point algorithm based optimization method for geometric programming
- scientific article; zbMATH DE number 3871044
- 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
Cites work
- scientific article; zbMATH DE number 3537446 (Why is no real title available?)
- scientific article; zbMATH DE number 3562783 (Why is no real title available?)
- scientific article; zbMATH DE number 3272827 (Why is no real title available?)
- A modified reduced gradient method for dual posynomial programming
- Convex Analysis
- Reversed geometric programming: A branch-and-bound method involving linear subproblems
- The Cutting-Plane Method for Solving Convex Programs
Cited in
(5)
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)