• Title/Summary/Keyword: Approximate optimization method

Search Result 226, Processing Time 0.027 seconds

Design Optimization Using the Two-Point Convex Approximation (이점 볼록 근사화 기법을 적용한 최적설계)

  • Kim, Jong-Rip;Choi, Dong-Hoon
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.27 no.6
    • /
    • pp.1041-1049
    • /
    • 2003
  • In this paper, a new local two-point approximation method which is based on the exponential intervening variable is proposed. This new algorithm, called the Two-Point Convex Approximation(TPCA), use the function and design sensitivity information from the current and previous design points of the sequential approximate optimization to generate a sequence of convex, separable subproblems. This paper describes the derivation of the parameters associated with the approximation and the numerical solution procedure. In order to show the numerical performance of the proposed method, a sequential approximate optimizer is developed and applied to solve several typical design problems. These optimization results are compared with those of other optimizers. Numerical results obtained from the test examples demonstrate the effectiveness of the proposed method.

Sequential Approximate Optimization by Dual Method Based on Two-Point Diagonal Quadratic Approximation (이점 대각 이차 근사화 기법을 쌍대기법에 적용한 순차적 근사 최적설계)

  • Park, Seon-Ho;Jung, Sang-Jin;Jeong, Seung-Hyun;Choi, Dong-Hoon
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.35 no.3
    • /
    • pp.259-266
    • /
    • 2011
  • We present a new dual sequential approximate optimization (SAO) algorithm called SD-TDQAO (sequential dual two-point diagonal quadratic approximate optimization). This algorithm solves engineering optimization problems with a nonlinear objective and nonlinear inequality constraints. The two-point diagonal quadratic approximation (TDQA) was originally non-convex and inseparable quadratic approximation in the primal design variable space. To use the dual method, SD-TDQAO uses diagonal quadratic explicit separable approximation; this can easily ensure convexity and separability. An important feature is that the second-derivative terms of the quadratic approximation are approximated by TDQA, which uses only information on the function and the derivative values at two consecutive iteration points. The algorithm will be illustrated using mathematical and topological test problems, and its performance will be compared with that of the MMA algorithm.

Study of Reliability-Based Robust Design Optimization Using Conservative Approximate Meta-Models (보수적 근사모델을 적용한 신뢰성 기반 강건 최적설계 방법)

  • Sim, Hyoung Min;Song, Chang Yong;Lee, Jongsoo;Choi, Ha-Young
    • Journal of Ocean Engineering and Technology
    • /
    • v.26 no.6
    • /
    • pp.80-85
    • /
    • 2012
  • The methods of robust design optimization (RDO) and reliability-based robust design optimization (RBRDO) were implemented in the present study. RBRDO is an integrated method that accounts for the design robustness of an objective function and for the reliability of constraints. The objective function in RBRDO is expressed in terms of the mean and standard deviation of an original objective function. Thus, a multi-objective formulation is employed. The regressive approximate models are generated via the moving least squares method (MLSM) and constraint-feasible moving least squares method (CF-MLSM), which make it possible to realize the feasibility regardless of the multimodality/nonlinearity of the constraint function during the approximate optimization processes. The regression model based RBRDO is newly devised and its numerical characteristics are explored using the design of an actively controlled ten bar truss structure.

SMOOTHING APPROXIMATION TO l1 EXACT PENALTY FUNCTION FOR CONSTRAINED OPTIMIZATION PROBLEMS

  • BINH, NGUYEN THANH
    • Journal of applied mathematics & informatics
    • /
    • v.33 no.3_4
    • /
    • pp.387-399
    • /
    • 2015
  • In this paper, a new smoothing approximation to the l1 exact penalty function for constrained optimization problems (COP) is presented. It is shown that an optimal solution to the smoothing penalty optimization problem is an approximate optimal solution to the original optimization problem. Based on the smoothing penalty function, an algorithm is presented to solve COP, with its convergence under some conditions proved. Numerical examples illustrate that this algorithm is efficient in solving COP.

Structural Optimization using Improved Higher-order Convex Approximation (개선된 고차 Convex 근사화를 이용한 구조최적설계)

  • 조효남;민대홍;김성헌
    • Proceedings of the Computational Structural Engineering Institute Conference
    • /
    • 2002.10a
    • /
    • pp.271-278
    • /
    • 2002
  • Structural optimization using improved higer-order convex approximation is proposed in this paper. The proposed method is a generalization of the convex approximation method. The order of the approximation function for each constraint is automatically adjusted in the optimization process. And also the order of each design variable is differently adjusted. This self-adjusted capability makes the approximate constraint values conservative enough to maintain the optimum design point of the approximate problem in feasible region. The efficiency of proposed algorithm, compared with conventional algorithm is successfully demonstrated in the Three-bar Truss example.

  • PDF

Development of GUI Environment Using a Commercial Program for Truss Structure of Approximate Optimization (상용프로그램을 사용한 트러스 구조물 근사최적설계 GUI 환경 개발)

  • 임오강;이경배
    • Journal of the Computational Structural Engineering Institute of Korea
    • /
    • v.16 no.4
    • /
    • pp.431-437
    • /
    • 2003
  • In this paper, an approximate optimization program based on GUI(graphic user interface) environment is developed. This program is coded by using Fortran and Visual basic. Fortran is used to Progress approximate optimization process. Visual basic is used to make user environment for user to use conveniently. Inside of this program, it uses two independent programs. One is commercial program, ANSYS, and the other is optimization program, PLBA(Pshenichny-Lim-Belegundu Arora). The former is used to obtain approximate equation of stress and displacement of a structure. The latter is used to solve approximate optimization. This algorithm uses second-order information of a function and active set strategy. This program is connecting ANSYS and PLBA. And it progress the process repeatedly until it obtain optimum value. As a method of approximate optimization, sequential design domain(SDD) is introduced. SDD starts with a certain range which is offseted from midpoint of an initial design domain and then SDD of the next step is determined by optimal point of a prior step.

