• Kyungpook Mathematical Journal
• /
• 제62권3호
• /
• pp.533-555
• /
• 2022

In this paper, we introduce a new algorithm for finding a solution of an equilibrium problem in a real Hilbert space. Our paper extends the single projection method to pseudomonotone variational inequalities, from a 2018 paper of Shehu et. al., to pseudomonotone equilibrium problems in a real Hilbert space. On the basis of the given algorithm for the equilibrium problem, we develop a new algorithm for finding a common solution of a equilibrium problem and fixed point problem. The strong convergence of the algorithm is established under mild assumptions. Several of fundamental experiments in finite (infinite) spaces are provided to illustrate the numerical behavior of the algorithm for the equilibrium problem and to compare it with other algorithms.

• Nonlinear Functional Analysis and Applications
• /
• 제29권1호
• /
• pp.225-258
• /
• 2024

In this paper, we study the problem of finding a common solution to a fixed point problem involving a finite family of ρ-demimetric operators and a split monotone inclusion problem with monotone and Lipschitz continuous operator in real Hilbert spaces. Motivated by the inertial technique and the Tseng method, a new and efficient iterative method for solving the aforementioned problem is introduced and studied. Also, we establish a strong convergence result of the proposed method under standard and mild conditions.

• 한국과학교육학회지
• /
• 제26권7호
• /
• pp.835-842
• /
• 2006

이 연구의 목적은 시각에서의 망막 상 이론을 세우는 데 있어 Kepler가 어떻게 과학적 문제를 발견하고 그의 이론 형성 과정에서 어떻게 귀추적 사고를 하였는가를 조사하고, 그 분석 결과를 통해 과학에서의 창의성 교육을 위한 시사점을 얻는 것이었다. 관련 문헌들의 심층적인 분석을 통해, Kepler의 망막 상 이론에서의 과학적 문제 발견은 당시 시각 이론에 대한, 그의 정확하고 적절한 광학적 지식을 바탕으로 한 비판적 분석으로부터 이루어졌으며, 그는 새로운 이론을 세우는 과정에서 이미 알고 있는 구면 렌즈에서의 광학적 현상을 눈의 메카니즘 설명에 도입함으로써 귀추적 사고의 과정을 거쳤음이 밝혀졌다. 이러한 결과들로부터 과학 창의성 교육을 위한 시사점이 다음과 같이 도출되었다. 첫째는, 과학 창의성교수 자료의 개발에 있어서 프로그램 속에 Kepler의 과학적 문제 발견과 같은 상황이 제시될 필요가 있다는 것이며, 둘째로는, 적절하고 정확한 과학적 지식이 과학적 문제를 발견하고 가설을 형성하는 데 있어 필수적이라는 것이 지도되어야 하고, 마지막으로는, 학생 스스로 성공적인 문제 해결 경험을 가질 수 있도록 하고, 그것이 그들로 하여금 새로운 과학적 문제를 발견하는 데까지 이르도록 프로그램을 구성해야 한다는 것이다.

• 대한교통학회지
• /
• 제14권1호
• /
• pp.51-67
• /
• 1996

The optimal path-finding problem becomes complicated when multiple variables are simultaneously considered such as physical route length, degree of congestion, traffic capacity of intersections, number of intersections and lanes, and existence of free ways. Therefore, many researchers in various fields (management science, computer science, applied mathematics, production planning, satellite launching) attempted to solve the problem by ignoring many variables for problem simplification, by developing intelligent algorithms, or by developing high-speed hardware. In this research, an integration of expert system technique and case-based reasoning in high level with a conventional algorithms in lower level was attempted to develop an optimal path-finding system. Early application of experienced driver's knowledge and case data accumulated in case base drastically reduces number of possible combinations of optimal paths by generating promising alternatives and by eliminating non-profitable alternatives. Then, employment of a conventional optimization algorithm provides faster search mechanisms than other methods such as bidirectional algorithm and $A^*$ algorithm. The conclusion obtained from repeated laboratory experiments with real traffic data in Seoul metropolitan area shows that the integrated approach to finding optimal paths with consideration of various real world constraints provides reasonable solution in a faster way than others.

• 대한수학교육학회지:학교수학
• /
• 제1권2호
• /
• pp.547-554
• /
• 1999

This paper gives an example of experimental mathematics education which leads students to understand logically the problem of finding gold from doing some experiments.

• 한국경영과학회지
• /
• 제26권2호
• /
• pp.47-58
• /
• 2001

The purpose of this study is to present methods for determining the k most vital arcs (k-MVAs) in shortest path problem (SPP) using evolutionary algorithms. The problem of finding the k-MVAs in SPP is to find a set of k arcs whose simultaneous removal from the network causes the greatest increase in the shortest distance between two specified nodes. Generally, the problem of determining the k-MVAs in SPP has been known as NP-hard. Therefore, to deal with problems of the real world, heuristic algorithms are needed. In this study we present three kinds of evolutionary algorithms for finding the k-MVAs in SPP, and then to evaluate the performance of proposed algorithms.

• 대한수학회논문집
• /
• 제32권2호
• /
• pp.447-456
• /
• 2017

The purpose of this paper is to introduce some strong convergence theorems for the problem of finding a common zero of a finite family of monotone operators and the problem of finding a common fixed point of a finite family of nonexpansive in Hilbert spaces by hybrid projection method.

• 대한수학회보
• /
• 제54권4호
• /
• pp.1347-1359
• /
• 2017

The purpose of this paper is to give some new iterative methods for finding a common zero of a finite family of monotone operators in Hilbert spaces. We also give the applications of the obtained result for the convex feasibility problem and constrained convex optimization problem in Hilbert spaces.

• Journal of applied mathematics & informatics
• /
• 제6권3호
• /
• pp.727-734
• /
• 1999

Let G be a connected graph of n vertices. The problem of finding a depth-first spanning tree of G is to find a connected subgraph of G with the n vertices and n-1 edges by depth-first-search. in this paper we propose an O(n) time algorithm to solve this problem on permutation graphs.

• 국제학술발표논문집
• /
• The 2th International Conference on Construction Engineering and Project Management
• /
• pp.777-786
• /
• 2007

This paper presents a modified simulated annealing algorithm to optimize linear scheduling projects with multiple resource constraints and its effectiveness is verified with a proposed problem. A two-stage solution-finding procedure is used to model the problem. Then the simulated annealing and the modified simulated annealing are compared in the same condition. The comparison results and the reasons of improvement by the modified simulated annealing are presented at the end.