• Title/Summary/Keyword: Iterative Solution

Search Result 589, Processing Time 0.024 seconds

A NEW METHOD FOR A FINITE FAMILY OF PSEUDOCONTRACTIONS AND EQUILIBRIUM PROBLEMS

  • Anh, P.N.;Son, D.X.
    • Journal of applied mathematics & informatics
    • /
    • v.29 no.5_6
    • /
    • pp.1179-1191
    • /
    • 2011
  • In this paper, we introduce a new iterative scheme for finding a common element of the set of fixed points of a finite family of strict pseudocontractions and the solution set of pseudomonotone and Lipschitz-type continuous equilibrium problems. The scheme is based on the idea of extragradient methods and fixed point iteration methods. We show that the iterative sequences generated by this algorithm converge strongly to the common element in a real Hilbert space.

AN ITERATIVE ALGORITHM FOR EXTENDED GENERALIZED NONLINEAR VARIATIONAL INCLUSIONS FOR RANDOM FUZZY MAPPINGS

  • Dar, A.H.;Sarfaraz, Mohd.;Ahmad, M.K.
    • Korean Journal of Mathematics
    • /
    • v.26 no.1
    • /
    • pp.129-141
    • /
    • 2018
  • In this slush pile, we introduce a new kind of variational inclusions problem stated as random extended generalized nonlinear variational inclusions for random fuzzy mappings. We construct an iterative scheme for the this variational inclusion problem and also discuss the existence of random solutions for the problem. Further, we show that the approximate solutions achieved by the generated scheme converge to the required solution of the problem.

A Mixed Norm Image Restoration Algorithm Using Multi Regularized Parameters (다중 정규화 매개 변수를 이용한 혼합 norm 영상 복원 방식)

  • 김도령;홍민철
    • Proceedings of the IEEK Conference
    • /
    • 2003.11a
    • /
    • pp.489-492
    • /
    • 2003
  • In this paper, we propose an iterative mixed norm image restoration algorithm using multi regularization parameters. A functional which combines the regularized l$_2$ norm functional and the regularized l$_4$ functional is proposed. The smoothness of each functional is determined by the regularization parameters. Also, a regularization parameter is used to determine the relative importance between the regularized l$_2$ functional and the regularized l$_4$ functional. An iterative algorithm is utilized for obtaining a solution and its convergence is analyzed.

  • PDF

ON THE CONVERGENCE OF PARALLEL GAOR METHOD FOR BLOCK DIAGONALLY DOMINANT MATRICES

  • Liu, Qingbing
    • Journal of applied mathematics & informatics
    • /
    • v.27 no.5_6
    • /
    • pp.1319-1330
    • /
    • 2009
  • In [2] A.Hadjidimos proposed the generalized accelerated over-relaxation (GAOR) methods which generalize the basic iterative method for the solution of linear systems. In this paper we consider the convergence of the two parallel accelerated generalized AOR iterative methods and obtain some convergence theorems for the case when the coefficient matrix A is a block diagonally dominant matrix or a generalized block diagonally dominant matrix.

  • PDF

SYSTEM OF GENERALIZED NONLINEAR REGULARIZED NONCONVEX VARIATIONAL INEQUALITIES

  • Salahuddin, Salahuddin
    • Korean Journal of Mathematics
    • /
    • v.24 no.2
    • /
    • pp.181-198
    • /
    • 2016
  • In this work, we suggest a new system of generalized nonlinear regularized nonconvex variational inequalities in a real Hilbert space and establish an equivalence relation between this system and fixed point problems. By using the equivalence relation we suggest a new perturbed projection iterative algorithms with mixed errors for finding a solution set of system of generalized nonlinear regularized nonconvex variational inequalities.

EFFICIENT PARALLEL ITERATIVE METHOD FOR SOLVING LARGE NONSYMMETRIC LINEAR SYSTEMS

  • Yun, Jae-Heon
    • Communications of the Korean Mathematical Society
    • /
    • v.9 no.2
    • /
    • pp.449-465
    • /
    • 1994
  • The two common numerical methods to approximate the solution of partial differential equations are the finite element method and the finite difference method. They both lead to solving large sparse linear systems. For many applications, it is not unusal that the order of matrix is greater than 10, 000. For this kind of problem, a direct method such as Gaussian elimination can not be used because of the prohibitive cost. To this end, many iterative methods with modest cost have been studied and proposed by numerical analysts.(omitted)

  • PDF

THE METHOD OF LOWER AND UPPER SOLUTIONS FOR IMPULSIVE FRACTIONAL EVOLUTION EQUATIONS IN BANACH SPACES

  • Gou, Haide;Li, Yongxiang
    • Journal of the Korean Mathematical Society
    • /
    • v.57 no.1
    • /
    • pp.61-88
    • /
    • 2020
  • In this paper, we investigate the existence of mild solutions for a class of fractional impulsive evolution equation with periodic boundary condition by means of the method of upper and lower solutions and monotone iterative method. Using the theory of Kuratowski measure of noncompactness, a series of results about mild solutions are obtained. Finally, two examples are given to illustrate our results.

VARIATIONAL-LIKE INCLUSION SYSTEMS VIA GENERAL MONOTONE OPERATORS WITH CONVERGENCE ANALYSIS

  • Dadashi, Vahid;Roohi, Mehdi
    • East Asian mathematical journal
    • /
    • v.26 no.1
    • /
    • pp.95-103
    • /
    • 2010
  • In this paper using Lipschitz continuity of the resolvent operator associated with general H-maximal m-relaxed $\eta$-monotone operators, existence and uniqueness of the solution of a variational inclusion system is proved. Also, an iterative algorithm and its convergence analysis is given.

Simulated Annealing Approach to Evaluation of Maximum Number of Simultaneous Switching Gates

  • Seko, Tadashi;Ohara, Makoto;Kikuno, Tohru
    • Proceedings of the IEEK Conference
    • /
    • 2000.07b
    • /
    • pp.1084-1087
    • /
    • 2000
  • This paper presents a new approach to evaluate the maximum number of simultaneous switching gates of a given combinational circuit. The new approach is based on an iterative method proposed by Sinogi et al. and applies a simulated annealing strategy to search jot a new solution. The experimental evaluation using ISCAS’85 benchmark circuits shows that the proposed approach has attained an excellent improvement compared with other rotated methods including the iterative method.

  • PDF

PERTURBED PROXIMAL POINT ALGORITHMS FOR GENERALIZED MIXED VARIATIONAL INEQUALITIES

  • Jeong, Jae-Ug
    • East Asian mathematical journal
    • /
    • v.18 no.1
    • /
    • pp.95-109
    • /
    • 2002
  • In this paper, we study a class of variational inequalities, which is called the generalized set-valued mixed variational inequality. By using the properties of the resolvent operator associated with a maximal monotone mapping in Hilbert spaces, we have established an existence theorem of solutions for generalized set-valued mixed variational inequalities, suggesting a new iterative algorithm and a perturbed proximal point algorithm for finding approximate solutions which strongly converge to the exact solution of the generalized set-valued mixed variational inequalities.

  • PDF