Second order algorithms for the posynomial geometric programming dual, part I: Analysis
From MaRDI portal
Publication:3205030
Cites work
- scientific article; zbMATH DE number 3518193 (Why is no real title available?)
- scientific article; zbMATH DE number 3539473 (Why is no real title available?)
- scientific article; zbMATH DE number 3272827 (Why is no real title available?)
- A condensation method for generalized geometric programming
- A modified reduced gradient method for dual posynomial programming
- A new method for the optimization of a nonlinear function subject to nonlinear constraints
- A numerical study of multiplier methods for constrained parameter optimization
- An approach to the numerical solutions of geometric programs
- Current state of the art of algorithms and computer software for geometric programming
- Dual to primal conversion in geometric programming
- Large-scale linearly constrained optimization
- Newton-type methods for unconstrained and linearly constrained optimization
- Second order algorithms for the posynomial geometric programming dual, part I: Analysis
Cited in
(7)- Current state of the art of algorithms and computer software for geometric programming
- Geometric programming. Method and applications
- Sensitivity analysis in geometric programming
- On solving a primal geometric program by partial dual optimization
- Un algoritmo de programacion geometrica basado en funciones penalidad-multiplicadoras
- 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
This page was built for publication: Second order algorithms for the posynomial geometric programming dual, part I: Analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3205030)
