Convex underestimation strategies for signomial functions

DOI10.1080/10556780802702278zbMATH Open1178.90278OpenAlexW1968289212MaRDI QIDQ3396383FDOQ3396383

Andreas Lundell, Tapio Westerlund

Publication date: 18 September 2009

Published in: Optimization Methods \& Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10556780802702278

zbMATH Keywords

MINLPpower transformationdeterministic global optimizationconvex underestimatorsexponential transformationsignomial functions

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Combinatorial optimization (90C27) Nonlinear programming (90C30)

Cited In (23)

• Relaxations of factorable functions with convex-transformable intermediates
• Efficient Convexification Strategy for Generalized Geometric Programming Problems
• Global optimization of signomial geometric programming problems
• Global optimization of nonconvex problems with convex-transformable intermediates
• Range reduction techniques for improving computational efficiency in global optimization of signomial geometric programming problems
• Optimal Sign Patterns for a Generalized Schmidl-Cox Method
• A MILP formulation for generalized geometric programming using piecewise-linear approximations
• Global optimization
• Finding multiple optimal solutions of signomial discrete programming problems with free variables
• Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
• 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
• Indicator of power convex and exponential transformations for solving nonlinear problems containing posynomial terms
• ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
• Univariate parameterization for global optimization of mixed-integer polynomial problems
• A review of deterministic optimization methods in engineering and management
• Optimal incentive pricing on relaying services for maximizing connection availability in multihop cellular networks
• Design and cost optimization for hierarchical data
• Bounds tightening based on optimality conditions for nonconvex box-constrained optimization
• An accelerated extended cutting plane approach with piecewise linear approximations for signomial geometric programming
• Global Optimization of Mixed-Integer Signomial Programming Problems
• Branch-reduction-bound algorithm for generalized geometric programming

Uses Software

• BARON

This page was built for publication: Convex underestimation strategies for signomial functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3396383)