Efficient solution of optimization problems with constraints and/or cost functions expensive to evaluate

Download

index.pdf

Date

2009

Author

Kurtdere, Ahmet Gökhan

Metadata

Show full item record

Item Usage Stats

185
views

65
downloads

There are many optimization problems motivated by engineering applications, whose constraints and/or cost functions are computationally expensive to evaluate. What is more derivative information is usually not available or available at a considerable cost. For that reason, classical optimization methods, based on derivatives, are not applicable. This study presents a framework based on available methods in literature to overcome this important problem. First, a penalized model is constructed where the violation of the constraints are added to the cost function. The model is optimized with help of stochastic approximation algorithms until a point satisfying the constraints is obtained. Then, a sample point set satisfying the constraints is obtained by taking advantage of direct search algorithms based sampling strategies. In this context, two search direction estimation methods, convex hull based and estimated radius of curvature of the sample point set based methods can be applicable. Point set is used to create a barrier which imposes a large cost for points near to the boundary. The aim is to obtain convergence to local optima using the most promising direction with help of direct search methods. As regards to the evaluation of the cost function there are two directions to follow: a-) Gradient-based methods, b-) Non-gradient methods. In gradient-based methods, the gradient is approximated using the so-called stochastic approximation algorithms. In the latter case, direct search algorithms based sampling strategy is realized. This study is concluded by using all these ideas in the solution of complicated test problems where the cost and the constraint functions are costly to evaluate.

Subject Keywords

Electrical engineering.

URI

http://etd.lib.metu.edu.tr/upload/12611342/index.pdf
https://hdl.handle.net/11511/19215

Collections

Graduate School of Natural and Applied Sciences, Thesis

Suggestions

OpenMETU
Core

Efficient parallelization of the multilevel fast multipole algorithm for the solution of large-scale scattering problems Ergül, Özgür Salih (Institute of Electrical and Electronics Engineers (IEEE), 2008-08-01) We present fast and accurate solutions of large-scale scattering problems involving three-dimensional closed conductors with arbitrary shapes using the multilevel fast multipole algorithm (MLFMA). With an efficient parallelization of MLFMA, scattering problems that are discretized with tens of millions of unknowns are easily solved on a cluster of computers. We extensively investigate the parallelization of MLFMA, identify the bottlenecks, and provide remedial procedures to improve the efficiency of the imp...
A Hierarchical Partitioning Strategy for an Efficient Parallelization of the Multilevel Fast Multipole Algorithm Ergül, Özgür Salih (Institute of Electrical and Electronics Engineers (IEEE), 2009-06-01) We present a novel hierarchical partitioning strategy for the efficient parallelization of the multilevel fast multipole algorithm (MLFMA) on distributed-memory architectures to solve large-scale problems in electromagnetics. Unlike previous parallelization techniques, the tree structure of MLFMA is distributed among processors by partitioning both clusters and samples of fields at each level. Due to the improved load-balancing, the hierarchical strategy offers a higher parallelization efficiency than previ...
Asynchronous design of systolic array architectures in cmos İsmailoğlu, Ayşe Neslin; Aşkar, Murat; Department of Electrical and Electronics Engineering (2008) In this study, delay-insensitive asynchronous circuit design style has been adopted to systolic array architectures to exploit the benefits of both techniques for improved throughput. A delay-insensitivity verification analysis method employing symbolic delays is proposed for bit-level pipelined asynchronous circuits. The proposed verification method allows datadependent early output evaluation to co-exist with robust delay-insensitive circuit behavior in pipelined architectures such as systolic arrays. Reg...
Hierarchical parallelisation strategy for multilevel fast multipole algorithm in computational electromagnetics Ergül, Özgür Salih (Institution of Engineering and Technology (IET), 2008-01-03) A hierarchical parallelisation of the multilevel fast multipole algorithm (MLFMA) for the efficient solution of large-scale problems in computational electromagnetics is presented. The tree structure of MLFMA is distributed among the processors by partitioning both the clusters and the samples of the fields appropriately for each level. The parallelisation efficiency is significantly improved compared to previous approaches, where only the clusters or only the fields are partitioned in a level.
Robust set-valued estimation and its application to in-flight alignment of sins Seymen, Niyazi Burak; Demirekler, Mübeccel; Department of Electrical and Electronics Engineering (2005) In this thesis, robust set-valued estimation is studied and its application to in-flight alignment of strapdown inertial navigation systems (SINS) with large heading uncertainty is performed. It is known that the performance of the Kalman filter is vulnerable to modeling errors. One of the estimation methods, which are robust against modeling errors, is robust set-valued estimation. In this approach, the filter calculates the set of all possible states, which are consistent with uncertainty inputs satisfyin...

Citation Formats

A. G. Kurtdere, “Efficient solution of optimization problems with constraints and/or cost functions expensive to evaluate,” M.S. - Master of Science, Middle East Technical University, 2009.