Optimal Design of a Heat Sink using the Sequential Approximate Optimization Algorithm (순차적 근사최적화 기법을 이용한 방열판 최적설계)

  • Park Kyoungwoo;Choi Dong-Hoon
    • Korean Journal of Air-Conditioning and Refrigeration Engineering
    • /
    • v.16 no.12
    • /
    • pp.1156-1166
    • /
    • 2004
  • The shape of plate-fin type heat sink is numerically optimized to acquire the minimum pressure drop under the required temperature rise. In constrained nonlinear optimization problems of thermal/fluid systems, three fundamental difficulties such as high computational cost for function evaluations (i.e., pressure drop and thermal resistance), the absence of design sensitivity information, and the occurrence of numerical noise are commonly confronted. Thus, a sequential approximate optimization (SAO) algorithm has been introduced because it is very hard to obtain the optimal solutions of fluid/thermal systems by means of gradient-based optimization techniques. In this study, the progressive quadratic response surface method (PQRSM) based on the trust region algorithm, which is one of sequential approximate optimization algorithms, is used for optimization and the heat sink is optimized by combining it with the computational fluid dynamics (CFD).

Meta-model Effects on Approximate Multi-objective Design Optimization of Vehicle Suspension Components (차량 현가 부품의 근사 다목적 설계 최적화에 대한 메타모델 영향도)

  • Song, Chang Yong;Choi, Ha-Young;Byon, Sung-Kwang
    • Journal of the Korean Society of Manufacturing Process Engineers
    • /
    • v.18 no.3
    • /
    • pp.74-81
    • /
    • 2019
  • Herein, we performed a comparative study on approximate multi-objective design optimization, to realize a structural design to improve the weight and vibration performances of the knuckle - a car suspension component - considering various load conditions and vibration characteristics. In the approximate multi-objective optimization process, a regression meta-model was generated using the response surfaces method (RSM), while Kriging and back-propagation neural network (BPN) methods were applied for interpolation meta-modeling. The Pareto solutions, multi-objective optimal solutions, were derived using the non-dominated sorting genetic algorithm (NSGA-II). In terms of the knuckle design considered in this study, the characteristics and influence of the meta-model on multi-objective optimization were reviewed through a comparison of the approximate optimization results with the meta-models and the actual optimization.

Progressive Quadratic Approximation Method for Effective Constructing the Second-Order Response Surface Models in the Large Scaled System Design (대형 설계 시스템의 효율적 반응표면 근사화를 위한 점진적 이차 근사화 기법)

  • Hong, Gyeong-Jin;Kim, Min-Su;Choe, Dong-Hun
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.24 no.12
    • /
    • pp.3040-3052
    • /
    • 2000
  • For effective construction of second-order response surface models, an efficient quad ratic approximation method is proposed in the context of trust region model management strategy. In the proposed method, although only the linear and quadratic terms are uniquely determined using 2n+1 design points, the two-factor interaction terms are mathematically updated by normalized quasi-Newton formula. In order to show the numerical performance of the proposed approximation method, a sequential approximate optimizer is developed and solves a typical unconstrained optimization problem having 2, 6, 10, 15, 30 and 50 design variables, a gear reducer system design problem and two dynamic response optimization problems with multiple objectives, five objectives for one and two objectives for the other. Finally, their optimization results are compared with those of the CCD or the 50% over-determined D-optimal design combined with the same trust region sequential approximate optimizer. These comparisons show that the proposed method gives more efficient than others.

A STUDY ON THE EFFICIENCY OF AERODYNAMIC DESIGN OPTIMIZATION USING DISTRIBUTED COMPUTATION (분산컴퓨팅 환경에서 공력 설계최적화의 효율성 연구)

  • Kim Y.-J.;Jung H.-J.;Kim T.-S.;Joh C.-Y.
    • 한국전산유체공학회:학술대회논문집
    • /
    • 2005.10a
    • /
    • pp.163-167
    • /
    • 2005
  • A research to evaluate efficiency of design optimization was performed for aerodynamic design optimization problem in distributed computing environment. The aerodynamic analyses which take most of computational work during design optimization were divided into several jobs and allocated to associated PC clients through network. This is not a parallel process based on domain decomposition rather than a simultaneous distributed-analyses process using network-distributed computers. GBOM(gradient-based optimization method), SAO(Sequential Approximate Optimization) and RSM(Response Surface Method) were implemented to perform design optimization of transonic airfoil and to evaluate their efficiencies. One dimensional minimization followed by direction search involved in the GBOM was found an obstacle against improving efficiency of the design process in distributed computing environment. The SAO was found quite suitable for the distributed computing environment even it has a handicap of local search. The RSM is apparently the fittest for distributed computing environment, but additional trial and error works needed to enhance the reliability of the approximation model are annoying and time-consuming so that they often impair the automatic capability of design optimization and also deteriorate efficiency from the practical point of view.

  • PDF