• Interaction and multiscale mechanics
• /
• v.3 no.3
• /
• pp.267-276
• /
• 2010

A nonlocal finite element model is developed for solving elasto-static frictional contact problems of nanostructures and nanoscale devices. A two dimensional Eringen-type nonlocal elasticity model is adopted. The material is characterized by a stress-strain constitutive relation of a convolution integral form whose kernel is capable to take into account both the diffusion process of nonlocal elasticity and the scale ratio effects. The incremental convex programming procedure is exploited as a solver. Two examples of different nature are presented, the first one presents the behavior of a nanoscale contacting system and the second example discusses the nano-indentation problem.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.15 no.26
• /
• pp.67-76
• /
• 1992

변수의 어떤 값들에 대해 도함수를 가질 수 없는 함수를 최적화해야 하는 등. OR 에서는 여러 상황이 존재한다. 이것은 Convex Analysis〔12〕서 이론적인 differential calculus를 근저로 하는 Non-differentiable Optimization 또는 Non-smooth Optimization 을 취급하는 것이 된다. 이러한 종류의 미분이 가능하지 않은 최적화문제는 연속함수를 위한 종래의 최적화법으로는 그 해법자체가 갖고 있는 연속성의 한계를 극복할 수 없다. 따라서, 이러한 문제를 해결하기 위해 Demyanov〔4〕가 제시한 quasi-differental function의 정의와 이들 함수에 따른 몇가지 주요정리들을 언급하고, 그것들을 토대로 Non-differentiable optimization problem의 수치적인 방법을 수행하기 위해 일종의 modified gradient 법을 제시한다. 이를 이용해서 numerical experiment를 위한 방법을 구체화하여, unrestricted non-differentable optimization problem에 적응하여, 그 수치해 결과를 보여서 그 타당성음 검토하였다.

• Proceedings of the KIEE Conference
• /
• 2007.04a
• /
• pp.149-151
• /
• 2007

For several decades, VSC has gained much attention as one of the useful design tools for handling the practical system with uncertainties or disturbances. Generally, the disturbances in the matching condition can be perfectly rejected via VSC; however, these in the mismatching condition are known to be hardly rejected. There have been some trials on it, in which the resulting controls in fact belong to the class of robust control guaranteeing disturbance ${\gamma}$-attenuation. Therefore, in this paper, we propose a new Variable Structure Control (VSC) for a system with mismatched disturbances. The proposed controller is composed of linear and nonlinear parts; the former plays a role in stabilizing the system and the latter takes care of attenuating the disturbances. The main contribution is to introduce the concept of switching-zone, rather than switching-surface, that is designed through piece-wise Lyapunov functions. The resulting non-convex conditions are formulated with an iterative linear programming algorithm, which provides an excellent performance of almost rejecting the disturbances.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.16 no.1
• /
• pp.51-64
• /
• 2012

This paper provides an efficient dimension reduction algorithm of the positive realization of discrete phase type(DPH) distributions. The relationship between the representation of DPH distributions and the positive realization of the positive system is explained. The dimension of the positive realization of a discrete phase-type realization may be larger than its McMillan degree of probability generating functions. The positive realization with sufficient large dimension bound can be obtained easily but generally, the minimal positive realization problem is not solved yet. We propose an efficient dimension reduction algorithm to make the positive realization with tighter upper bound from a given probability generating functions in terms of convex cone problem and linear programming.

• Journal of the Korea Safety Management & Science
• /
• v.15 no.1
• /
• pp.77-85
• /
• 2013

