• 제목/요약/키워드: Approximated optimization problem

검색결과 42건 처리시간 0.023초

ON LINEARIZED VECTOR OPTIMIZATION PROBLEMS WITH PROPER EFFICIENCY

  • Kim, Moon-Hee
    • Journal of applied mathematics & informatics
    • /
    • 제27권3_4호
    • /
    • pp.685-692
    • /
    • 2009
  • We consider the linearized (approximated) problem for differentiable vector optimization problem, and then we establish equivalence results between a differentiable vector optimization problem and its associated linearized problem under the proper efficiency.

  • PDF

최적설계시 이차근사법의 수치성능 평가에 관한 연구 (An Evaluation of the Second-order Approximation Method for Engineering Optimization)

  • 박영선;박경진;이완익
    • 대한기계학회논문집
    • /
    • 제16권2호
    • /
    • pp.236-247
    • /
    • 1992
  • Optimization has been developed to minimize the cost function while satisfying constraints. Nonlinear Programming method is used as a tool for the optimization. Usually, cost and constraint function calculations are required in the engineering applications, but those calculations are extremely expensive. Especially, the function and sensitivity analyses cause a bottleneck in structural optimization which utilizes the Finite Element Method. Also, when the functions are quite noisy, the informations do not carry out proper role in the optimization process. An algorithm called "Second-order Approximation Method" has been proposed to overcome the difficulties recently. The cost and constraint functions are approximated by the second-order Taylor series expansion on a nominal points in the algorithm. An optimal design problem is defined with the approximated functions and the approximated problem is solved by a nonlinear programming numerical algorithm. The solution is included in a candidate point set which is evaluated for a new nominal point. Since the functions are approximated only by the function values, sensitivity informations are not needed. One-dimensional line search is unnecessary due to the fact that the nonlinear algorithm handles the approximated functions. In this research, the method is analyzed and the performance is evaluated. Several mathematical problems are created and some standard engineering problems are selected for the evaluation. Through numerical results, applicabilities of the algorithm to large scale and complex problems are presented.presented.

구조최적설계시 직접법 및 근사법 알고리즘의 성능 비교에 관한 연구 (A Study on the Comparison of Performances Between Direct Method and Approximation Method in Structural Optimization)

  • 박영선;이상헌;박경진
    • 대한기계학회논문집
    • /
    • 제18권2호
    • /
    • pp.313-322
    • /
    • 1994
  • Structural optimization has been developed by two methods. One is the direct method which applies the Nonlinear Programming (NLP) algorithm directly to the structural optimization problem. This method is known to be very excellent mathematically. However, it is very expensive for large-scale problems due to the one-dimensional line search. The other method is the approximation method which utilizes the engineering senses very well. The original problem is approximated to a simple problem and an NLP algorithm is adopted for solving the approximated problems. Practical solutions are obtained with low cost by this method. The two methods are compared through standard structural optimization problems. The Finite element method with truss and beam elements is used for the structural and sensitivity analyses. The results are analyzed based on the convergence performances, the number is function calculations, the quality of the cost functions, and etc. The applications of both methods are also discussed.

순차 컨벡스 프로그래밍 기반 무인기 설계 형상의 성능 분석 (Sequential Convex Programming Based Performance Analysis of UAV Design)

  • 고효상;최한림;장종윤;김준;유구현
    • 한국항공우주학회지
    • /
    • 제50권11호
    • /
    • pp.771-781
    • /
    • 2022
  • 순차 컨벡스 최적화 기법을 사용한 궤적 최적화로 무인기 기초 설계 형상의 성능 분석을 수행했다. 외부 공력 모델로 설계한 비선형 궤적 최적화 문제는 볼록화와 이산화를 통해 2차 원뿔 프로그램 문제로 근사 되었다. 알고리즘의 성능 향상을 위해 제약조건을 완화한 문제의 해를 초기 궤적으로 사용했다. 근사해의 반복적인 탐색으로 하강 궤적 최적화 문제들을 분석했으며 설계 형상의 구동부 성능에 따른 최대 도달 속도를 비교했다.

