• 제목/요약/키워드: Global optimization method

검색결과 615건 처리시간 0.026초

Efficient Global Optimization of Periodic Plasmonic Nanoslit Array Based on Quality Factor Analysis

  • Jaehoon Jung
    • Current Optics and Photonics
    • /
    • 제7권3호
    • /
    • pp.248-253
    • /
    • 2023
  • An efficient global optimization approach for a periodic plasmonic nanoslit array based on extraordinary optical transmission within an acceptable time range is proposed using 𝚀 factor analysis method. The particle swarm optimization is employed as a global optimization tool. The figure of merit is defined as a product of transmission peak value and 𝚀 factor. The design variables are the slit width, height, and period of the slit array, respectively. The optical properties such as transmission spectrum and bandwidth are calculated rigorously using the finite element method.

Methods of pairwise comparisons and fuzzy global criterion for multiobjective optimization in structural engineering

  • Shih, C.J.;Yu, K.C.
    • Structural Engineering and Mechanics
    • /
    • 제6권1호
    • /
    • pp.17-30
    • /
    • 1998
  • The method of pairwise comparison inherently contains information of ambiguity, fuzziness and conflict in design goals for a multiobjective structural design. This paper applies the principle of paired comparison so that the vaguely formulated problem can be modified and a set of numerically acceptable weight would reflect the relatively important degree of multiple objectives. This paper also presents a fuzzy global criterion method ($FGCM_{\lambda}$) included fuzzy constraints that coupled with the objective weighting rank obtained from the modified pairwise comparisons for fuzzy multiobjective optimization problems. Descriptions in sequence of this combined method and problem solving experiences are given in the current article. Multiobjective design examples of truss and mechanical spring structures illustrate this optimization process containing the revising judgement techniques.

Noisy 한 CFD 결과에 대한 구속조건을 고려한 EGO 방법 연구 (A STUDY ON CONSTRAINED EGO METHOD FOR NOISY CFD DATA)

  • 배효길;권장혁
    • 한국전산유체공학회지
    • /
    • 제17권4호
    • /
    • pp.32-40
    • /
    • 2012
  • Efficient Global Optimization (EGO) method is a global optimization technique which can select the next sample point automatically by infill sampling criteria (ISC) and search for the global minimum with less samples than what the conventional global optimization method needs. ISC function consists of the predictor and mean square error (MSE) provided from the kriging model which is a stochastic metamodel. Also the constrained EGO method can minimize the objective function dealing with the constraints under EGO concept. In this study the constrained EGO method applied to the RAE2822 airfoil shape design formulated with the constraint. But the noisy CFD data caused the kriging model to fail to depict the true function. The distorted kriging model would make the EGO deviate from the correct search. This distortion of kriging model can be handled with the interpolation(p=free) kriging model. With the interpolation(p=free) kriging model, however, the search of EGO solution was stalled in the narrow feasible region without the chance to update the objective and constraint functions. Then the accuracy of EGO solution was not good enough. So the three-step search method was proposed to obtain the accurate global minimum as well as prevent from the distortion of kriging model for the noisy constrained CFD problem.

Numerical analysis of quantization-based optimization

  • Jinwuk Seok;Chang Sik Cho
    • ETRI Journal
    • /
    • 제46권3호
    • /
    • pp.367-378
    • /
    • 2024
  • We propose a number-theory-based quantized mathematical optimization scheme for various NP-hard and similar problems. Conventional global optimization schemes, such as simulated and quantum annealing, assume stochastic properties that require multiple attempts. Although our quantization-based optimization proposal also depends on stochastic features (i.e., the white-noise hypothesis), it provides a more reliable optimization performance. Our numerical analysis equates quantization-based optimization to quantum annealing, and its quantization property effectively provides global optimization by decreasing the measure of the level sets associated with the objective function. Consequently, the proposed combinatorial optimization method allows the removal of the acceptance probability used in conventional heuristic algorithms to provide a more effective optimization. Numerical experiments show that the proposed algorithm determines the global optimum in less operational time than conventional schemes.