In the location science, environmental effect becomes a new main consideration for site selection. For the unwanted facility location selection, decision makers should consider the cost of resolving the environmental conflict. We introduced the negative influence cost for the facility which was inversely proportional to distance between the facility and residents. An unwanted facility location problem was suggested to minimize the sum of the negative influence cost and the transportation cost. The objective cost function was analyzed as nonlinear type and was neither convex nor concave. Three GRASP (Greedy Randomized adaptive Search Procedure) methods as like Random_GRASP, Epsilon_GRASP and GRID_GRASP were developed to solve the unwanted facility location problem. The Newton's method for nonlinear optimization problem was used for local search in GRASP. Experimental results showed that quality of solution of the GRID_GRASP was better than those of Random_GRASP and Epsilon_GRASP. The calculation time of Random_GRASP and Epsilon_GRASP were faster than that of Grid_GRASP.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2004.10a
• /
• pp.221-224
• /
• 2004

본 논문에서는 볼록이차계획법을 위한 감도분석의 특성을 분석한다. 이를 위해, 볼록이차계획법을 위한 ${\epsilon}$-감도분석 방법, 최적분할에 의한 감도분석 방법, Yildirim-Todd의 감도분석 방법 등을 유도한다. ${\epsilon}$-감도분석의 경우, 내부점방법의 전개상 얻어지는 계산량을 활용할 수 있도록 유도하여 실용성을 높인다. 또한, 선형계획법을 위한 Yildirim-Todd의 감도분석 방법을 볼록이차계획법에 적합하도록 확장하고, ${\epsilon}$-감도분석의 범위와의 관계성을 분석한다. 마지막으로 Yildirim-Todd의 방법과 최적분할에 의한 감도분석 방법 간의 관계를 규명한다.

• International Journal of Control, Automation, and Systems
• /
• v.4 no.5
• /
• pp.645-652
• /
• 2006

In this paper a new type of filter, called the $H_2/H_{\infty}$ FIR filter, is proposed for discrete-time state space signal models. The proposed filter requires linearity, unbiased property, FIR structure, and independence of the initial state information in addition to the performance criteria in both $H_2$ and $H_{infty}$ sense. It is shown that $H_2,\;H_{\infty}$, and $H_2/H_{\infty}$ FIR filter design problems can be converted into convex programming problems via linear matrix inequalities (LMIs) with a linear equality constraint. Simulation studies illustrate that the proposed FIR filter is more robust against temporary uncertainties and has faster convergence than the conventional IIR filters.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.07a
• /
• pp.892-894
• /
• 2005

Graph partitioning provides an important tool for data clustering, but is an NP-hard combinatorial optimization problem. Spectral clustering where the clustering is performed by the eigen-decomposition of an affinity matrix [1,2]. This is a popular way of solving the graph partitioning problem. On the other hand, semidefinite relaxation, is an alternative way of relaxing combinatorial optimization. issuing to a convex optimization[4]. In this paper we present a semidefinite programming (SDP) approach to graph equi-partitioning for clustering and then we use eigen-decomposition to obtain an optimal partition set. Therefore, the method is referred to as semidefinite spectral clustering (SSC). Numerical experiments with several artificial and real data sets, demonstrate the useful behavior of our SSC. compared to existing spectral clustering methods.

• Proceedings of the KIEE Conference
• /
• 1996.07b
• /
• pp.832-834
• /
• 1996

This paper presents the research on the application of the Hopfield Neural Network to the Economic Load Dispatch problem. The ELD problem has convex cost functions as the objective functions, power balance equation and real power lower/upper limits as the constraints. So we have shown that the possibility of the application of the Hopfield Neural Network to the ELD problem. Through the case study, the simulation results are very close to the numerical method and the dynamic programming method.

• Journal of Korean Institute of Industrial Engineers
• /
• v.18 no.2
• /
• pp.43-49
• /
• 1992

Edge coloring problem is to find a minimum cardinality coloring of the edges of a graph so that any pair of edges incident to a common node do not have the same colors. Edge coloring problem is NP-hard, hence it is unlikely that there exists a polynomial time algorithm. We formulate the problem as a covering of the edges by matchings and find valid inequalities for the convex hull of feasible solutions. We show that adding the valid inequalities to the linear programming relaxation is enough to determine the minimum coloring number(chromatic index). We also propose a method to use the valid inequalities as cutting planes and do the branch and bound search implicitly. An example is given to show how the method works.