• Journal of the Chungcheong Mathematical Society
• /
• v.23 no.4
• /
• pp.801-812
• /
• 2010

In this paper, we consider the convergence of the shrinking projection method for quasi-$\phi$-nonexpansive mappings. Strong convergence theorems are established in a uniformly smooth and strictly convex Banach space which enjoys the Kadec-Klee property.

• Nonlinear Functional Analysis and Applications
• /
• v.26 no.4
• /
• pp.781-792
• /
• 2021

In this paper, we study well-posed problems and variational inequalities in locally convex Hausdorff topological vector spaces. The necessary and sufficient conditions are obtained for the existence of solutions of variational inequality problems and quasi variational inequalities even when the underlying set K is not convex. In certain cases, solutions obtained are not unique. Moreover, counter examples are also presented for the authenticity of the main results.

• Journal of the Chungcheong Mathematical Society
• /
• v.27 no.2
• /
• pp.271-276
• /
• 2014

Recently, Taji [7] and Harms et al. [4] studied the regularized gap function of QVI analogous to that of VI by Fukushima [2]. Discussions are made in a finite dimensional Euclidean space. In this note, an infinite dimensional generalization is considered in the framework of a reflexive Banach space. To do so, we introduce an extended quasi-variational inequality problem (in short, EQVI) and a generalized regularized gap function of EQVI. Then we investigate some basic properties of it. Our results may be regarded as an infinite dimensional extension of corresponding results due to Taji [7].

• Journal of applied mathematics & informatics
• /
• v.23 no.1_2
• /
• pp.311-319
• /
• 2007

This article studies a modified BFGS algorithm for solving smooth unconstrained strongly convex minimization problem. The modified BFGS method is based on the new quasi-Newton equation $B_k+1{^s}_k=yk\;where\;y_k^*=yk+A_ks_k\;and\;A_k$ is a matrix. Wei, Li and Qi [WLQ] have proven that the average performance of two of those algorithms is better than that of the classical one. In this paper, we prove the global convergence of these algorithms associated to a general line search rule.

• Journal of applied mathematics & informatics
• /
• v.23 no.1_2
• /
• pp.183-191
• /
• 2007

In this paper, we introduce and study a new class of equilibrium problems, known as regularized mixed quasi equilibrium problems. We use the auxiliary principle technique to suggest and analyze some iterative schemes for regularized equilibrium problems. We prove that the convergence of these iterative methods requires either pseudomonotonicity or partially relaxed strongly monotonicity. Our proofs of convergence are very simple. As special cases, we obtain earlier results for solving equilibrium problems and variational inequalities involving the convex sets.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.59 no.4
• /
• pp.797-802
• /
• 2010

In this paper, a systematic procedure to design a nonlinear controller for nonlinear active magnetic bearing (AMB) systems is presented. To do this, we effectively convert the AMB system into a polytopic quasi-linear parameter varying (LPV) system, which is a representation of nonlinear state-space models and is described by the convex combination of a set of precisely known vertices. Unlike the existing quasi-LPV systems, the nonlinear weighting functions, which construct the polytopic quasi-LPV model of the AMB system by connecting the vertices, include not only state variables but also the input ones. This allows us to treat the input nonlinearity effectively. By means of the derived polytopic quasi-LPV model and linear matrix inequality (LMI) conditions, nonlinear controller that stabilizes the AMB system is obtained. The effectiveness of the proposed controller design methodology is finally demonstrated through numerical simulations.

• Journal of applied mathematics & informatics
• /
• v.22 no.1_2
• /
• pp.193-208
• /
• 2006

A modified BFGS algorithm for solving the unconstrained optimization, whose Hessian matrix at the minimum point of the convex function is of rank defects, is presented in this paper. The main idea of the algorithm is first to add a modified term to the convex function for obtain an equivalent model, then simply the model to get the modified BFGS algorithm. The superlinear convergence property of the algorithm is proved in this paper. To compared with the Tensor algorithms presented by R. B. Schnabel (seing [4],[5]), this method is more efficient for solving singular unconstrained optimization in computing amount and complication.

• Journal of applied mathematics & informatics
• /
• v.11 no.1_2
• /
• pp.273-281
• /
• 2003

The purpose of this paper is to study the duality theorems in cone constrained multiobjective nonlinear programming for pseudo-invex objectives and quasi-invex constrains and the constraint cones are arbitrary closed convex ones and not necessarily the nonnegative orthants.

• Kyungpook Mathematical Journal
• /
• v.49 no.4
• /
• pp.667-674
• /
• 2009

In this paper, a new one-step iterative scheme with error for approximating common fixed points of asymptotically quasi-nonexpansive type nonself-mappings in Banach space is defined. The results obtained in this paper extend and improve the recent ones, announced by H. Y. Zhou, Y. J. Cho, and S. M. Kang [Zhou et al.,(2007), namely, A new iterative algorithm for approximating common fixed points for asymptotically non-expansive mappings, published to Fixed Point Theory and Applications 2007 : 1-9], and many others.

• Korean Journal of Mathematics
• /
• v.31 no.1
• /
• pp.35-48
• /
• 2023

Let 𝔼 be a CAT(0) space and K be a nonempty closed convex subset of 𝔼. Let T : K → 𝓟(K) be a multimap such that F(T) ≠ ∅ and ℙ_T(x) = {y ∈ Tx : d(x, y) = d(x, Tx)}. Define sequence {x_n} by x_n+1 = (1 - α)𝜈_n⊕αw_n, y_n = (1 - β)u_n⊕βw_n, z_n = (1-γ)x_n⊕γu_n where α, β, γ ∈ [0; 1]; u_n ∈ ℙ_T (x_n); 𝜈_n ∈ ℙ_T (y_n) and w_n ∈ ℙ_T (z_n). (1) If ℙ_T is quasi-nonexpansive, then it is proved that {x_n} converges strongly to a fixed point of T. (2) If a multimap T satisfies Condition(I) and ℙ_T is quasi-nonexpansive, then {x_n} converges strongly to a fixed point of T. (3) Finally, we establish a weak convergence result. Our results extend and unify some of the related results in the literature.