Indicator of power convex and exponential transformations for solving nonlinear problems containing posynomial terms
From MaRDI portal
Publication:2164609
DOI10.1016/j.physa.2019.122658OpenAlexW2975262344WikidataQ115567862 ScholiaQ115567862MaRDI QIDQ2164609
Publication date: 15 August 2022
Published in: Physica A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.physa.2019.122658
global optimizationexponential transformationposynomial geometric programmingconvex underestimationpower convex transformation
Cites Work
- Unnamed Item
- Range reduction techniques for improving computational efficiency in global optimization of signomial geometric programming problems
- Global solution of optimization problems with signomial parts
- Convex underestimation for posynomial functions of positive variables
- Some transformation techniques with applications in global optimization
- Comparison of generalized geometric programming algorithms
- Piece-wise linear approximation of functions of two variables
- A geometric programming framework for univariate cubic \(L_1\) smoothing splines
- An efficient convexification method for solving generalized geometric problems
- Convex relaxation for solving posynomial programs
- An Efficient Global Approach for Posynomial Geometric Programming Problems
- Global Optimization for Generalized Geometric Programs with Mixed Free-Sign Variables
- Convex underestimation strategies for signomial functions
- Efficient Convexification Strategy for Generalized Geometric Programming Problems
- Digital Circuit Optimization via Geometric Programming
- Generalized Polynomial Optimization
- Duality Theory for Geometric Programming
- Geometric Programming for Communication Systems