A reformulation framework for global optimization
DOI10.1007/S10898-012-9877-4zbMATH Open1277.90102OpenAlexW2135151510MaRDI QIDQ367160FDOQ367160
Tapio Westerlund, Anders Skjäl, Andreas Lundell
Publication date: 26 September 2013
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-012-9877-4
global optimizationmixed integer nonlinear programmingpiecewise linear functions\(\alpha\)BB-underestimatorconvex underestimatorsreformulation techniqueSGO-algorithmsignomial functionstwice-differentiable functions
Cites Work
- \(\alpha BB\): A global optimization method for general constrained nonconvex problems
- The design of the Boost interval arithmetic library
- Constrained global optimization: algorithms and applications
- Handbook of global optimization. Vol. 2
- Finding all solutions of nonlinearly constrained systems of equations
- A remark on the GOP algorithm for global optimization
- Recent developments and trends in global optimization
- Computational experience with a new class of convex underestimators: Box-constrained NLP problems
- A new class of improved convex underestimators for twice continuously differentiable constrained NLPs
- Modelling with integer variables
- Introduction to global optimization.
- Global optimization of signomial mixed-integer nonlinear programming problems with free variables
- Some transformation techniques with applications in global optimization
- Comparison of generalized geometric programming algorithms
- Global Optimization of Mixed-Integer Signomial Programming Problems
- An efficient global approach for posynomial geometric programming problems
- Convex underestimation strategies for signomial functions
- 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 of twice continuously differentiable functions by piecewise quadratic perturbation: spline \(\alpha\)BB underestimators
- Current state of the art of algorithms and computer software for geometric programming
- On the functional form of convex underestimators for twice continuously differentiable functions
- Title not available (Why is that?)
- The origins of geometric programming
- Convex underestimation for posynomial functions of positive variables
Cited In (9)
- On refinement strategies for solving \(\textsc{MINLP}\)s by piecewise linear relaxations: a generalized red refinement
- Polyhedral approximation strategies for nonconvex mixed-integer nonlinear programming in SHOT
- Adaptive piecewise linear relaxations for enclosure computations for nonconvex multiobjective mixed-integer quadratically constrained programs
- Reformulations for utilizing separability when solving convex MINLP problems
- Solving mixed-integer nonlinear programmes using adaptively refined mixed-integer linear programmes
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
- On solving generalized convex MINLP problems using supporting hyperplane techniques
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
- The extended supporting hyperplane algorithm for convex mixed-integer nonlinear programming
Uses Software
This page was built for publication: A reformulation framework for global optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q367160)
