• Title/Summary/Keyword: polynomial optimization

Search Result 354, Processing Time 0.023 seconds

Design optimization of semi-rigid space steel frames with semi-rigid bases using biogeography-based optimization and genetic algorithms

  • Shallan, Osman;Maaly, Hassan M.;Sagiroglu, Merve;Hamdy, Osman
    • Structural Engineering and Mechanics
    • /
    • v.70 no.2
    • /
    • pp.221-231
    • /
    • 2019
  • This paper performs for the first time a simultaneous optimization for members sections along with semi-rigid beam-to-column connections for space steel frames with fixed, semi-rigid, and hinged bases using a biogeography-based optimization algorithm (BBO) and a genetic algorithm (GA). Furthermore, a member's sections optimization for a fully fixed space frame is carried out. A real and accurate simulation of semi-rigid connection behavior is considered in this study, where the semi-rigid base connections are simulated using Kanvinde and Grilli (2012) nonlinear model, which considers deformations in different base connection components under the applied loads, while beam-to-column connections are modeled using the familiar Frye and Morris (1975) nonlinear polynomial model. Moreover, the $P-{\Delta}$ effect and geometric nonlinearity are considered. AISC-LRFD (2016) specification constraints of the stress and displacement are considered as well as section size fitting constraints. The optimization is applied to two benchmark space frame examples to inspect the effect of semi-rigidity on frame weight and drift using BBO and GA algorithms.

A Survey: SDP, its Duality, Complexity and Applications (SDP의 개관: 쌍대성, 계산복잡성 및 응용)

  • 류춘호;명영수;홍성필
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.26 no.2
    • /
    • pp.13-46
    • /
    • 2001
  • SDP (Semidefinite Programming), as a sort of “cone-LP”, optimizes a linear function over the intersection of an affine space and a cone that has the origin as its apex. SDP, however, has been developed in the process of searching for better solution methods for NP-hard combinatorial optimization problems. We surveyed the basic theories necessary to understand SDP researches. First, We examined SDP duality, comparing it to LP duality, which is essential for the interior point method, Second, we showed that SDP can be optimized from an interior solution in polynomial time with a desired error limit. finally, we summarized several research papers that showed SDP can improve solution methods for some combinatorial optimization problems, and explained why SDP has become one of the most important research topics in optimization. We tried to integrate SDP theories. relatively diverse and complicated. to survey research papers with our own perspective, and thus to help researcher to pursue their SDP researches in depth.

  • PDF

Optimization of inlet velocity profile for uniform epitaxial growth (균일한 에피층 성장을 위한 입구 유속분포 최적화)

  • Cho W. K.;Choi D. H.;Kim M.-U.
    • 한국전산유체공학회:학술대회논문집
    • /
    • 1998.11a
    • /
    • pp.121-126
    • /
    • 1998
  • A numerical optimization procedure is developed to find the inlet velocity profile that yields the most uniform epitaxial layer in a vertical MOCVD reactor. It involves the solution of fully elliptic equations of motion, temperature, and concentration; the finite volume method based on SIMPLE algorithm has been adopted to solve the Navier-Stokes equations. The overall optimization process is highly nonlinear and has been efficiently treated by the sequential linear programming technique that breaks the non-linear problem into a series of linear ones. The optimal profile approximated by a 6th-degree Chebyshev polynomial is very successful in reducing the spatial non-uniformity of the growth rate. The optimization is particularly effective to the high Reynolds number flow. It is also found that a properly constructed inlet velocity profile can suppress the buoyancy driven secondary flow and improve the growth-rate uniformity.

  • PDF

A Study on Feature Selection in Face Image Using Principal Component Analysis and Particle Swarm Optimization Algorithm (PCA와 입자 군집 최적화 알고리즘을 이용한 얼굴이미지에서 특징선택에 관한 연구)

  • Kim, Woong-Ki;Oh, Sung-Kwun;Kim, Hyun-Ki
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.58 no.12
    • /
    • pp.2511-2519
    • /
    • 2009
  • In this paper, we introduce the methodological system design via feature selection using Principal Component Analysis and Particle Swarm Optimization algorithms. The overall methodological system design comes from three kinds of modules such as preprocessing module, feature extraction module, and recognition module. First, Histogram equalization enhance the quality of image by exploiting contrast effect based on the normalized function generated from histogram distribution values of 2D face image. Secondly, PCA extracts feature vectors to be used for face recognition by using eigenvalues and eigenvectors obtained from covariance matrix. Finally the feature selection for face recognition among the entire feature vectors is considered by means of the Particle Swarm Optimization. The optimized Polynomial-based Radial Basis Function Neural Networks are used to evaluate the face recognition performance. This study shows that the proposed methodological system design is effective to the analysis of preferred face recognition.

Shape Optimization of Electromagnetic Devices using High Order Derivativ (고차민감도를 이용한 전기기기 형상 최적화)

  • Ahn, Young-Woo;Kwak, In-Gu;Hahn, Song-Yop;Park, Il-Han
    • Proceedings of the KIEE Conference
    • /
    • 1998.07a
    • /
    • pp.241-243
    • /
    • 1998
  • This paper describes a new method for the faster shape optimization of the electromagnetic devices. In a conventional iterative method of shape design optimization using design sensitivity based on a finite element method, meshes for a new shape of the model are generated and a discretized system equation is solved using the meshes in each iteration. They cause much design time. To save this time, a polynomial approximation of the finite element solution with respect to the geometric design parameters using Taylor expansion is constructed. This approximate state variable expressed explicitly in terms of design parameters is employed in a gradient-based optimization method. The proposed method is applied to the shape design of quadrupole magnet.

  • PDF

