• Title/Summary/Keyword: Feasible Direction Algorithm

Search Result 38, Processing Time 0.024 seconds

A GLOBALLY AND SUPERLIEARLY CONVERGENT FEASIBLE SQP ALGORITHM FOR DEGENERATE CONSTRAINED OPTIMIZATION

  • Chen, Yu;Xie, Xiao-Liang
    • Journal of applied mathematics & informatics
    • /
    • v.28 no.3_4
    • /
    • pp.823-835
    • /
    • 2010
  • In this paper, A FSQP algorithm for degenerate inequality constraints optimization problems is proposed. At each iteration of the proposed algorithm, a feasible direction of descent is obtained by solving a quadratic programming subproblem. To overcome the Maratos effect, a higher-order correction direction is obtained by solving another quadratic programming subproblem. The algorithm is proved to be globally convergent and superlinearly convergent under some mild conditions. Finally, some preliminary numerical results are reported.

Structure Optimization FEA Code Development Under Frequency Constraints by Using Feasible Direction Optimization Method (유용방향법 최적화 알고리즘을 사용한 고유진동수에 대한 구조 최적설계 FEA 모듈 개발)

  • Cho, Hee Keun
    • Journal of the Korean Society of Manufacturing Technology Engineers
    • /
    • v.22 no.1
    • /
    • pp.63-69
    • /
    • 2013
  • In order to find the optimum design of structures that have characteristic natural frequency range, a numerical optimization method to solving eigenvalue problems is a widely used approach. However in the most cases, it is difficult to decide the accurate thickness and shape of structures that have allowable natural frequency in design constraints. Parallel analysis algorithm involving the feasible direction optimization method and Rayleigh-Ritz eigenvalue solving method is developed. The method is implemented by using finite element method. It calculates the optimal thickness and the thickness ratio of individual elements of the 2-D plane element through a parallel algorithm method which satisfy the design constraint of natural frequency. As a result this method of optimization for natural frequency by using finite element method can determine the optimal size or its ratio of geometrically complicated shape and large scale structure.

Frequency Optimization Using by Feasible Direction Method (유용방향법에 의한 고유진동수 최적화)

  • 조희근;박영원
    • Proceedings of the Korean Society of Machine Tool Engineers Conference
    • /
    • 2000.10a
    • /
    • pp.410-415
    • /
    • 2000
  • In this paper feasible direction method which is one of the optimization method is adopted to natural frequency optimization. In order to find the optimum design of structures that have characteristic natural frequency range, a numerical optimization method to solving eigenvalue problems is a widely used approach. However most cases, it is difficult to decide the accurate thickness and shape of structures that have allowable natural frequency in design constraints. Parallel analysis algorithm involving the feasible direction optimization method and Rayleight-Ritz eigenvalue solving method is developed. The method is implemented by using finite element method. It calculated the optimal thickness and the thickness ratio of each element of 2-D plane element through the parallel algorithm method which satisfy the design constraint of natural frequency.

  • PDF

Thermo-elastic Creep and Frequency Optimization by Using Feasible Direction Method (Feasible Direction Method를 사용한 열.탄성.크리프 및 진동수에 대한 최적화)

  • Jo, Hui-Geun;Park, Yeong-Won;Gang, Yeon-Sik;Lee, Gyeong-Don
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.25 no.5
    • /
    • pp.857-865
    • /
    • 2001
  • In finite element analysis, engineering optimizations are divided two major parts that are topology and structural optimization. Until these days most structural optimizations usually concentrate on single disciplinary optimization. Therefore numerical analysis and methodology which can optimize thermo-elastic creep and frequency phenomena are not suggested. In this paper finite element analysis methodology and algorithm of thermo -elastic creep and frequency optimizations are suggested and corroborate the efficiency of suggested new numerical methodology and algorithm by solving example problem.

A Unified Phase I - Phase II Semi-Infinite Constrained Optimization Algorithm with a Varying Steering Parameter (가변의 조정변수를 갖는 복합된 1-2 단계 최적화 알고리즘)

  • Yang, Hyun-Suk
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.31B no.9
    • /
    • pp.27-35
    • /
    • 1994
  • It is known that a unified phase I-phase II semi-infinite optimization algorithm with a steerign parameter performs better than the original unified phase I-phase II algorithm. In this paper, the effect of the steering parameter is analized and a new algorithm is presented based on the facts that when the point x is far away from the feasible region, reaching to the feasible region is more important than minimizing the cost functio and that when the point x is near the region, it is more efficient to try to reach the feasible region and to minimize the cost function concurrently. It is also important to consider the relationship between the feasible direction and the gradient of the cost function. Even though changing the steering parameter does not change the rate of convergence of the algorithm, it is shown from examples that given new algorithm is more efficient than the previous ones.

  • PDF

