Dual to primal conversion in geometric programming

DOI10.1007/BF00933405MaRDI QIDQ1243250zbMATH OpenOpenAlexFDO

Authors Ron S. Dembo

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/bf00933405

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Cites work

• scientific article; zbMATH DE number 3272827 (Why is no real title available?)
• Dual to primal conversion in geometric programming

Cited in

(14)

• Current state of the art of algorithms and computer software for geometric programming
• Controlled dual perturbations for posynomial programs
• An infeasible interior-point algorithm for solving primal and dual geometric programs
• A globally convergent primal-dual interior point algorithm for convex programming
• On the computational utility of posynomial geometric programming solution methods
• Using branch-and-bound to solve bi-level geometric programming problems: A new optimization model
• Sensitivity analysis in geometric programming
• On solving a primal geometric program by partial dual optimization
• Dual to primal conversion in geometric programming
• Sensitivity analysis in geometric programming: Theory and computations
• On subsidiary problems in geometric programming
• A second order affine scaling algorithm for the geometric programming dual with logarithmic barrier
• Second order algorithms for the posynomial geometric programming dual, part I: Analysis
• Sensitivity analysis in posynomial geometric programming

This page was built for publication: Dual to primal conversion in geometric programming

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