• Journal of applied mathematics & informatics
• /
• v.30 no.3_4
• /
• pp.365-380
• /
• 2012

Non-negative matrix factorization (NMF) is a very efficient method to explain the relationship between functions for finding basis information of multivariate nonnegative data. The multiplicative update (MU) algorithm is a popular approach to solve the NMF problem, but it fails to approach a stationary point and has inner iteration and zero divisor. So the elementwisely alternating projected gradient (eAPG) algorithm was proposed to overcome the defects. In this paper, we use the fact that the equilibrium point is stable to prove the convergence of the eAPG algorithm. By using a classic model, the equilibrium point is obtained and the invariant sets are constructed to guarantee the integrity of the stability. Finally, the convergence conditions of the eAPG algorithm are obtained, which can accelerate the convergence. In addition, the conditions, which satisfy that the non-zero equilibrium point exists and is stable, can cause that the algorithm converges to different values. Both of them are confirmed in the experiments. And we give the mathematical proof that the eAPG algorithm can reach the appointed precision at the least iterations compared to the MU algorithm. Thus, we theoretically illustrate the advantages of the eAPG algorithm.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2015.10a
• /
• pp.954-957
• /
• 2015

In this paper, the android platform based on the morning call system using multi-point group communication is proposed. Implemented multi-point group communication was applied by fusing a variety of techniques such as JAVA NIO, JSP, MySQL, DBMS Pool, GCM and JSON. Some experiments are conducted so as to verify the proposed method, and as a result, morning-call application based multi-point group communication is well performed.

• Journal of Powder Materials
• /
• v.30 no.1
• /
• pp.29-34
• /
• 2023

A fixed-point iteration is proposed to integrate the stress and state variables in the incremental analysis of plastic deformation. The Conventional Newton-Raphson method requires a second-order derivative of the yield function to generate a complicated code, and the convergence cannot be guaranteed beforehand. The proposed fixed-point iteration does not require a second-order derivative of the yield function, and convergence is ensured for a given strain increment. The fixed-point iteration is easier to implement, and the computational time is shortened compared with the Newton-Raphson method. The plane-stress condition is considered for the biaxial loading conditions to confirm the convergence of the fixed-point iteration. 3-dimensional tensile specimen is considered to compare the computational times in the ABAQUS/explicit finite element analysis.

• Journal of the Korean Statistical Society
• /
• v.31 no.2
• /
• pp.261-276
• /
• 2002

Probability density or its derivatives may have a discontinuity/change point at an unknown location. We propose a method of estimating the location and the jump size of the discontinuity point based on kernel type density or density derivatives estimators with one-sided equivalent kernels. The rates of convergence of the proposed estimators are derived, and the finite-sample performances of the methods are illustrated by simulated examples.

• Journal of the Korean Mathematical Society
• /
• v.53 no.3
• /
• pp.691-707
• /
• 2016

In this paper, we first introduce two one-parameter relaxation (OPR) iterative methods for solving singular saddle point problems whose semi-convergence rate can be accelerated by using scaled preconditioners. Next we present formulas for finding their optimal parameters which yield the best semi-convergence rate. Lastly, numerical experiments are provided to examine the efficiency of the OPR methods with scaled preconditioners by comparing their performance with the parameterized Uzawa method with optimal parameters.

• Bulletin of the Korean Mathematical Society
• /
• v.52 no.5
• /
• pp.1669-1681
• /
• 2015

In this paper, we provide semi-convergence results of the parameterized inexact Uzawa method with singular preconditioners for solving singular saddle point problems. We also provide numerical experiments to examine the effectiveness of the parameterized inexact Uzawa method with singular preconditioners.

• Proceedings of the KSR Conference
• /
• 2007.05a
• /
• pp.1375-1381
• /
• 2007

Optimization system for convergence point control is required for train control system, this paper introduces the way of enhanced optimization for convergence point with data of intelligence full prediction system. Also the result of the intelligence full prediction system is useful for train control system at the convergence point and passenger will take more accurate information from the prediction system.

• The Pure and Applied Mathematics
• /
• v.16 no.1
• /
• pp.13-18
• /
• 2009

A semilocal convergence analysis is provided for Newton's method in a Banach space. The inverses of the operators involved are only locally $H{\ddot{o}}lderian$. We make use of a point-based approximation and center-$H{\ddot{o}}lderian$ hypotheses for the inverses of the operators involved. Such an approach can be used to approximate solutions of equations involving nonsmooth operators.

• Journal of the military operations research society of Korea
• /
• v.25 no.2
• /
• pp.97-105
• /
• 1999

When infeasible interior-point methods are applied to large-scale linear programming problems, they become unstable and cannot solve the problems if convergence rates of primal feasibility, dual feasibility and duality gap are not well-balanced. We can balance convergence rates of primal feasibility, dual feasibility and duality gap by introducing control parameters. As a result, the stability and the efficiency of infeasible interior-point methods can be improved.

• The Pure and Applied Mathematics
• /
• v.15 no.2
• /
• pp.111-120
• /
• 2008

A semi local convergence analysis is provided for Newton's method in a Banach space setting. The operators involved are only locally Holderian. We make use of a point-based approximation and center-Holderian hypotheses. This approach can be used to approximate solutions of equations involving nonsmooth operators.