• Honam Mathematical Journal
• /
• v.41 no.2
• /
• pp.369-380
• /
• 2019

Inspired by the problem of finding hyperelastic curves in a Riemannian manifold, we present a study on the variational problem of a hyperelastic curve in Lie group. In a Riemannian manifold, we reorganize the characterization of the hyperelastic curve with appropriate constraints. By using this equilibrium equation, we derive an Euler-Lagrange equation for the hyperelastic energy functional defined in a Lie group G equipped with bi-invariant Riemannian metric. Then, we give a solution of this equation for a null hyperelastic Lie quadratic when Lie group G is SO(3).

• Nonlinear Functional Analysis and Applications
• /
• v.28 no.2
• /
• pp.337-363
• /
• 2023

In this paper, we propose a new subgradient extragradient algorithm for finding a solution of monotone bilevel equilibrium problem in reflexive Banach spaces. The strong convergence of the algorithm is established under monotone assumptions of the cost bifunctions with Bregman Lipschitz-type continuous condition. Finally, a numerical experiments is reported to illustrate the efficiency of the proposed algorithm.

• Journal of applied mathematics & informatics
• /
• v.17 no.1_2_3
• /
• pp.1-23
• /
• 2005

The shortest-paths problem is a fundamental problem in graph theory and finds diverse applications in various fields. This is why shortest path algorithms have been designed more thoroughly than any other algorithm in graph theory. A large number of optimization problems are mathematically equivalent to the problem of finding shortest paths in a graph. The shortest-path between a pair of vertices is defined as the path with shortest length between the pair of vertices. The shortest path from one vertex to another often gives the best way to route a message between the vertices. This paper presents an $O(n^2)$ time sequential algorithm and an $O(n^2/p+logn)$ time parallel algorithm on EREW PRAM model for solving all pairs shortest paths problem on circular-arc graphs, where p and n represent respectively the number of processors and the number of vertices of the circular-arc graph.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.10 no.2
• /
• pp.161-167
• /
• 2000

In this paper, we propose a design method for BAMs(bidirectiona1 associative memories) which can perform the function of bidirectional association efficiently. Based on the theoretical investigation about the properties of BAMs, we first formulate the problem of finding a BAM that can store the given pattern pairs as stable states with high error correction ratio in the form of a constrained optimization problem. Next, we transform the constrained optimization problem into a GEVP(genera1ized eigenvalue problem), which can be solved by recently developed interior point methods. The applicability of the proposed method is illustrated via design examples.

• Journal of Korean Institute of Industrial Engineers
• /
• v.23 no.3
• /
• pp.487-500
• /
• 1997

In this paper, we introduce the shortest flow-generating path problem in the generalized network. As the simplest generalized network model, this problem captures many of the most salient core ingredients of the generalized network flows and so it provides both a benchmark and a point of departure for studying more complex generalized network models. We show that the generalized label-correcting algorithm for the shortest flow-generating path problem has O(mn) time complexity if it starts with a good point and also propose an O($n^3m^2$) algorithm for finding a good starting point. Hence, the shortest flow-generating path problem is solved in O($n^3m^2$) time.

• Journal of Korean Institute of Industrial Engineers
• /
• v.31 no.1
• /
• pp.10-19
• /
• 2005

The minimum spanning tree (MST) problem is one of the traditional optimization problems. Unlike the MST, the degree constrained minimum spanning tree (DCMST) of a graph cannot, in general, be found using a polynomial time algorithm. So, finding the DCMST of a graph is a well-known NP-hard problem of importance in communications network design, road network design and other network-related problems. So, it seems to be natural to use evolutionary algorithms for solving DCMST. Especially, when applying an evolutionary algorithm to spanning tree problems, a representation and search operators should be considered simultaneously. This paper introduces a new tree representation scheme and a genetic operator for solving combinatorial tree problem using evolutionary algorithms. We performed empirical comparisons with other tree representations on several test instances and could confirm that the proposed method is superior to other tree representations. Even it is superior to edge set representation which is known as the best algorithm.

• 제어로봇시스템학회:학술대회논문집
• /
• 1996.10b
• /
• pp.747-750
• /
• 1996

This paper considers the problem of robust H$_{\infty}$ control with regional stability constraints via output feedback to assure robust performance for uncertain linear systems. A robust H$_{\infty}$ control problem and the generalized Lyapunov theory are introduced for dealing with the problem, The output feedback H$_{\infty}$ controller makes the controlled outputs settle within a given bound and the control input not to be saturated. The regional stability constraints problem for uncertain systems can be reduced to the problem for the nominal systems by finding sufficient bounds of variations of the closed-loop poles due to modeling uncertainties. A controller design procedure is established using the Lagrange multiplier method. The controller design technique was illustrated on the track-following system of a optical disk drive.ve.

• The Mathematical Education
• /
• v.46 no.1 s.116
• /
• pp.69-79
• /
• 2007

Students experience many problem solving activities in school mathematics. These activities have focused on finding the solution whose existence was known, and then again conjecture about existence of solution or posing of problems has been neglected. It needs to put more emphasis on conjecture and problem posing activities in school mathematics. To do this, a model and examples of designing mathematical activities centered on conjecture and problem posing are needed. In this article, we introduce some examples of designing such activities (from the pythagorean theorem, the determination condition of triangle, and existing solved-problems in textbook) and examine suggestions for mathematics education. Our examples can be used as instructional materials for mathematically able students at middle school.

• Proceedings of the Korea Society for Industrial Systems Conference
• /
• 1997.11a
• /
• pp.535-552
• /
• 1997

The facility layout problem has the goal of locating the different facilities in a floor to achieve the greatest efficiency in producing a product or service. This problem is usually formulated as the quadratic assignment problem(QAP). However, the problem of finding optimal layout is hard and traditional approaches are not computationally feasible. In this paper, a genetic algorithm is presented for obtaining efficient layouts. To test the effectiveness of the algorithm, a set of examples is solved and the results are compared to those from other Known algorithms. The comparison indicates that the proposed method performs well for the classical test problems.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 1996.04a
• /
• pp.182-189
• /
• 1996

The focus of this study is on the problem of the design of structure of undetermined topology. This problem has been regarded as being the most challenging of structural optimization problems, because of the difficulty of allowing topology to change. Conventional approaches break down when element sizes approach to zero, due to stiffness matrix singularity. In this study, a novel nonlinear Programming formulation of the topology Problem is developed and examined. Its main feature is the ability to account for topology variation through zero element sizes. Stiffness matrix singularity is avoided by embedding the equilibrium equations as equality constraints in the optimization problem. Although the formulation is general, two dimensional plane elasticity examples are presented. The design problem is to find minimum weight of a plane structure of fixed geometry but variable topology, subject to constraints on stress and displacement. Variables are thicknesses of finite elements, and are permitted to assume zero sizes. The examples demonstrate that the formulation is effective for finding at least a locally minimal weight.