• 제목/요약/키워드: Unconstrained Optimization Problem

검색결과 68건 처리시간 0.02초

SCALING METHODS FOR QUASI-NEWTON METHODS

  • MOGHRABI, ISSAM A.R.
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • 제6권1호
    • /
    • pp.91-107
    • /
    • 2002
  • This paper presents two new self-scaling variable-metric algorithms. The first is based on a known two-parameter family of rank-two updating formulae, the second employs an initial scaling of the estimated inverse Hessian which modifies the first self-scaling algorithm. The algorithms are compared with similar published algorithms, notably those due to Oren, Shanno and Phua, Biggs and with BFGS (the best known quasi-Newton method). The best of these new and published algorithms are also modified to employ inexact line searches with marginal effect. The new algorithms are superior, especially as the problem dimension increases.

  • PDF

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

  • 홍경진;김민수;최동훈
    • 대한기계학회논문집A
    • /
    • 제24권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.

선체반류를 고려한 프로펠러 최적 스큐화 (Propeller Skew Optimization Considering Varying Wake Field)

  • 문일성;김건도;유용완;류민철;이창섭
    • 대한조선학회논문집
    • /
    • 제40권5호
    • /
    • pp.26-35
    • /
    • 2003
  • Propellers operating in a given nonuniform ship wake generate unsteady loads leading to undesirable stern vibration problems. The skew is known to be the most proper and effective geometric parameter to control or reduce the fluctuating forces on the shaft. This paper assumes the skew profile as either a quadratic or a cubic function of the radius and determines the coefficients of the polynomial function by applying the simplex method. The method uses the converted unconstrained algorithm to solve the constrained minimization problem of 6-component shaft excitation forces. The propeller excitation was computed either by applying the two-dimensional gust theory for quick estimation or by the fully three-dimensional unsteady lifting surface theory in time domain for an accurate solution. A sample result demonstrates that the shaft forces can be further reduced through optimization from the original design.

Hybrid Induction Motor Control Using a Genetically Optimized Pseudo-on-line Method

  • Lee, Jong-seok;Jang, Kyung-won;J. F. Peters;Ahn, Tae-chon
    • Journal of Power Electronics
    • /
    • 제4권3호
    • /
    • pp.127-137
    • /
    • 2004
  • This paper introduces a hybrid induction motor control using a genetically optimized pseudo-on-line method. Optimization results from the use of a look-up table based on genetic algorithms to find the global optimum of an unconstrained optimization problem. The approach to induction motor control includes a pseudo-on-line procedure that optimally estimates parameters of a fuzzy PID (FPID) controller. The proposed hybrid genetic fuzzy PID (GFPID) controller is applied to speed control of a 3-phase induction motor and its computer simulation is carried out. Simulation results show that the proposed controller performs better than conventional FPID and PID controllers. The contribution of this paper is the introduction of a high performance hybrid form of induction motor control that makes on-line and real-time control of the drive system possible.

Mass optimization of four bar linkage using genetic algorithms with dual bending and buckling constraints

  • Hassan, M.R.A.;Azid, I.A.;Ramasamy, M.;Kadesan, J.;Seetharamu, K.N.;Kwan, A.S.K.;Arunasalam, P.
    • Structural Engineering and Mechanics
    • /
    • 제35권1호
    • /
    • pp.83-98
    • /
    • 2010
  • In this paper, the mass optimization of four bar linkages is carried out using genetic algorithms (GA) with single and dual constraints. The single constraint of bending stress and the dual constraints of bending and buckling stresses are imposed. From the movement response of the bar linkage mechanism, the analysis of the mechanism is developed using the combination of kinematics, kinetics, and finite element analysis (FEA). A penalty-based transformation technique is used to convert the constrained problem into an unconstrained one. Lastly, a detailed comparison on the effect of single constraint and of dual constraints is presented.

구속조건의 효율적인 처리를 위한 유전자 알고리즘의 개발 (Development of Genetic Algorithms for Efficient Constraints Handling)

  • 조영석;최동훈
    • 대한기계학회:학술대회논문집
    • /
    • 대한기계학회 2000년도 춘계학술대회논문집A
    • /
    • pp.725-730
    • /
    • 2000
  • Genetic algorithms based on the theory of natural selection, have been applied to many different fields, and have proven to be relatively robust means to search for global optimum and handle discontinuous or even discrete data. Genetic algorithms are widely used for unconstrained optimization problems. However, their application to constrained optimization problems remains unsettled. The most prevalent technique for coping with infeasible solutions is to penalize a population member for constraint violation. But, the weighting of a penalty for a particular problem constraint is usually determined in the heuristic way. Therefore this paper proposes, the effective technique for handling constraints, the ranking penalty method and hybrid genetic algorithms. And this paper proposes dynamic mutation tate to maintain the diversity in population. The effectiveness of the proposed algorithm is tested on several test problems and results are discussed.

  • PDF

