• Structural Engineering and Mechanics
• /
• 제52권3호
• /
• pp.445-468
• /
• 2014

In this paper a new particle swarm ray optimization algorithm is proposed for truss shape and size optimization with natural frequency constraints. These problems are believed to represent nonlinear and non-convex search spaces with several local optima and therefore are suitable for examining the capabilities of new algorithms. The proposed algorithm can be viewed as a hybridization of Particle Swarm Optimization (PSO) and the recently proposed Ray Optimization (RO) algorithms. In fact the exploration capabilities of the PSO are tried to be promoted using some concepts of the RO. Five numerical examples are examined in order to inspect the viability of the proposed algorithm. The results are compared with those of the PSO and some other existing algorithms. It is shown that the proposed algorithm obtains lighter structures in comparison to other methods most of the time. As will be discussed, the algorithm's performance can be attributed to its appropriate exploration/exploitation balance.

• Journal of Communications and Networks
• /
• 제18권6호
• /
• pp.873-883
• /
• 2016

In this paper, we focus on maximizing weighted sum energy efficiency (EE) for a multi-cell multi-user channel. In order to solve this non-convex problem, we first decompose the original problem into a sequence of parallel subproblems which can optimized separately. For each subproblem, a base station employs dirty paper coding to maximize the EE for users within a cell while regulating interference induced to other cells. Since each subproblem can be transformed to a convex multiple-access channel problem, the proposed method provides a closed-form solution for power allocation. Then, based on the derived optimal covariance matrix for each subproblem, a local optimal solution is obtained to maximize the sum EE. Finally, simulation results show that our algorithm based on non-linear precoding achieves about 20 percent performance gains over the conventional linear precoding method.

• 제어로봇시스템학회논문지
• /
• 제11권4호
• /
• pp.279-283
• /
• 2005

This paper deals with the design of a low-order H/sub ∞/ controller by using an iterative linear matrix inequality (LMI) method. The low-order H/sub ∞/ controller is represented in terms of LMIs with a rank condition. To solve the non-convex rank-constrained LMI problem, the recently developed penalty function method is applied. With an increasing sequence of the penalty parameter, the solution of the penalized optimization problem moves towards the feasible region of the original non-convex problem. Numerical experiments showed the effectiveness of the proposed algorithm.

• Journal of applied mathematics & informatics
• /
• 제18권1_2호
• /
• pp.1-23
• /
• 2005

The decentralized static output feedback design problem is considered. A constrained trust region method is developed that solves this optimal control problem when a complete set of state variables is not available. The considered problem is interpreted as a non-linear (non-convex) constrained matrix optimization problem. Then, a decentralized constrained trust region method is developed for this problem class exploiting the diagonal structure of the problem and using inexact computations. Finally, numerical results are given for the proposed method.

• 한국공작기계학회:학술대회논문집
• /
• 한국공작기계학회 1999년도 춘계학술대회 논문집
• /
• pp.141-146
• /
• 1999

A new method, so called MMA(Method of Moving Asymptotes) was applied to the optimization problems of non-linear functions and non-linear structures. In each step of the iterative process, tile MMA generates a strictly convex approximation subproblems and solves them by using the dual problems. The generation of these subproblems is controlled by so called 'moving asymptotes', which may both make no oscillation and speed up tile convergence rate of optimization process. By contrast in generalized dual function, the generated function by MMA is always explicit type. Both the objective and behaviour constraints which were approximated are optimized by dual function. As the results of some examples, it was found that this method is very effective to obtain the global solution for problems with many local solutions. Also it was found that MMA is a very effective approximate method using the original function and its 1st derivatives.

• Structural Engineering and Mechanics
• /
• 제62권5호
• /
• pp.537-550
• /
• 2017

Structural sizing is a rewarding task due to its non-convex constrained nature in the design space. In order to provide both global exploration and proper search refinement, a hybrid method is developed here based on outstanding features of Evolutionary Computing and Teaching-Learning-Based Optimization. The new method introduces an observer phase for memory exploitation in addition to vector-sum movements in the original teacher and learner phases. Proper integer coding is suited and applied for structural size optimization together with a fly-to-boundary technique and an elitism strategy. Performance of the proposed method is further evaluated treating a number of truss examples compared with teaching-learning-based optimization. The results show enhanced capability of the method in efficient and stable convergence toward the optimum and effective capturing of high quality solutions in discrete structural sizing problems.

• Wind and Structures
• /
• 제32권4호
• /
• pp.355-369
• /
• 2021

