On solving a primal geometric program by partial dual optimization
From MaRDI portal
Publication:3921005
DOI10.1007/BF01584252zbMath0467.90060MaRDI QIDQ3921005
Publication date: 1981
Published in: Mathematical Programming (Search for Journal in Brave)
posynomial geometric programming; convergent dual algorithm; dual solution estimate; dual-to-primal conversion method; partial dual optimization; primal geometric program; primal solution estimate
65K05: Numerical mathematical programming methods
90C30: Nonlinear programming
49N15: Duality theory (optimization)
90C99: Mathematical programming
Related Items
A second order affine scaling algorithm for the geometric programming dual with logarithmic barrier, The complexity of routing in~hierarchical PNNI networks, Controlled dual perturbations for posynomial programs, Optimal module sizing in VLSI floorplanning by nonlinear programming
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