개선소성힌지해석과 SUMT를 이용한 평면 강골조의 연속최적설계 (Optimum Design of Plane Steel Frame Structures Using Refined Plastic Hinge Analysis and SUMT)

  • 윤영묵;강문명;이말숙
    • 한국강구조학회 논문집
    • /
    • 제16권1호통권68호
    • /
    • pp.21-32
    • /
    • 2004
  • 본 연구에서는 다제약 설계변수를 갖는 비선형 문제를 무제약 최소화 문제로 전환하는 축차무제약 최소화기법(SUMT)과 효과적인 강골조의 2차비탄성해석 방법 중의 하나인 개선소성힌지해석 방법을 접목시킨 평면 강골조의 연속최적설계 모델 및 프로그램을 개발하였다. 최적설계를 위한 목적함수로는 강골조물을 구성하는 모든 부재의 중량 합을, 제약조건으로는 AISC-LRFD의 휨강도, 전단강도, 압축 및 인장강도, 국부좌굴 및 부재좌굴, 그리고 단면형상 등에 관한 설계기준을 사용하였다. 본 연구에서 개발한 연속최적설계 모델을 이용하여 여러 평면 강골조의 최적설계를 수행하였으며, 최적설계 견과로부터 개발한 연속최적설계 모델의 사용성, 타당성, 효율성 및 경제성 등을 검토하였다.

Efficient Approximation Method for Constructing Quadratic Response Surface Model

  • Park, Dong-Hoon;Hong, Kyung-Jin;Kim, Min-Soo
    • Journal of Mechanical Science and Technology
    • /
    • 제15권7호
    • /
    • pp.876-888
    • /
    • 2001
  • For a large scaled optimization based on response surface methods, an efficient quadratic approximation method is presented in the context of the trust region model management strategy. If the number of design variables is η, the proposed method requires only 2η+1 design points for one approximation, which are a center point and tow additional axial points within a systematically adjusted trust region. These design points are used to uniquely determine the main effect terms such as the linear and quadratic regression coefficients. A quasi-Newton formula then uses these linear and quadratic coefficients to progressively update the two-factor interaction effect terms as the sequential approximate optimization progresses. In order to show the numerical performance of the proposed method, a typical unconstrained optimization problem and two dynamic response optimization problems with multiple objective are solved. Finally, their optimization results compared with those of the central composite designs (CCD) or the over-determined D-optimality criterion show that the proposed method gives more efficient results than others.

  • PDF

트러스 구조물의 형상최적화에 관한 연구 (The configuration Optimization of Truss Structure)

  • 임연수;최병한;이규원
    • 한국강구조학회 논문집
    • /
    • 제16권1호통권68호
    • /
    • pp.123-134
    • /
    • 2004
  • 본 연구에서는 효율적인 형상최적화를 위해 다단계 분할기법으로 트러스 구조물의 형상 최적화를 시도하였다. 1단계에서는 단면적을 설계변수로 하여 중량, 또는 체적을 목적함수로 하고 다하중 재하조건 하의 거동제약조건과 부가적인 제약조건을 고려하여 비선형 최적화 문제를 형성한다. 이 비선형 계획문제를 축차 선형계획 문제로 변환하여 개선된 허용방향법으로 최적화하였다. 이때 필요한 도함수는 다른 연구와 달리 효율적이라고 알려진 거동공간법으로 구하였고, 최적화 과정 중 이를 이용하여 부재력를 근사화 함으로써 계산의 효율성을 높였다. 2단계에서는 형상 설계변수만을 고려한 무제약 최적화 문제로 형성한 후 일방향 탐사기법을 적용하여 형상을 최적화하였다. 이와 같이 구성된 본 연구의 알고리즘을 몇 가지 트러스 구조물에 적용하여 본 알고리즘의 적용성과 효율성 및 타당성을 증명하였다.

수정된 비용함수를 이용한 비선형 최적화 방법 기반의 이동로봇의 장애물 회피 비주얼 서보잉 (Visual Servoing of a Wheeled Mobile Robot with the Obstacle Avoidance based on the Nonlinear Optimization using the Modified Cost Function)

  • 김곤우
    • 전기학회논문지
    • /
    • 제58권12호
    • /
    • pp.2498-2504
    • /
    • 2009
  • The fundamental research for the mobile robot navigation using the numerical optimization method is presented. We propose an image-based visual servo navigation algorithm for a wheeled mobile robot utilizing a ceiling mounted camera. For the image-based visual servoing, we define the composite image Jacobian which represents the relationship between the speed of wheels of a mobile robot and the robot's overall speed in the image plane. The rotational speed of wheels of a mobile robot can be directly related to the overall speed of a mobile robot in the image plane using the composite image Jacobian. We define the mobile robot navigation problem as an unconstrained optimization problem to minimize the cost function with the image error between the goal position and the position of a mobile robot. In order to avoid the obstacle, the modified cost function is proposed which is composed of the image error between the position of a mobile robot and the goal position and the distance between the position of a mobile robot and the position of the obstacle. The performance was evaluated using the simulation.