• Journal of the Korean Mathematical Society
• /
• v.41 no.3
• /
• pp.489-499
• /
• 2004

In this paper, we introduce and study a new system of nonlinear variational inequalities. The existence and uniqueness of solution for this problem are proved and an iterative algorithm for approximating the solution of system of nonlinear variational inequalities is constructed.

• Korean Journal of Mathematics
• /
• v.24 no.3
• /
• pp.495-524
• /
• 2016

In this paper, we propose an iterative algorithm for finding a common solution of a system of generalized equilibrium problems, a split equilibrium problem and a hierarchical fixed point problem over the common fixed points set of a finite family of nonexpansive mappings in Hilbert spaces. Furthermore, we prove that the proposed iterative method has strong convergence under some mild conditions imposed on algorithm parameters. The results presented in this paper improve and extend the corresponding results reported by some authors recently.

• Honam Mathematical Journal
• /
• v.15 no.1
• /
• pp.105-120
• /
• 1993

The auxiliary principle technique is used to prove the uniqueness and the existence of solutions for a class of nonlinear variational inequalities and suggest an innovative iterative algorithm for computing the approximate solution of variational inequalities. Error estimates for the finite element approximation of the solution of variational inequalities are derived, which refine the previous known results. An example is given to illustrate the applications of the results obtained. Several special cases are considered and studied.

• Journal of the Korean Statistical Society
• /
• v.5 no.1
• /
• pp.35-48
• /
• 1976

Since the solution vector for input-output forecasting models is not directly obtainable, several iterative procedures have been proposed and utilized. As is often the case in numerical analysis, the question of the consistency between the original system and the converged system of the proposed iteration has been ignored, and no one has tried to express the converged solution explicitly. This paper examines this question and points out the inconsistencies between various well-known iterative procedures used to solve input-output models and the original input-output system.

• Proceedings of the KIEE Conference
• /
• 1999.07c
• /
• pp.1506-1509
• /
• 1999

This paper presents a new economic dispatch algorithm to improve the unit commitment solution while guaranteeing the near optimal solution without reducing calculation speed. The conventional economic dispatch algorithms have the problem that it is not applicable to the unit commitment formulation due to the frequent on/off state changes of units during the unit commitment calculation. Therefore, piecewise linear iterative method have generally been used for economic dispatch algorithm for unit commitment. In that method, the approximation of the generator cost function makes it hard to obtain the optimal economic dispatch solution. In this case, the solution can be improved by introducing a inverse of the incremental cost function. The proposed method is tested with sample system. The results are compared with the conventional piecewise linear iterative method. It is shown that the proposed algorithm yields more accurate and economical solution without calculation speed reduction.

• Journal of Institute of Control, Robotics and Systems
• /
• v.13 no.7
• /
• pp.683-687
• /
• 2007

In last decades, several linearization methods for the AOA measurements have been proposed, for example, Gauss-Newton method and Closed-Form solution. Gauss-Newton method can achieve high accuracy, but the convergence of the iterative process is not always ensured if the initial guess is not accurate enough. Closed-Form solution provides a non-iterative solution and it is less computational. It does not suffer from convergence problem, but estimation error is somewhat larger. This paper proposes a Self-Tuning Weighted Least Square AOA algorithm that is a modified version of the conventional Closed-Form solution. In order to estimate the error covariance matrix as a weight, a two-step estimation technique is used. Simulation results show that the proposed method has smaller positioning error compared to the existing methods.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• v.1
• /
• pp.485-489
• /
• 2006

In last decades, several linearization methods for the AOA measurements have been proposed, for example, Gauss-Newton method and closed-form solution. Gauss-Newton method can achieve high accuracy, but the convergence of the iterative process is not always ensured if the initial guess is not accurate enough. Closed-form solution provides a non-iterative solution and it is less computational. It does not suffer from convergence problem, but estimation error is somewhat larger. This paper proposes a self-tuning weighted least square AOA algorithm that is a modified version of the conventional closed-form solution. In order to estimate the error covariance matrix as a weight, two-step estimation technique is used. Simulation results show that the proposed method has smaller positioning error compared to the existing methods.

• Journal of applied mathematics & informatics
• /
• v.7 no.2
• /
• pp.539-552
• /
• 2000

In this paper, we established the general comparison principles for IVP of impulsive differential equations with time variables, which strictly extend and improve the precious comparison results obtained by V. Lakes. et.al . and S.K.Kaul([3]-[7]). Whit the general comparison results, we constructed the monotone iterative sequences of solution for IVP of such equations which converges the maximal and minimal and minimal solutions , respectively.

• East Asian mathematical journal
• /
• v.34 no.1
• /
• pp.47-58
• /
• 2018

In this paper, we consider a fuzzy nonlinear random variational inclusion problems involving ordered RME-multivalued mapping in ordered Banach spaces. By using the random relaxed resolvent operator and its properties, we suggest an random iterative algorithm. Finally both the existence of the random solution of the original problem and the convergence of the random iterative sequences generated by random algorithm are proved.

• Communications of the Korean Mathematical Society
• /
• v.26 no.1
• /
• pp.51-65
• /
• 2011

In this paper, a composite iterative process is introduced for a generalized equilibrium problem and a pair of nonexpansive mappings. It is proved that the sequence generated in the purposed composite iterative process converges strongly to a common element of the solution set of a generalized equilibrium problem and of the common xed point of a pair of nonexpansive mappings.