An Efficient Dynamic Response Optimization Using the Design Sensitivities Approximated Within the Estimate Confidence Radius

  • Park, Dong-Hoon;Kim, Min-Soo
    • Journal of Mechanical Science and Technology
    • /
    • 제15권8호
    • /
    • pp.1143-1155
    • /
    • 2001
  • In order to reduce the expensive CPU time for design sensitivity analysis in dynamic response optimization, this study introduces the design sensitivities approximated within estimated confidence radius in dynamic response optimization with ALM method. The confidence radius is estimated by the linear approximation with Hessian of quasi-Newton formula and qualifies the approximate gradient to be validly used during optimization process. In this study, if the design changes between consecutive iterations are within the estimated confidence radius, then the approximate gradients are accepted. Otherwise, the exact gradients are used such as analytical or finite differenced gradients. This hybrid design sensitivity analysis method is embedded in an in-house ALM based dynamic response optimizer, which solves three typical dynamic response optimization problems and one practical design problem for a tracked vehicle suspension system. The optimization results are compared with those of the conventional method that uses only exact gradients throughout optimization process. These comparisons show that the hybrid method is more efficient than the conventional method. Especially, in the tracked vehicle suspension system design, the proposed method yields 14 percent reduction of the total CPU time and the number of analyses than the conventional method, while giving similar optimum values.

  • PDF

Approximate discrete variable optimization of plate structures using dual methods

  • Salajegheh, Eysa
    • Structural Engineering and Mechanics
    • /
    • 제3권4호
    • /
    • pp.359-372
    • /
    • 1995
  • This study presents an efficient method for optimum design of plate and shell structures, when the design variables are continuous or discrete. Both sizing and shape design variables are considered. First the structural responses such as element forces are approximated in terms of some intermediate variables. By substituting these approximate relations into the original design problem, an explicit nonlinear approximate design task with high quality approximation is achieved. This problem with continuous variables, can be solved by means of numerical optimization techniques very efficiently, the results of which are then used for discrete variable optimization. Now, the approximate problem is converted into a sequence of second level approximation problems of separable form and each of which is solved by a dual strategy with discrete design variables. The approach is efficient in terms of the number of required structural analyses, as well as the overall computational cost of optimization. Examples are offered and compared with other methods to demonstrate the features of the proposed method.

Trajectory Optimization for a Supersonic Air-Breathing Missile System Using Pseudo-Spectral Method

  • Park, Jung-Woo;Tahk, Min-Jea;Sung, Hong-Gye
    • International Journal of Aeronautical and Space Sciences
    • /
    • 제10권1호
    • /
    • pp.112-121
    • /
    • 2009
  • This paper deals with supersonic air-breathing missile system. A supersonic air-breathing missile system has very complicated and incoherent thrust characteristics with respect to outer and inner environment during operation. For this reason, the missile system has many maneuver constraints and is allowed to operate within narrow flight envelope. In this paper, trajectory optimization of the missile is accomplished. The trajectory optimization problem is formulated as a discrete parameter optimization problem. For this formulation, Legendre Pseudo-Spectral method is introduced. This method is based on calculating the state and control variables on Legendre-Gauss-Lobatto (LGL) points. This approach helps to find approximated derivative and integration quantities simply. It is shown that, for this trajectory optimization, trend analysis is performed from thrust characteristics on various conditions so that the trajectory optimization is accomplished with fine initial guess with these results.

Design Centering by Genetic Algorithm and Coarse Simulation

  • Jinkoo Lee
    • 한국CDE학회논문집
    • /
    • 제2권4호
    • /
    • pp.215-221
    • /
    • 1997
  • A new approach in solving design centering problem is presented. Like most stochastic optimization problems, optimal design centering problems have intrinsic difficulties in multivariate intergration of probability density functions. In order to avoid to avoid those difficulties, genetic algorithm and very coarse Monte Carlo simulation are used in this research. The new algorithm performs robustly while producing improved yields. This result implies that the combination of robust optimization methods and approximated simulation schemes would give promising ways for many stochastic optimizations which are inappropriate for mathematical programming.

  • PDF

반응면 기법을 이용한 항공기 날개 스파 단면적의 최적화 연구 (Aircraft Wing Spar Cross-section Area Optimization with Response Surface Method)

  • 박찬우
    • 한국정밀공학회지
    • /
    • 제19권4호
    • /
    • pp.109-116
    • /
    • 2002
  • The solution of the aircraft wing spar cross-section area optimization problem is obtained by the response surface method. The object function of the problem is wing total weight, design variables are spar cross-section areas, constraints are the conditions that the stresses at the each spar is less than the allowable stress. D-Optimal condition is utilized to obtain the experimental points to construct the response surfaces. D-Optimal experimental points are obtained by the commercial software "Deign-Expert". Response values for the object function and constraints for each experimental point are calculated by the NASTRAN. Response surfaces for object function and constraints are approximated from the response values by the least square method. The optimization solution is obtained by the DOT for the response surfaces of object function and constraints. The optimization results obtained from the response surface are compared with the results obtained by the NASTRAN SOL200.