On solving a primal geometric program by partial dual optimization

DOI10.1007/BF01584252zbMath0467.90060OpenAlexW1996413735MaRDI QIDQ3921005

Eric Rosenberg

Publication date: 1981

Published in: Mathematical Programming (Search for Journal in Brave)

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

zbMATH Keywords

posynomial geometric programmingconvergent dual algorithmdual solution estimatedual-to-primal conversion methodpartial dual optimizationprimal geometric programprimal solution estimate

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Duality theory (optimization) (49N15) Mathematical programming (90C99)

Related Items (6)

Controlled dual perturbations for posynomial programs ⋮ The complexity of routing in~hierarchical PNNI networks ⋮ A second order affine scaling algorithm for the geometric programming dual with logarithmic barrier ⋮ Optimal module sizing in VLSI floorplanning by nonlinear programming ⋮ An iteratively approximated gradient projection algorithm for sparse signal reconstruction ⋮ Three or four levels of hierarchy minimize hydraulic power in leaves with pinnate dendritic venation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Dual to primal conversion in geometric programming
• Second order algorithms for the posynomial geometric programming dual, part I: Analysis
• Numerically stable methods for quadratic programming
• A numerical study of multiplier methods for constrained parameter optimization
• Linearizing Geometric Programs

This page was built for publication: On solving a primal geometric program by partial dual optimization