An analysis and modification of a unified phase 1-phase 2 semi-infinite constrained optimization algorithm

  • Yang, Hyun-Suk
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1994.10a
    • /
    • pp.483-487
    • /
    • 1994
  • In this paper, we analize the effect of a steering water used in a unified phase I-phase II semi-infinite constrained optimization algorithm and present a new algorithm based on the facts that when the point x is far away from the feasible region where all the constraints are satisfied, reaching to the feasible region is more important than minimizing the cost function and that when the point x is near the region, it is more efficient to try to reach the feasible region and to minimize the cost function concurrently. Also, the angle between the search direction vector and the gradient of the cost function is considered when the steering parameter value is computed. Even though changing the steering parameter does not change the rate of convergence of the algorithm, we show through some examples that the proposed algorithm performs better than the other algorithms.

  • PDF

Numerical optimization design by computational fluid dynamics (전산유체역학을 이용한 수치 최적설계)

  • Lee, Jeong-U;Mun, Yeong-Jun
    • Transactions of the Korean Society of Mechanical Engineers B
    • /
    • v.20 no.7
    • /
    • pp.2347-2355
    • /
    • 1996
  • Purpose of the present study is to develop a computational design program for shape optimization, combining the numerical optimization technique with the flow analysis code. The present methodology is then validated in three cases of aerodynamic shape optimization. In the numerical optimization, a feasible direction optimization algorithm and shape functions are considered. In the flow analysis, the Navier-Stokes equations are discretized by a cell-centered finite volume method, and Roe's flux difference splitting TVD scheme and ADI method are used. The developed design code is applied to a transonic channel flow over a bump, and an external flow over a NACA0012 airfoil to minimize the wave drag induced by shock waves. Also a separated subsonic flow over a NACA0024 airfoil is considered to determine a maximum allowable thickness of the airfoil without separation.

Optimization Design of Cascade with Rotor-Stator Interaction Effects (정익과 동익의 상호작용을 고려한 익렬의 공력 최적 설계)

  • Cho, J, K.;Jung, Y. R.;Park, W. G.
    • 유체기계공업학회:학술대회논문집
    • /
    • 2001.11a
    • /
    • pp.293-299
    • /
    • 2001
  • Since the previous cut-and-try design algorithm require much cost and time, it has recently been concerned the automatic design technique using the CFD and optimum design algorithm. In this study, the Navier-Stokes equations is solved to consider the more detail viscous flow informations of cascade interaction and O-H multiblock grid system is generated to impose an accurate boundary condition. The cubic-spline interpolation is applied to handle a relative motion of a rotor to the stator. To validate present procedure, the time averaged aerodynamic loads are compared with experiment and good agreement obtained. Once the N-S equations have been solved, the computed aerodynamic loads may be used to computed the sensitivities of the aerodynamic objective function. The Modified Method of feasible Direction(MMFD) is usef to compute the

  • PDF

Experimental Study on Modifiable Walking Pattern Generation for Handling Infeasible Navigational Commands

  • Hong, Young-Dae;Lee, Bumjoo
    • Journal of Electrical Engineering and Technology
    • /
    • v.10 no.6
    • /
    • pp.2368-2375
    • /
    • 2015
  • To accommodate various navigational commands, a humanoid should be able to change its walking motion in real time. Using the modifiable walking pattern generation (MWPG) algorithm, a humanoid can handle dynamic walking commands by changing its walking period, step length, and direction independently. If the humanoid is given a command to perform an infeasible movement, the algorithm substitutes the infeasible command with a feasible one using binary search. The feasible navigational command is subsequently translated into the desired center-of-mass (CM) state. Every sample time CM reference is generated using a zero-moment-point (ZMP) variation scheme. Based on this algorithm, various complex walking patterns can be generated, including backward and sideways walking, without detailed consideration of the feasibility of the navigational commands. In a previous study, the effectiveness of the MWPG algorithm was verified by dynamic simulation. This paper presents experimental results obtained using the small-sized humanoid robot platform DARwIn-OP.

Modifiable Walking Pattern Generation Handling Infeasible Navigational Commands for Humanoid Robots

  • Lee, Bum-Joo;Kim, Kab Il
    • Journal of Electrical Engineering and Technology
    • /
    • v.9 no.1
    • /
    • pp.344-351
    • /
    • 2014
  • In order to accomplish complex navigational commands, humanoid robot should be able to modify its walking period, step length and direction independently. In this paper, a novel walking pattern generation algorithm is proposed to satisfy these requirements. Modification of the walking pattern can be considered as a transition between two periodic walking patterns, which follows each navigational command. By assuming the robot as a linear inverted pendulum, the equations of motion between ZMP(Zero Moment Point) and CM(Center of Mass) state is easily derived and analyzed. After navigational command is translated into the desired CM state, corresponding CM motion is generated to achieve the desired state by using simple ZMP functions. Moreover, when the command is not feasible, feasible command is alternated by using binary search algorithm. Subsequently, corresponding CM motion is generated. The effectiveness of the proposed algorithm is verified by computer simulation.