Multi-objective Optimization of Lower Control Arm Considering the Stability for Weight Reduction (경량화에 대한 안전성을 고려한 로우컨트롤암의 다목적 최적설계)

  • 이동화;박영철;허선철
    • Transactions of the Korean Society of Automotive Engineers
    • /
    • v.11 no.4
    • /
    • pp.94-101
    • /
    • 2003
  • Recently, miniaturization and weight reduction is getting more attention due to various benefits in automotive components design. It is a trend that the design of experiment(DOE) and statical design method are frequently used for optimization. In this research, the safety of lower control arm is evaluated according to its material change form S45C to A16061 for the reduction of arm's weight. The variance analysis on the basis of structure analysis and DOE is applied to the lower control m. We have proposed a statistical design model to evaluate the effect of structural modification by performing the practical multi-objective optimization considering mass, stress and deflection.

A Six-Phase CRIM Driving CVT using Blend Modified Recurrent Gegenbauer OPNN Control

  • Lin, Chih-Hong
    • Journal of Power Electronics
    • /
    • v.16 no.4
    • /
    • pp.1438-1454
    • /
    • 2016
  • Because the nonlinear and time-varying characteristics of continuously variable transmission (CVT) systems driven by means of a six-phase copper rotor induction motor (CRIM) are unconscious, the control performance obtained for classical linear controllers is disappointing, when compared to more complex, nonlinear control methods. A blend modified recurrent Gegenbauer orthogonal polynomial neural network (OPNN) control system which has the online learning capability to come back to a nonlinear time-varying system, was complied to overcome difficulty in the design of a linear controller for six-phase CRIM driving CVT systems with lumped nonlinear load disturbances. The blend modified recurrent Gegenbauer OPNN control system can carry out examiner control, modified recurrent Gegenbauer OPNN control, and reimbursed control. Additionally, the adaptation law of the online parameters in the modified recurrent Gegenbauer OPNN is established on the Lyapunov stability theorem. The use of an amended artificial bee colony (ABC) optimization technique brought about two optimal learning rates for the parameters, which helped reform convergence. Finally, a comparison of the experimental results of the present study with those of previous studies demonstrates the high control performance of the proposed control scheme.

A QoS Multicast Routing Optimization Algorithm Based on Genetic Algorithm

  • Sun Baolin;Li Layuan
    • Journal of Communications and Networks
    • /
    • v.8 no.1
    • /
    • pp.116-122
    • /
    • 2006
  • Most of the multimedia applications require strict quality of service (QoS) guarantee during the communication between a single source and multiple destinations. This gives rise to the need for an efficient QoS multicast routing strategy. Determination of such QoS-based optimal multicast routes basically leads to a multi-objective optimization problem, which is computationally intractable in polynomial time due to the uncertainty of resources in Internet. This paper describes a network model for researching the routing problem and proposes a new multicast tree selection algorithm based on genetic algorithms to simultaneously optimize multiple QoS parameters. The paper mainly presents a QoS multicast routing algorithm based on genetic algorithm (QMRGA). The QMRGA can also optimize the network resources such as bandwidth and delay, and can converge to the optimal or near-optimal solution within few iterations, even for the networks environment with uncertain parameters. The incremental rate of computational cost can close to polynomial and is less than exponential rate. The performance measures of the QMRGA are evaluated using simulations. The simulation results show that this approach has fast convergence speed and high reliability. It can meet the real-time requirement in multimedia communication networks.

The Design of Genetically Optimized Multi-layer Fuzzy Neural Networks

  • Park, Byoung-Jun;Park, Keon-Jun;Lee, Dong-Yoon;Oh, Sung-Kwun
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.14 no.5
    • /
    • pp.660-665
    • /
    • 2004
  • In this study, a new architecture and comprehensive design methodology of genetically optimized Multi-layer Fuzzy Neural Networks (gMFNN) are introduced and a series of numeric experiments are carried out. The gMFNN architecture results from a synergistic usage of the hybrid system generated by combining Fuzzy Neural Networks (FNN) with Polynomial Neural Networks (PNN). FNN contributes to the formation of the premise part of the overall network structure of the gMFNN. The consequence part of the gMFNN is designed using PNN. The optimization of the FNN is realized with the aid of a standard back-propagation learning algorithm and genetic optimization. The development of the PNN dwells on the extended Group Method of Data Handling (GMDH) method and Genetic Algorithms (GAs). To evaluate the performance of the gMFNN, the models are experimented with the use of a numerical example.

Design of Two-Dimensional Robust Face Recognition System Realized with the Aid of Facial Symmetry with Illumination Variation (얼굴의 대칭성을 이용하여 조명 변화에 강인한 2차원 얼굴 인식 시스템 설계)

  • Kim, Jong-Bum;Oh, Sung-Kwun
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.64 no.7
    • /
    • pp.1104-1113
    • /
    • 2015
  • In this paper, we propose Two-Dimensional Robust Face Recognition System Realized with the Aid of Facial Symmetry with Illumination Variation. Preprocessing process is carried out to obtain mirror image which means new image rearranged by using difference between light and shade of right and left face based on a vertical axis of original face image. After image preprocessing, high dimensional image data is transformed to low-dimensional feature data through 2-directional and 2-dimensional Principal Component Analysis (2D)2PCA, which is one of dimensional reduction techniques. Polynomial-based Radial Basis Function Neural Network pattern classifier is used for face recognition. While FCM clustering is applied in the hidden layer, connection weights are defined as a linear polynomial function. In addition, the coefficients of linear function are learned through Weighted Least Square Estimation(WLSE). The Structural as well as parametric factors of the proposed classifier are optimized by using Particle Swarm Optimization(PSO). In the experiment, Yale B data is employed in order to confirm the advantage of the proposed methodology designed in the diverse illumination variation