Search results for "global optimization"
showing 10 items of 27 documents
Constraint handling in efficient global optimization
2017
Real-world optimization problems are often subject to several constraints which are expensive to evaluate in terms of cost or time. Although a lot of effort is devoted to make use of surrogate models for expensive optimization tasks, not many strong surrogate-assisted algorithms can address the challenging constrained problems. Efficient Global Optimization (EGO) is a Kriging-based surrogate-assisted algorithm. It was originally proposed to address unconstrained problems and later was modified to solve constrained problems. However, these type of algorithms still suffer from several issues, mainly: (1) early stagnation, (2) problems with multiple active constraints and (3) frequent crashes.…
Adaptive memory programming for constrained global optimization
2010
The problem of finding a global optimum of a constrained multimodal function has been the subject of intensive study in recent years. Several effective global optimization algorithms for constrained problems have been developed; among them, the multi-start procedures discussed in Ugray et al. [1] are the most effective. We present some new multi-start methods based on the framework of adaptive memory programming (AMP), which involve memory structures that are superimposed on a local optimizer. Computational comparisons involving widely used gradient-based local solvers, such as Conopt and OQNLP, are performed on a testbed of 41 problems that have been used to calibrate the performance of su…
A Multistart Scatter Search Heuristic for Smooth NLP and MINLP Problems
2005
The algorithm described here, called OptQuest/NLP or OQNLP, is a heuristic designed to find global optima for pure and mixed integer nonlinear problems with many constraints and variables, where all problem functions are differentiable with respect to the continuous variables. It uses OptQuest, a commercial implementation of scatter search developed by OptTek Systems, Inc., to provide starting points for a gradient-based local NLP solver. This solver seeks a local solution from a subset of these points, holding discrete variables fixed. The procedure is motivated by our desire to combine the superior accuracy and feasibility-seeking behavior of gradient-based local NLP solvers with the glob…
A parsimonious model for generating arbitrage-free scenario trees
2016
Simulation models of economic, financial and business risk factors are widely used to assess risks and support decision-making. Extensive literature on scenario generation methods aims at describing some underlying stochastic processes with the least number of scenarios to overcome the ‘curse of dimensionality’. There is, however, an important requirement that is usually overlooked when one departs from the application domain of security pricing: the no-arbitrage condition. We formulate a moment matching model to generate multi-factor scenario trees for stochastic optimization satisfying no-arbitrage restrictions with a minimal number of scenarios and without any distributional assumptions.…
Generating Multi-Asset Arbitrage-Free Scenario Trees with Global Optimization
2013
Simulation models of economic, financial and business risk factors are widely used to assess risks and support decision-making. Extensive literature on scenario generation methods aims at describing some underlying stochastic processes with the least number of scenarios to overcome the "curse of dimensionality". There is, however, an important requirement that is usually overlooked when one departs from the application domain of security pricing: the no-arbitrage condition. We formulate a moment matching model to generate multi-factor scenario trees satisfying no-arbitrage restrictions with a minimal number of scenarios and without any distributional assumptions. The resulting global optimi…
Towards Better Integration of Surrogate Models and Optimizers
2019
Surrogate-Assisted Evolutionary Algorithms (SAEAs) have been proven to be very effective in solving (synthetic and real-world) computationally expensive optimization problems with a limited number of function evaluations. The two main components of SAEAs are: the surrogate model and the evolutionary optimizer, both of which use parameters to control their respective behavior. These parameters are likely to interact closely, and hence the exploitation of any such relationships may lead to the design of an enhanced SAEA. In this chapter, as a first step, we focus on Kriging and the Efficient Global Optimization (EGO) framework. We discuss potentially profitable ways of a better integration of…
A fuzzy programming method for optimization of autonomous logistics objects
2013
Recently several studies have explored the realization of autonomous control in production and logistic operations. In doing so, it has been tried to transmit the merit of decision-making from central controllers with offline decisions to decentralized controllers with local and real-time decision makings. However, this mission has still some drawbacks in practice. Lack of global optimization is one of them, i.e., the lost chain between the autonomous decentralized decisions at operational level and the centralized mathematical optimization with offline manner at tactical and strategic levels. This distinction can be reasonably solved by considering fuzzy parameters in mathematical programm…
High selective H-plane TE dual mode cavity filter design by using nonresonating nodes
2013
The design of H-plane TE dual mode cavity filters using models containing nonresonating nodes is presented. From the models a coupling matrix is derived and decomposed into submatrices, each representing a subcircuit. The optimization and cascading of subcircuits represents a good starting point for the global optimization. © 2014 Wiley Periodicals, Inc. Microwave Opt Technol Lett 56:161–166, 2014
Pseudo-Cut Strategies for Global Optimization
2011
Motivated by the successful use of a pseudo-cut strategy within the setting of constrained nonlinear and nonconvex optimization in Lasdon et al. (2010), we propose a framework for general pseudo-cut strategies in global optimization that provides a broader and more comprehensive range of methods. The fundamental idea is to introduce linear cutting planes that provide temporary, possibly invalid, restrictions on the space of feasible solutions, as proposed in the setting of the tabu search metaheuristic in Glover (1989), in order to guide a solution process toward a global optimum, where the cutting planes can be discarded and replaced by others as the process continues. These strategies can…
Influence of rounding errors on the quality of heuristic optimization algorithms
2011
Abstract Search space smoothing and related heuristic optimization algorithms provide an alternative approach to simulated annealing and its variants: while simulated annealing traverses barriers in the energy landscape at finite temperatures, search space smoothing intends to remove these barriers, so that a greedy algorithm is sufficient to find the global minimum. Several formulas for smoothing the energy landscape have already been applied, one of them making use of the finite numerical precision on a computer. In this paper, we thoroughly investigate the effect of finite numerical accuracy on the quality of results achieved with heuristic optimization algorithms. We present computation…