Shape optimization of tall buildings is an efficient approach to mitigate wind-induced effects. Several studies have demonstrated the potential of shape modifications to improve the building's aerodynamic properties. On the other hand, it is well-known that the cross-section geometry has a direct impact in the floor area availability and subsequently in the building's profitability. Hence, it is of interest for the designers to find the balance between these two design criteria that may require contradictory design strategies. This study proposes a surrogate-based multi-objective optimization framework to tackle this design problem. Closed-form equations provided by the Eurocode are used to obtain the wind-induced responses for several wind directions, seeking to develop an industry-oriented approach. CFD-based surrogates emulate the aerodynamic response of the building cross-section, using as input parameters the cross-section geometry and the wind angle of attack. The definition of the building's modified plan shapes is done adopting the reduced basis approach, advancing the current strategies currently adopted in aerodynamic optimization of civil engineering structures. The multi-objective optimization problem is solved with both the classical weighted Sum Method and the Weighted Min-Max approach, which enables obtaining the complete Pareto front in both convex and non-convex regions. Two application examples are presented in this study to demonstrate the feasibility of the proposed strategy, which permits the identification of Pareto optima from which the designer can choose the most adequate design balancing profitability and occupant comfort.

• 응용통계연구
• /
• 제33권4호
• /
• pp.511-526
• /
• 2020

단세포 RNA 시퀀싱 데이터(single-cell RNA-sequencing data, 이하 단세포 RNA 데이터)는 세포 조직으로부터 추출한 각 단세포 별 유전자의 신호를 기록한 데이터로, 세포 간의 이질성을 파악하는 것을 주요 목적으로 한다. 그러나 단세포 RNA 데이터는 샘플링 및 기술적인 한계로 인해 결측비율이 높고, 노이즈가 크다. 이러한 이유 때문에 기존의 군집화 방법을 적용하는 데에 한계가 존재한다. 본 논문에서는 단세포 RNA 데이터 분석에서 모티브를 얻어 스펙트럼 군집화(spectral clustering) 기반의 방법을 제안한다. 특히 유사도 행렬(similarity matrix) 계산에서 유전자 별로 가중치를 부여하여 기존의 단세포 데이터 분석 방법과 차별화하였다. 제안하는 군집화 방법은 유전자별 가중치를 부여함과 동시에 세포를 군집화한다. 군집화는 반복 알고리즘을 통해 제안하는 비볼록식(non-convex optimization)을 풀어 진행한다. 또한 실데이터 적용과 시뮬레이션을 통해 제안하는 군집화 방법이 기존의 방법보다 군집을 잘 구분하는 것을 보인다.

• 전자공학회논문지SC
• /
• 제45권5호
• /
• pp.1-7
• /
• 2008

본 논문에서는 변수 불확실성을 가지는 이산시간 특이시스템과 곱셈형 섭동의 약성(fragility)을 가지는 제어기에 대한 강인 안정화 기법과 강인 비약성(non-fragile) 제어기 설계방법을 제시한다. 강인 안정화를 만족하는 비약성 제어기가 존재할 조건과 제어기 설계방법 및 제어기의 비약성 척도를 볼록최적화(convex optimization)가 가능한 선형행렬부등식 접근방법을 이용하여 제안한다. 최대의 비약성 척도를 얻기 위하여 구한 제어기 충분조건은 모든 변수의 견지에서 선형행렬부등식으로 변형한다. 따라서, 제안한 강인 비약성 이산 제어기는 특이시스템의 변수 불확실성과 제어기의 약성에도 불구하고 안정성을 보장한다 마지막으로, 수치예제를 통하여 제안한 알고리듬의 타당성을 확인한다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제6권11호
• /
• pp.3008-3025
• /
• 2012

In this paper, the downlink resource allocation of OFDMA system with decode-and-forward (DF) relaying is investigated. A non-convex optimization problem maximizing system throughput with users' satisfaction constraints is formulated with joint relay selection, subcarrier assignment and power allocation. We first transform it to a standard convex problem and then solve it by dual decomposition. In particular, an Optimal resource allocation scheme With Time-sharing (OWT) is proposed with combination of relay selection, subcarrier allocation and power control. Due to its poor adaption to the fast-varying environment, an improved version with subcarrier Monopolization (OWM) is put forward, whose performance promotes about 20% compared with that of OWT in the fast-varying vehicular environment. In fact, OWM is the special case of OWT with binary time-sharing factor and OWT can be seen as the tight upper bound of the OWM. To the best of our knowledge, such algorithms and their relation have not been accurately investigated in cooperative OFDMA networks in the literature. Simulation results show that both the system throughput and the users' satisfaction of the proposed algorithms outperform the traditional ones.