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 24 for “"Global optimization algorithm"”.
-
Design and Evaluation of a Data-distributed Massively Parallel Implementation of a Global Optimization Algorithm---DIRECT
… massively parallel DIRECT, the deterministic global optimization algorithm widely used in multidisciplinary engineering design, biological science, and physical science applications. The original algorithm is modified to adapt to different problem scales and optimization (exploration vs.\ …
-
Deterministic Parallel Global Parameter Estimation for a Model of the Budding Yeast Cell Cycle
Two parallel deterministic direct search algorithms are combined to find improved parameters for a system of differential equations designed to simulate the cell cycle of budding yeast. Comparing the model simulation results to experimental data is difficult because most of the experimental data is …
-
OPTIMIZATION FOR CALIBRATION OF WATER RESOURCES SYSTEMS INCLUDING NEW PARALLEL GLOBAL ALGORITHMS AND APPLICATIONS TO HYDRODYNAMICS AND WATER QUALITY LAKE PDE MODELS
This thesis introduces efficient parallel optimization algorithms for computationally expensive optimization problems and applies them to water resources issues. A new parallel surrogate global optimization algorithm PODS is developed and successfully applied to the calibration of two …
-
Power Saving Analysis and Experiments for Large Scale Global Optimization
… computing research. DIRECT is a deterministic global optimization algorithm, implemented in the mathematical software package VTDIRECT95. This thesis explores the potential energy savings for the parallel implementation of DIRECT, called pVTdirect, when used with a large scale computational …
-
Nonconvex optimization algorithm with a new Bi-criteria selection of potential simplices using an estimate of Lipschitz constant /
In this thesis, Direct (DIviding RECTangles) type algorithms based on Lipschitz objective function models with unknown Lipschitz constant, which are often applied for practical black-box optimization problems, are considered. The main goal of this thesis is set - to propose a global optimization …
-
Neiškiliojo optimizavimo algoritmas su nauju bikriteriniu potencialiųjų simpleksų išrinkimu naudojant Lipšico konstantos įvertį /
In this thesis, Direct (DIviding RECTangles) type algorithms based on Lipschitz objective function models with unknown Lipschitz constant, which are often applied for practical black-box optimization problems, are considered. The main goal of this thesis is set - to propose a global optimization …
-
Service ORiented Computing EnviRonment (SORCER) for Deterministic Global and Stochastic Optimization
… of multidisciplinary analysis and design optimization (MDO) in the engineering design process has garnered much attention. MDO addresses the challenge of integrating several different disciplines into the design process. Primary challenges of MDO include computational expense and poor …
-
Global Optimization of Transmitter Placement for Indoor Wireless Communication Systems
The DIRECT (DIviding RECTangles) algorithm JONESJOTi, a variant of Lipschitzian methods for bound constrained global optimization, has been applied to the optimal transmitter placement for indoor wireless systems. Power coverage and BER (bit error rate) are considered as two criteria for optimizing …
-
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 …
-
Optimal de-excitation patterns for RESOLFT-Microscopy
… for the first time, a comprehensive search, optimization and characterization of de-excitation patterns is performed. The microscope’s pupil function is decomposed into orthonormal polynomials which allows the restriction of the space of pupil functions so that boundary conditions are …
-
A Design Methodology for A Universal Relation Scheme Implementation via Codasyl
… later retrieved. We include a schema translation algorithm for a relational schema whose corresponding database has the property that each relation can be updated independently of the other relations. We give two algorithms for translating a relational query to a network application program. …
-
Sensitivity-based guided automatic calibration of hydrological models
… combines Dynamically Dimensioned Search (DDS) global optimization algorithm with Global Sensitivity Analysis (GSA) methods is introduced. This approach, which is called sensitivity-informed DDS, utilizes sensitivity indices to increase the probability of perturbation for the most sensitive …
-
A parallel branch-and-bound algorithm for thin-film optical systems, with application to realizing a broadband omnidirectional antireflection coating for silicon solar cells
… search space (as required by a branch-and-bound algorithm). This represents the first, to the best of our knowledge, deterministic global optimization algorithm for this important class of problems, i.e., the first algorithm that can guarantee that a global solution to an optimization problem in …
-
On the Performance of Super-Long Integral Abutment Bridges: Parametric Analyses and Design Optimization
… lateral displacement. Therefore, an effective optimization approach, associating the finite element method with global optimization algorithm was presented for pile shape design. At the end, considerations accounted in the design of super-long integral abutment bridges were discussed, making …
-
Learning-accelerated algorithms for simulation and optimization
Simulation and optimization are fundamental building blocks for many computational methods in science and engineering. In this work, we explore the use of machine learning techniques to accelerate compute-intensive tasks in both simulation and optimization. Specifically, two algorithms are …
-
Enhanced intersection cutting plane and reformulation-linearization enumeration based approaches for linear complementarity problems
… for over three decades now. Most of the current algorithms designed to solve LCP are guaranteed to work only under some restrictive assumptions on the matrix <i>M</i> associated with LCP. In this research, we introduce two new algorithms based on an equivalent 0-1 mixed integer bilinear …
-
Optimal Sum-Rate of Multi-Band MIMO Interference Channel
… channel in each frequency band. The underlying optimization problem, being non-linear and non-convex, is difficult to solve analytically or by employing local optimization techniques. Therefore, we develop a global optimization algorithm by extending the Reformulation and Linearization Technique …
-
Tools for efficient design of multicomponent separation processes
… required to maintain a pressure differential. Optimization of the total compressor duty can reveal an ideal cascade arrangement and set of operating conditions for a given feed and recovery. With this optimization technique in hand, it is then possible to examine the effect of introducing extra …
-
Design and application of near infrared tunable filter for ATST and NST
… systems, are redesigned using a Monte Carlo global optimization algorithm. The designs for three sets of such multi-layer achromatic waveplates are presented in the thesis. Experimental results are also obtained for three-layer quarter and half waveplates. These results show that the …
-
Global Optimization of Nonconvex Factorable Programs with Applications to Engineering Design Problems
… of this thesis is to develop and implement a global optimization algorithm to solve a class of nonconvex programming problems, and to test it using a collection of engineering design problem applications.The class of problems we consider involves the optimization of a general nonconvex …
Page 1 of 2