Global Optimization of Mixed-Integer Signomial Programming Problems
From MaRDI portal
Publication:2897303
DOI10.1007/978-1-4614-1927-3_12zbMath1242.90137MaRDI QIDQ2897303
Tapio Westerlund, Andreas Lundell
Publication date: 10 July 2012
Published in: Mixed Integer Nonlinear Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-1-4614-1927-3_12
nonconvex optimization; mixed-integer nonlinear programming; signomial functions; convex reformulations
90C11: Mixed integer programming
90C26: Nonconvex programming, global optimization
90C30: Nonlinear programming
Related Items
Efficient Convexification Strategy for Generalized Geometric Programming Problems, The extended supporting hyperplane algorithm for convex mixed-integer nonlinear programming, 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, ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations, Univariate parameterization for global optimization of mixed-integer polynomial problems, Improved logarithmic linearizing method for optimization problems with free-sign pure discrete signomial terms
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Global optimization of signomial mixed-integer nonlinear programming problems with free variables
- Some transformation techniques with applications in global optimization
- Generalized geometric programming applied to problems of optimal control. I: Theory
- Different transformations for solving non-convex trim-loss problems by MINLP
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- Finding all solutions of nonlinearly constrained systems of equations
- Convex relaxation for solving posynomial programs
- Designing globally optimal delta-sigma modulator topologies via signomial programming
- Convex underestimation strategies for signomial functions
- Inductor design using signomial programming
- Global optimization using special ordered sets
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Duality Theory for Geometric Programming
