Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 674 for “"global optimization"”.
-
Heuristic Global Optimization
Global Optimization (GO) problems occur quite frequently in real-life applications, but are very hard to solve. As a result there is an ever-growing demand to find effective, fast methods for solving GO problems. The goal of this research is to develop algorithms that can quickly find good quality …
-
Adaptive global optimization algorithms
Global optimization is concerned with finding the minimum value of a function where many local minima may exist. The development of a global optimization algorithm may involve using information about the target function (e.g., differentiability) and functions based on statistical models to better …
-
Value-based global optimization
… of good solutions. In this thesis, a Value-Based Global Optimization (VGO) algorithm is introduced. The algorithm uses kriging-like surrogate models and a sequential sampling strategy based on Value of Information (VoI) to optimize an objective characterized by multiple analysis models with …
-
Global optimization of clustering problems
… Cluster analysis can always be formulated as an optimization problem. Various objective functions may lead to different clustering problems. In this thesis, we concentrate on k-means and k-center problems. Each can be formulated as a mixed-integer nonlinear programming problem. The work about …
-
Global Optimization: Software and Applications
… behaviour or value. This is done by using an optimization method that obtains certain parameters for optimal behaviour, as described by an objective function that may be a minimum (or maximum) result. Global optimization is a branch of optimization that takes a model and determines the global …
-
Interval methods for global optimization
… and interval constraint algorithms for global optimization. Both of these compute lower and upper bounds of a function over a box, and return a lower and an upper bound for the global minimum. In interval arithmetic methods, the bounds are computed using interval arithmetic evaluations. …
-
Global optimization using interval constraints
Global optimization methods can be classified into two non-overlapping classes with respect to accuracy: those with guaranteed accuracy and those without. The former are called bounding methods, the latter point methods. Bounding methods compute lower and upper bounds of function over a box and …
-
A Stochastic Global Optimization Program
The global optimization problem is usually stated as the global minimization problem, which is to find a point x* ϵ S, a compact set in ʀⁿ, such that f(x*) ≤ f (x) ∀ x ϵ S. Much work has been done on functions satisfying various convexity conditions. The global minimization problem drops this …
-
Global optimization with piecewise linear approximation
Global optimization deals with the development of solution methodologies for nonlinear nonconvex optimization problems. These problems, which could arise in diverse situations ranging from optimizing hydro-power generation schedules to estimating coefficients of non-linear regression models, are …
-
Dimensionality reduction techniques for global optimization
<p>Though ubiquitous in applications, global optimisation problems are generally the most computationally intense due to their solution time growing exponentially with linear increase in their dimensions (this is the well known/so called ‘curse of dimensionality’). In this thesis, we show that this …
-
Convergence rate theory for global optimization
Global optimization is used to control complex systems whose response is an unknown function on a continuous domain. Response values can only be observed empirically by simulations, and cannot be accurately represented using closed-form mathematical expressions. Prediction of true optimizer in this …
-
Global Optimization of Finite Mixture Models
… locally optimal. Thus, EM may not achieve the globally optimal solution in Gaussian mixture analysis problems, which can have a large number of local optima. This dissertation introduces several new algorithms designed to produce globally optimal solutions for Gaussian mixture models. The …
-
Enhancing Polyhedral Relaxations for Global Optimization
… the construction of polyhedral relaxations for global optimization. We design and implement an automatic convexity detection algorithm to exploit the convexity properties of general nonlinear programming problems.
-
Global Optimization for Constrained Nonlinear Programming
Finally, we apply CSA to solve a collection of engineering application benchmarks and design filters for subband image coding. Much better results have been reported in comparison with other existing methods.
-
Global optimization of water distribution systems
A holistic procedure GLOBAL for the global optimization of water distribution systems is presented. The procedure identifies an optimal tree layout for the network and augments it with loop forming links to assure reliability. Thus, the chosen optimal layout in judiciously subjected to various flow …
-
Parallelization of random search global optimization algorithms /
Global optimization problems are relevant in various fields of research and industry, such as chemistry, biology, biomedicine, operational research, etc. Normally it is easier to solve optimization problems having some specific properties of objective function such as linearity, convexity, …
-
Global Optimization Methods based on Tabu Search
… together with definition of the combinatorial optimization problems. It substantiates the choice of the investigation direction and basis idea of the developed methods. In the second part the new nonlinear global optimization routines based on the TS strategy are described. The new approaches …
Page 1 of 34