On solving a primal geometric program by partial dual optimization
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3130645 (Why is no real title available?)
- scientific article; zbMATH DE number 3224200 (Why is no real title available?)
- scientific article; zbMATH DE number 3272827 (Why is no real title available?)
- A numerical study of multiplier methods for constrained parameter optimization
- Dual to primal conversion in geometric programming
- Linearizing Geometric Programs
- Numerically stable methods for quadratic programming
- Second order algorithms for the posynomial geometric programming dual, part I: Analysis
Cited in
(7)- Closed-form formulas for cluster sizing for two-level hierarchical networks with source routing
- Optimal module sizing in VLSI floorplanning by nonlinear programming
- Three or four levels of hierarchy minimize hydraulic power in leaves with pinnate dendritic venation
- 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
- An iteratively approximated gradient projection algorithm for sparse signal reconstruction
This page was built for publication: On solving a primal geometric program by partial dual optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3921005)