근사 최적화를 활용한 뻐꾸기 탐색법의 성능 개선 (Surrogate-Based Improvement on Cuckoo Search for Global Constrained Optimization)

  • 이세정
    • 한국CDE학회논문집
    • /
    • 제19권3호
    • /
    • pp.245-252
    • /
    • 2014
  • Engineering applications of global optimization techniques are recently abundant in the literature and it may be caused by both new methodologies arising and faster computers coming out. Many of the optimization techniques are based on natural or biological phenomena. This study put focus on enhancing the performace of Cuckoo Search (CS) among them since it has the least number of parameters to tune. The proposed enhancement can be achieved by applying surrogate-based optimization at every cycle of CS, which fortifies the exploitation capability of the original method. The enhanced algorithm has been applied several engineering design problems with constraints. The proposed method shows comparable or superior performance to the original method.

GLOBAL CONVERGENCE OF A NEW SPECTRAL PRP CONJUGATE GRADIENT METHOD

  • Liu, Jinkui
    • Journal of applied mathematics & informatics
    • /
    • 제29권5_6호
    • /
    • pp.1303-1309
    • /
    • 2011
  • Based on the PRP method, a new spectral PRP conjugate gradient method has been proposed to solve general unconstrained optimization problems which produce sufficient descent search direction at every iteration without any line search. Under the Wolfe line search, we prove the global convergence of the new method for general nonconvex functions. The numerical results show that the new method is efficient for the given test problems.

AN ADAPTIVE APPROACH OF CONIC TRUST-REGION METHOD FOR UNCONSTRAINED OPTIMIZATION PROBLEMS

  • FU JINHUA;SUN WENYU;SAMPAIO RAIMUNDO J. B. DE
    • Journal of applied mathematics & informatics
    • /
    • 제19권1_2호
    • /
    • pp.165-177
    • /
    • 2005
  • In this paper, an adaptive trust region method based on the conic model for unconstrained optimization problems is proposed and analyzed. We establish the global and super linear convergence results of the method. Numerical tests are reported that confirm the efficiency of the new method.

A Robust Optimization Using the Statistics Based on Kriging Metamodel

  • Lee Kwon-Hee;Kang Dong-Heon
    • Journal of Mechanical Science and Technology
    • /
    • 제20권8호
    • /
    • pp.1169-1182
    • /
    • 2006
  • Robust design technology has been applied to versatile engineering problems to ensure consistency in product performance. Since 1980s, the concept of robust design has been introduced to numerical optimization field, which is called the robust optimization. The robustness in the robust optimization is determined by a measure of insensitiveness with respect to the variation of a response. However, there are significant difficulties associated with the calculation of variations represented as its mean and variance. To overcome the current limitation, this research presents an implementation of the approximate statistical moment method based on kriging metamodel. Two sampling methods are simultaneously utilized to obtain the sequential surrogate model of a response. The statistics such as mean and variance are obtained based on the reliable kriging model and the second-order statistical approximation method. Then, the simulated annealing algorithm of global optimization methods is adopted to find the global robust optimum. The mathematical problem and the two-bar design problem are investigated to show the validity of the proposed method.

CONVERGENCE OF SUPERMEMORY GRADIENT METHOD

  • Shi, Zhen-Jun;Shen, Jie
    • Journal of applied mathematics & informatics
    • /
    • 제24권1_2호
    • /
    • pp.367-376
    • /
    • 2007
  • In this paper we consider the global convergence of a new super memory gradient method for unconstrained optimization problems. New trust region radius is proposed to make the new method converge stably and averagely, and it will be suitable to solve large scale minimization problems. Some global convergence results are obtained under some mild conditions. Numerical results show that this new method is effective and stable in practical computation.

A NOVEL FILLED FUNCTION METHOD FOR GLOBAL OPTIMIZATION

  • Lin, Youjiang;Yang, Yongjian;Zhang, Liansheng
    • 대한수학회지
    • /
    • 제47권6호
    • /
    • pp.1253-1267
    • /
    • 2010
  • This paper considers the unconstrained global optimization with the revised filled function methods. The minimization sequence could leave from a local minimizer to a better minimizer of the objective function through minimizing an auxiliary function constructed at the local minimizer. Some promising numerical results are also included.