scientific article; zbMATH DE number 3871044
From MaRDI portal
Publication:3337963
Recommendations
- scientific article; zbMATH DE number 3871045
- A new algorithm for geometric programming based on the linear structure of its dual problem.
- Infeasible interior-point algorithm based optimization method for geometric programming
- scientific article; zbMATH DE number 3883959
- New geometric programming algorithms with numerical experiments
Cited in
(17)- Controlled dual perturbations for posynomial programs
- Composite geometric programming
- Posynomial geometric programming as a special case of semi-infinite linear programming
- Infeasible interior-point algorithm based optimization method for geometric programming
- scientific article; zbMATH DE number 3850817 (Why is no real title available?)
- scientific article; zbMATH DE number 3871045 (Why is no real title available?)
- scientific article; zbMATH DE number 4147883 (Why is no real title available?)
- scientific article; zbMATH DE number 3920213 (Why is no real title available?)
- scientific article; zbMATH DE number 3936946 (Why is no real title available?)
- scientific article; zbMATH DE number 3945888 (Why is no real title available?)
- Non-standard posynomial geometric programs
- Information Theoretic Approach to Geometric Programming
- scientific article; zbMATH DE number 773216 (Why is no real title available?)
- scientific article; zbMATH DE number 934402 (Why is no real title available?)
- scientific article; zbMATH DE number 3272827 (Why is no real title available?)
- Geometric Programming for Communication Systems
- A comparison between a primal and a dual cutting plane algorithm for posynomial geometric programming problems
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3337963)
