Convex underestimation strategies for signomial functions
From MaRDI portal
Publication:3396383
DOI10.1080/10556780802702278zbMath1178.90278OpenAlexW1968289212MaRDI QIDQ3396383
Andreas Lundell, Tapio Westerlund
Publication date: 18 September 2009
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556780802702278
deterministic global optimizationconvex underestimatorsMINLPpower transformationsignomial functionsexponential transformation
Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Combinatorial optimization (90C27)
Related Items
Global Optimization of Mixed-Integer Signomial Programming Problems, Global optimization of signomial geometric programming problems, A MILP formulation for generalized geometric programming using piecewise-linear approximations, Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO, Branch-reduction-bound algorithm for generalized geometric programming, Indicator of power convex and exponential transformations for solving nonlinear problems containing posynomial terms, A reformulation framework for global optimization, A framework for globally optimizing mixed-integer signomial programs, Multi-parametric disaggregation technique for global optimization of polynomial programming problems, Range reduction techniques for improving computational efficiency in global optimization of signomial geometric programming problems, An accelerated extended cutting plane approach with piecewise linear approximations for signomial geometric programming, Optimal incentive pricing on relaying services for maximizing connection availability in multihop cellular networks, A review of deterministic optimization methods in engineering and management, Finding multiple optimal solutions of signomial discrete programming problems with free variables, Efficient Convexification Strategy for Generalized Geometric Programming Problems, Relaxations of factorable functions with convex-transformable intermediates, Bounds tightening based on optimality conditions for nonconvex box-constrained optimization, Global optimization, ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations, Global optimization of nonconvex problems with convex-transformable intermediates, Univariate parameterization for global optimization of mixed-integer polynomial problems
Uses Software
