Indicator of power convex and exponential transformations for solving nonlinear problems containing posynomial terms
From MaRDI portal
Publication:2164609
Cites work
- scientific article; zbMATH DE number 2068063 (Why is no real title available?)
- A geometric programming framework for univariate cubic L₁ smoothing splines
- An efficient convexification method for solving generalized geometric problems
- An efficient global approach for posynomial geometric programming problems
- Comparison of generalized geometric programming algorithms
- Convex relaxation for solving posynomial programs
- Convex underestimation for posynomial functions of positive variables
- Convex underestimation strategies for signomial functions
- Digital Circuit Optimization via Geometric Programming
- Duality Theory for Geometric Programming
- Efficient Convexification Strategy for Generalized Geometric Programming Problems
- Generalized Polynomial Optimization
- Geometric Programming for Communication Systems
- Global optimization for generalized geometric programs with mixed free-sign variables
- Global solution of optimization problems with signomial parts
- Piece-wise linear approximation of functions of two variables
- Range reduction techniques for improving computational efficiency in global optimization of signomial geometric programming problems
- Some transformation techniques with applications in global optimization
This page was built for publication: Indicator of power convex and exponential transformations for solving nonlinear problems containing posynomial terms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2164609)
