Approximation based curvilinear local search for optimization problems

Date

2016-01-01

Author

Yaman, Fatih
YILMAZ, ASIM EGEMEN
Leblebicioğlu, Mehmet Kemal

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

144
views

0
downloads

Purpose - The purpose of this paper is to propose a local approximation-based search method to optimize any function. For this purpose, an approximation method is combined with an estimation filter, and a new local search mechanism is constituted.

Subject Keywords

Optimization, Estimation, Alpha-beta filter, Approximation, Curvilinear local search, Radial basis function

URI

https://hdl.handle.net/11511/48796

Journal

ENGINEERING COMPUTATIONS

DOI

https://doi.org/10.1108/ec-05-2014-0122

Collections

Department of Electrical and Electronics Engineering, Article

Suggestions

OpenMETU
Core

Storage free basis conversion over composite finite fields of odd characteristics Sial, M Riaz; Akyıldız, Ersan (null; 2013-09-19) We study the Finite Fields of type Fq, q = p2pn from the efficient implementation point of view. We found that we can represent these fields with irreducible polynomials in the form f(x) = xp − x − a. By using this representation we have found a way of constructing normal basis for the field, together with transmission matrix between normal basis and algebraic basis (Polynomial Basis) of Fq and vice versa. The key point is that this matrix and its inverse can be computed very efficiently without any memory ...
Automated composition of web services with the abductive event calculus Ozorhan, Esra Kirci; Kuban, Esat Kaan; Çiçekli, Fehime Nihan (2010-10-01) This paper proposes the application of the abductive event calculus to the web service composition and execution problem. There are different approaches to web service composition, which are suitable for different application scenarios. In this paper, we are concerned with the formalization of both the interleaved and template-based approaches using the event calculus framework. First, in the interleaved approach, it is shown that given a set of OWL-S web service descriptions in a service repository and a s...
Stability analysis of recurrent neural networks with piecewise constant argument of generalized type Akhmet, Marat; Yılmaz, Elanur (2010-09-01) In this paper, we apply the method of Lyapunov functions for differential equations with piecewise constant argument of generalized type to a model of recurrent neural networks (RNNs). The model involves both advanced and delayed arguments. Sufficient conditions are obtained for global exponential stability of the equilibrium point. Examples with numerical simulations are presented to illustrate the results.
Implementation Studies of Robot Swarm Navigation Using Potential Functions and Panel Methods Merheb, Abdel-Razzak; GAZİ, VEYSEL; Sezer Uzol, Nilay (2016-10-01) This paper presents a practical swarm navigation algorithm based on potential functions and properties of inviscid incompressible flows. Panel methods are used to solve the flow equations around complex shaped obstacles and to generate the flowlines, which provide collision-free paths to the goal position. Safe swarm navigation is achieved by following the generated streamlines. Potential functions are used to achieve and maintain group cohesion or a geometric formation during navigation. The algorithm is i...
Parameter Design Optimization of Products with an Ordinal Categorical Response Using Random Forests Köksal, Gülser (null; 2018-11-01) We propose an alternative method for finding optimal settings of product and process design parameters for the case of an ordinal categorical product/process response. The method utilizes Random Forests for modelling mean and variance of the response at a given set of parameter settings. The method uses different weighting strategies of Random Forest, and it is applied on three case problems. Results obtained are compared with those of previous studies that used the same data sets.

Citation Formats

F. Yaman, A. E. YILMAZ, and M. K. Leblebicioğlu, “Approximation based curvilinear local search for optimization problems,” ENGINEERING COMPUTATIONS, pp. 482–506, 2016, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/48796.